Phys. Rev. E 65, 026107 (2002) [4 pages]Growing scale-free networks with tunable clusteringReceived 21 September 2001; published 11 January 2002 We extend the standard scale-free network model to include a “triad formation step.” We analyze the geometric properties of networks generated by this algorithm both analytically and by numerical calculations, and find that our model possesses the same characteristics as the standard scale-free networks such as the power-law degree distribution and the small average geodesic length, but with the high clustering at the same time. In our model, the clustering coefficient is also shown to be tunable simply by changing a control parameter—the average number of triad formation trials per time step. © 2002 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevE.65.026107
DOI:
10.1103/PhysRevE.65.026107
PACS:
89.75.Fb, 89.75.Hc, 89.65.-s
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.