Coupling scale-free and classical random graphs

Internet Mathematics

Volumn 1, Issue 2, 2004, Pages 215-225

  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: 84906214576     PISSN: 15427951     EISSN: 19449488     Source Type: Journal    
DOI: 10.1080/15427951.2004.10129084     Document Type: Article

References (16)

1. [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.
2. [Albert and Barabási 02] R. Albert and A.-L. Barabási. "Statistical Mechanics of Complex Networks". Rev. Mod. Phys. 74 (2002), 47-97.
3. [Barabási and Albert 99] A.-L. Barabási and R. Albert. "Emergence of Scaling in Random Networks". Science 286 (1999), 509-512.
4. [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, Germany: Wiley-VCH, 2002.
5. [Bollobás and Riordan 03] B. Bollobás and O. Riordan. "Robustness and Vulnerability of Scale-Free Random Graphs". Internet Mathematics 1 (2003), 1-35.
6. [Bollobás and Riordan 04] B. Bollobás and O. Riordan. "The Diameter of a Scale-Free Random Graph". To appear in Combinatorica. Preprint available from http://www.dpmms.cam.ac.uk/~omr10/.
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 04] P. G. Buckley, and D. Osthus. "Popularity Based Random Graph Models Leading to a Scale-Free Degree Sequence". Preprint available from http://www.informatik.hu-berlin.de/~osthus/. To appear in Discrete Mathematics. [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.
9. [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.
10. [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.
11. [Drinea et al. 01] E. Drinea, M. Enachescu, andM. Mitzenmacher. "Variations on Random Graph Models for the Web". Technical Report, Harvard University, Department of Computer Science, 2001.
12. [Dorogovtsev et al. 00] S. N. Dorogovtsev, J. F. F. Mendes, and A. N. Samukhin. "Structure of Growing Networks with Preferential Linking". Phys. Rev. Lett. 85 (2000), 4633.
13. [Dorogovtsev and Mendes 02] S. N. Dorogovtsev and J. F. F. Mendes. "Evolution of Networks". Adv. Phys. 51 (2002), 1079.
14. [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.
15. [Frieze 90] A. Frieze. "On the Independence Number of Random Graphs". Discrete Math. 81 (1990), 171-175.
16. [Gilbert 59] E. N. Gilbert. "Random Graphs". Annals of Mathematical Statistics 30 (1959), 1141-1144.