Sparse random graphs with clustering

Random Structures and Algorithms

Volumn 38, Issue 3, 2011, Pages 269-323

  Bollobás, Béla ^a,b   Janson, Svante ^c   Riordan, Oliver ^d  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b University of Memphis   (United States)

^c UPPSALA UNIVERSITY   (Sweden)

^d UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Clustering; Phase transition; Random graphs

Indexed keywords

EID: 79953013757     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20322     Document Type: Article

References (37)

1. R. Albert, A.-L. Barabási, Statistical mechanics of complex networks, Rev Mod Phys 74 (2002), 47-97.
2. R. Albert, H. Jeong, A.-L. Barabási, Error and attack tolerance of complex networks, Nature 406 (2000), 378-382.
3. D. Aldous, R. Lyons, Processes on unimodular random networks, Electron J Probab 12 (2007), 1454-1508.
4. D. Aldous, J. M. Steele, The objective method: probabilistic combinatorial optimization and local weak convergence, In Probability on discrete structures, Encyclopaedia Mathematical Science, Vol. 110, Springer, 2004, pp. 1-72.
5. A.-L. Barabási, R. Albert, Emergence of scaling in random networks, Science 286 (1999), 509-512.
6. A. D. Barbour, L. Holst, S. Janson, Poisson approximation, Oxford University Press, Oxford, UK, 1992.
7. I. Benjamini, O. Schramm, Recurrence of distributional limits of finite planar graphs, Electron J Probab 6 (2001), no. 23, 13 pp (electronic).
8. B. Bollobás, Modern graph theory, Springer-Verlag, New York, 1998, pp. xiv+394.
9. B. Bollobás, C. Borgs, J. Chayes, O. Riordan, Percolation on dense graph sequences, Ann Probab 38 (2010), 150-183.
10. B. Bollobás, S. Janson, O. Riordan, The phase transition in inhomogeneous random graphs, Random Struct Algorithms 31 (2007), 3-122.
11. d, Random Struct Algorithms 31 (2007), 239-246.
12. B. Bollobás, S. Janson, O. Riordan, The cut metric, branching processes and random graphs, arXiv:0901.2091.
13. B. Bollobás, O. Riordan, Mathematical results on scale-free random graphs, In Handbook of Graphs and Networks, S. Bornholdt, H. G. Schuster (Editors), Wiley-VCH, Weinheim, 2002, pp. 1-34.
14. B. Bollobás, O. Riordan, Robustness and vulnerability of scale-free random graphs, Internet Math 1 (2003), 1-35.
15. B. Bollobás, O. Riordan, The diameter of a scale-free random graph, Combinatorica 24 (2004), 5-34.
16. B. Bollobás, O. Riordan, "Metrics for sparse graphs, "In Surveys in Combinatorics (2009), London Math Soc Lecture Note Ser 365, S. Huczynska, J. D. Mitchell, C. M. Roney-Dougal (Editors), Cambridge University Press, Cambridge, 2009, pp. 212-287.
17. B. Bollobás, O. Riordan, Sparse graphs: Metrics and random models, Random Struct Algorithms, arXiv:0812.2656.
18. C. Borgs, J. T. Chayes, L. Lovász, V. T. Sós, K. Vesztergombi, Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing, Adv Math 219 (2008), 1801-1851.
19. C. Borgs, T. J. Chayes, L. Lovász, V. T. Sós, K. Vesztergombi, Convergent sequences of dense graphs II: Multiway cuts and statistical physics, Preprint (2007).
20. D. S. Callaway, J. E. Hopcroft, J. M. Kleinberg, M. E. J. Newman, S. H. Strogatz, Are randomly grown graphs really random? Phys Rev E 64 (2001), 041902.
21. D. S. Callaway, M. E. J. Newman, S. H. Strogatz, D. J. Watts, Network robustness and fragility: Percolation on random graphs, Phys Rev Lett 85 (2000), 5468-5471.
22. R. Cohen, K. Erez, D. ben-Avraham, S. Havlin, Resilience of the Internet to random breakdowns, Phys Rev Lett 85 (2000), 4626-4628.
23. C. Cooper, A. Frieze, A general model of web graphs, Random Struct Algorithms 22 (2003), 311-335.
24. P. Diaconis, S. Janson, Graph limits and exchangeable random graphs, Rendiconti di Matematica 28 (2008), 33-61.
25. S. N. Dorogovtsev, J. F. F. Mendes, Evolution of networks, Adv Phys 51 (2002), 1079.
26. P. Erd&0151;s, A. Rényi, On the evolution of random graphs, Magyar Tud Akad Mat Kutató Int Közl 5 (1960), 17-61.
27. M. Faloutsos, P. Faloutsos, C. Faloutsos, On power-law relationships of the internet topology, SIGCOMM 1999, Comput Commun Rev 29 (1999), 251.
28. A. Frieze, R. Kannan, Quick approximation to matrices and applications, Combinatorica 19 (1999), 175-220.
29. S. Janson, Standard representation of multivariate functions on a general probability space, Electron Comm Probab 14 (2009), 343-346.
30. S. Janson, Asymptotic equivalence and contiguity of some random graphs, Random Struct Algorithms 36 (2010), 26-45.
31. S. Janson, T. Łuczak, A. Ruciński, Random graphs, Wiley, New York, 2000.
32. P. L. Krapivsky, S. Redner, Organization of growing random networks, Phys Rev E 66 (2001), 066123.
33. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, E. Upfal, Stochastic models for the web graph, FOCS, Proceedings of the 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, 2000.
34. L. Lovász, B. Szegedy, Limits of dense graph sequences, J Combin Theory B 96 (2006), 933-957.
35. M. E. J. Newman, Assortative mixing in networks, Phys Rev Lett 89 (2002), 208701.
36. O. Riordan, The small giant component in scale-free random graphs, Comb Probab Comput 14 (2005), 897-938.
37. D. J. Watts, S. H. Strogatz, Collective dynamics of 'small-world' networks, Nature 393 (1998), 440-442.