DocumentCode
2568756
Title
Evolving scale-free network model with tunable clustering and APL
Author
Li, Jun ; Diao, Yong-feng ; Yin, Xing ; Ye, Zheng-wang
Author_Institution
Dept. of Comput. Coll., China West Normal Univ., Nanchong
fYear
2008
fDate
2-4 July 2008
Firstpage
4399
Lastpage
4404
Abstract
A great number of real network models exhibit the classical characteristics of networks: an exponential degree distribution, high clustering coefficient and a short average path length (APL). In order to construct more really network models, the process of adding edges is divided into two processes based on Wang Bing model that Wang Bing proposes a kind of Evolving scale-free network model with tunable clustering. One process increases the clustering coefficient. Another process reduces the APL. This article proposes a scale-free network model with tunable clustering and APL. Using continuum theory and rate equations method to calculate the degree distribution, the clustering coefficient and APL, the analytical result indicates that the degree distribution follows power law and the clustering coefficient and the APL can be tuned with tow parameters. The APL is estimated analytically, which increases at logarithmically, constantly or negative logarithmically with the time by tuning with tow parameters.
Keywords
complex networks; APL; Wang Bing model; average path length; continuum theory; exponential degree distribution; rate equations method; scale-free network model; tunable clustering; Computer networks; Distributed computing; Educational institutions; Electronic mail; Equations; IP networks; average path length; clustering coefficient; degree distribution; scale-free network;
fLanguage
English
Publisher
ieee
Conference_Titel
Control and Decision Conference, 2008. CCDC 2008. Chinese
Conference_Location
Yantai, Shandong
Print_ISBN
978-1-4244-1733-9
Electronic_ISBN
978-1-4244-1734-6
Type
conf
DOI
10.1109/CCDC.2008.4598161
Filename
4598161
Link To Document