Robustness and Vulnerability of scale-free random graphs

Internet Mathematics

Volumn 1, Issue 1, 2004, Pages 1-35

  Bollobás, Béla ^a   Riordan, Oliver ^b  

^a University of Memphis   (United States)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84906244198     PISSN: 15427951     EISSN: 19449488     Source Type: Journal    
DOI: 10.1080/15427951.2004.10129080     Document Type: Article

References (22)

1. [Aiello et al. 01] W. Aiello, F. Chung, and L. Lu. "A Random Graph Model for Power Law Graphs". Experiment. Math. 10 (2001), 53-66.
2. [Albert and Barabási 02] R. Albert and A.-L. Barabási. "StatisticalMechanics of Complex Networks". Rev. Mod. Phys. 74 (2002), 47-97.
3. [Albert et al. 00] R. Albert, H. Jeong, and A.-L. Barabási. "Error and Attack Tolerance of Complex Networks". Nature 406 (2000), 378-382.
4. [Barabási and Albert 99] A.-L. Barabási and R. Albert. "Emergence of Scaling in Random Networks". Science 286 (1999), 509-512.
5. [Bollobás and Riordan to appear] B. Bollobás and O. Riordan. "The Diameter of a Scale-Free Random Graph". To appear in Combinatorica. Preprint available from World Wide Web (http://www.dpmms.cam.ac.uk/~omr10/).
6. [Bollobás and Riordan 02] B. Bollobás and O. Riordan. "Mathematical Results on Scale-Free Random Graphs". In Handbook of Graphs and Networks, edited by Stefan Bornholdt and Heinz Georg Schuster, pp. 1-34. Weinheim: Wiley-VCH, 2002.
7. [Bollobás et al. 01] B. Bollobás, O. Riordan, J. Spencer and G. Tusnády. "The Degree Sequence of a Scale-Free Random Graph Process". Random Structures and Algorithms 18 (2001), 279-290.
8. [Buckley and Osthus to appear] P. G. Buckley and D. Osthus. "Popularity Based Random Graph Models Leading to a Scale-Free Degree Sequence". Preprint available from World Wide Web (http://www.informatik.hu-berlin.de/~osthus/).
9. [Callaway et al. 00] D. S. Callaway, M. E. J. Newman, S. H. Strogatz, and D. J. Watts. "Network Robustness and Fragility: Percolation on Random Graphs". Phys. Rev. Lett. 85 (2000), 5468-5471.
10. [Cohen et al. 00] R. Cohen, K. Erez, D. Ben-Avraham, and S. Havlin. "Resilience of the Internet to Random Breakdowns". Phys. Rev. Lett. 85 (2000), 4626-4628.
11. [Cohen et al. 01] R. Cohen, K. Erez, D. Ben-Avraham, and S. Havlin, "Breakdown of the Internet under Intentional Attack". Phys. Rev. Lett. 86 (2001), 3682-3685.
12. [Cooper and Frieze 01] C. Cooper and A. Frieze. "On a General Model of Web Graphs". In Proceedings of ESA, Lecture Notes in Computer Science 2161, pp. 500-511. Heidelberg: Springer-Verlag, 2001.
13. [Cooper and Frieze 02] C. Cooper and A. Frieze. "Crawling on Web Graphs". STOC (2002).
14. [Dorogovtsev and Mendes 02] S. N. Dorogovtsev and J. F. F. Mendes. "Evolution of Networks". Adv. Phys. 51 (2002), 1079.
15. [Erdo{double acute}s and Rényi 59] P. Erdo{double acute}s and A. Rényi. "On Random Graphs I". Publicationes Mathematicae Debrecen 5 (1959), 290-297.
16. [Faloutsos et al. 99] M. Faloutsos, P. Faloutsos, and C. Faloutsos. "On Power-Law Relationships of the Internet Topology". Comput. Commun. Rev. 29 (1999), 251.
17. [Gilbert 59] E. N. Gilbert. "Random Graphs". Annals of Mathematical Statistics 30 (1959), 1141-1144.
18. [Kumar et al. 00] R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. "Stochastic Models for the Web Graph". FOCS (2000).
19. [Lotka 26] A. J. Lotka. "The Frequency Distribution of Scientific Productivity". J. of the Washington Acad. of Sci. 16 (1926), 317.
20. [Simon 55] H. Simon. "On a Class of Skew Distribution Functions". Biometrika 42 (1955), 425-440.
21. [Watts and Strogatz 98] D. J. Watts and S. H. Strogatz. "Collective Dynamics of 'Small-World' Networks". Nature 393 (1998), 440-442.
22. [Zipf 49] G. K. Zipf. "Human Behavior and the Principle of Least Effort". New York: Hafner, 1949.