Effect of the accelerating growth of communications networks on their structure

Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics

Volumn 63, Issue 2, 2001, Pages

  Dorogovtsev, S N ^a,b   Mendes, J F F ^a  

^a UNIVERSITY OF PORTO   (Portugal)

^b IOFFE INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 18344369006     PISSN: 1063651X     EISSN: None     Source Type: Journal    
DOI: 10.1103/PhysRevE.63.025101     Document Type: Article

References (21)

1. R. Albert, H. Jeong, and A.-L. Barabási, Nature (London) (London) 401, 130 (1999).
2. A.-L. Barabási and R. Albert, Science 286, 509 (1999).
3. R. Albert, H. Jeong, and A.-L. Barabási, Nature (London) (London) 406, 378 (2000).
4. R. Albert and A.-L. Barabási, Phys. Rev. Lett. 85, 5234 (2000).
5. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener, in Proceedings of the 9th WWW Conference (Elsevier, Amsterdam, 2000), p. 309.
6. M. E. J. Newman, S. H. Strogatz, and D. J. Watts, e-print cond-mat/0007235.
7. D. S. Callaway, M. E. J. Newman, S. H. Strogatz, and D. J. Watts, Phys. Rev. Lett. 85, 5468 (2000).
8. R. Cohen, K. Erez, D. ben-Avraham, and S. Havlin, Phys. Rev. Lett. 85, 4626 (2000).
9. S. N. Dorogovtsev, J. F. F. Mendes, and A. N. Samukhin, Phys. Rev. Lett. 85, 4633 (2000).
10. S. N. Dorogovtsev and J. F. F. Mendes, Phys. Rev. E 63, 056125 (2001);
11. S. N. DorogovtsevJ. F. F. Mendese-print cond-mat/0012009.
12. B. Tadic, Physica A 293, 273 (2001).
13. P. L. Krapivsky, G. J. Rodgers, and S. Redner, Phys. Rev. Lett. 86, 5401 (2001).
14. G. Ergun and G. J. Rodgers, e-print cond-mat/0103423.
15. M. Molloy and B. Reed, Random Struct. Algorithms 6, 161 (1995).
16. M. Molloy and B. Reed, Combinatorics, Probab. Comput. 7, 295 (1998).
17. Rigorously speaking, to study the resilience of the giant connected components to random damage, one has to consider networks with randomly deleted vertices or edges (see Refs. 78). Nevertheless, the divergence of the moments of the undamaged network already indicates its anomalous resilience, since it cannot be removed by random damage 78.
18. S. Janson, T. Luczak, and A. Rucinski, Random Graphs (Wiley, New York, 2000).
19. P. L. Krapivsky, S. Redner, and F. Leyvraz, Phys. Rev. Lett. 85, 4629 (2000).
20. P. L. Krapivsky and S. Redner, e-print cond-mat/0011094.
21. Note that even if the average degree z is large, the size W of the GWCC, in principle, may subsequently deviate from (Formula presented). One can easily check this using, e.g., degree distributions similar to the distributions considered above. The Poisson distribution with large z produces extremely small values (Formula presented) since there are few dead ends in this case.