Abstract
We formulate a simple edge generation rule based on an inverse like mass action principle for random graphs over a structured vertex set. We show that under very weak assumptions on this structure one obtains a scale free distribution for the degree. We furthermore introduce and study a “my friends are your friends” local search principle which makes the clustering coefficient large.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
R. Albert and A.-L. Barabá;si, Statistical mechanics of complex networks, Reviews of Modern Physics 74:47(2002), arXiv:cond-mat/0106096.
A.-L. Barabá;si and R. Albert, Emergence of scaling in random networks, Science 286:509(1999).
Ph. Blanchard, C.-H. Chang, and T. Krueger, Epidemic thresholds on scale-free graphs: The interplay between exponent and preferential choice, arXiv:cond-mat/0207319, (2002), to appear in Annales Henri Poincaré
Ph. Blanchard, T. Krueger, and A. Ruschhaupt, Small World Graphs by the Iterated “My Friends are Your Friends” Principle, arXiv:cond-mat/0304563, (2003).
G. Caldarelli, A. Capocci, P. De Los Rios, and M. A. Munoz, Scale-free networks from varying vertex intrinsic fitness, Phys. Rev. Lett. 89:25(2002).
I. Kontoyiannis, P. Harremoes, and O. Johnson, Entropy and the Law of Small Numbers, arXiv:math/0211020, (2002).
D. J. Watts and S. H. Strogatz, Collective dynamics of “small-world” networks, Nature 393:440(1998).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Blanchard, P., Krüger, T. The “Cameo Principle” and the Origin of Scale-Free Graphs in Social Networks. Journal of Statistical Physics 114, 1399–1416 (2004). https://doi.org/10.1023/B:JOSS.0000013969.87579.39
Issue Date:
DOI: https://doi.org/10.1023/B:JOSS.0000013969.87579.39