Growing scale-free networks with tunable clustering
- 11 January 2002
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 65 (2), 026107
- https://doi.org/10.1103/physreve.65.026107
Abstract
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.Keywords
This publication has 19 references indexed in Scilit:
- A study of a large sociogram II. Elimination of free parametersBehavioral Science, 2007
- Exploring complex networksNature, 2001
- Models of the Small WorldJournal of Statistical Physics, 2000
- Collective dynamics of ‘small-world’ networksNature, 1998
- Markov GraphsJournal of the American Statistical Association, 1986
- Random and biased networks: simulations and approximationsSocial Networks, 1985
- EditorialSocial Networks, 1979
- Clustering and Structural Balance in GraphsHuman Relations, 1967
- Contribution to the theory of random and biased netsBulletin of Mathematical Biology, 1957
- Spread of information through a population with socio-structural bias: I. Assumption of transitivityBulletin of Mathematical Biology, 1953