Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (8): 5-7.DOI: 10.3778/j.issn.1002-8331.2010.08.002
• 博士论坛 • Previous Articles Next Articles
YAO Can-zhong,YANG Jian-mei
Received:
Revised:
Online:
Published:
Contact:
姚灿中,杨建梅
通讯作者:
Abstract: This paper uses the Welch Powell’s graph coloring algorithm to improve the box covering algorithm for calculating the fractal dimension of the complex networks.After analyzing the advantages and effeciency of that improved algorithm this paper applies the algorithm to calculate the box dimension of American avigation network(1997) and the yeast protein network, discloses the fractal properties of the two complex network and finally makes explainations of two real networks.
摘要: 采用Welch Powell法对复杂网络分形的盒覆盖算法进行了改进,分析了改进算法的优越性、有效性,并对美国航空网(1997)和酵母蛋白质网进行了实验,揭示了两个复杂网络均具有分形特性。最后对这两个实际网络的分形含义进行了一定的解释。
CLC Number:
TP301
YAO Can-zhong,YANG Jian-mei. Improved box dimension calculation algorithm for fractality of complex networks[J]. Computer Engineering and Applications, 2010, 46(8): 5-7.
姚灿中,杨建梅. 复杂网络分形的盒维数改进算法[J]. 计算机工程与应用, 2010, 46(8): 5-7.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2010.08.002
http://cea.ceaj.org/EN/Y2010/V46/I8/5