Are Randomly Grown Graphs Really Random?
AbstractWe analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability \delta, two vertices are chosen uniformly at random and joined by an undirected edge. This process is repeated for t time steps. In the limit of large t, the resulting graph displays surprisingly rich characteristics. In particular, a giant component emerges in an infinite-order phase transition at \delta = 1/8. At the transition, the average component size jumps discontinuously but remains finite. In contrast, a static random graph with the same degree distribution exhibits a second-order phase transition at \delta = 1/4, and the average component size diverges there. These dramatic differences between grown and static random graphs stem from a positive correlation between the degrees of connected vertices in the grown graph--older vertices tend to have higher degree, and to link with other high-degree vertices, merely by virtue of their age. We conclude that grown graphs, however randomly they are constructed, are fundamentally different from their static random graph counterparts.
Download InfoTo our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Bibliographic InfoPaper provided by Santa Fe Institute in its series Working Papers with number 01-05-025.
Date of creation: May 2001
Date of revision:
Contact details of provider:
Postal: 1399 Hyde Park Road, Santa Fe, New Mexico 87501
Web page: http://www.santafe.edu/sfi/publications/working-papers.html
More information through EDIRC
This paper has been announced in the following NEP Reports:
- NEP-ENT-2001-07-17 (Entrepreneurship)
- NEP-EVO-2001-07-17 (Evolutionary Economics)
- NEP-NET-2001-07-17 (Network Economics)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Konno, Tomohiko, 2009. "Network structure of Japanese firms. Scale-free, hierarchy, and degree correlation: analysis from 800,000 firms," Economics - The Open-Access, Open-Assessment E-Journal, Kiel Institute for the World Economy, vol. 3(31), pages 1-13.
- Morehead, Raymond & Noore, Afzel, 2007. "Novel hybrid mitigation strategy for improving the resiliency of hierarchical networks subjected to attacks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 378(2), pages 603-612.
- Brot, Hilla & Muchnik, Lev & Goldenberg, Jacob & Louzoun, Yoram, 2012. "Feedback between node and network dynamics can produce real-world network properties," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(24), pages 6645-6654.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel).
If references are entirely missing, you can add them using this form.