Asymptotic behavior and distributional limits of preferential attachment graphs

Annals of Probability

Volumn 42, Issue 1, 2014, Pages 1-40

  Berger, Noam ^a   Borgs, Christian ^b   Chayes, Jennifer T ^b   Saberi, Amin ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b MICROSOFT RESEARCH   (United States)

^c Stanford University   (United States)

Author keywords

Graph limits; Preferential attachment graphs; Weak local limit

Indexed keywords

EID: 84893198202     PISSN: 00911798     EISSN: None     Source Type: Journal    
DOI: 10.1214/12-AOP755     Document Type: Article

References (22)

1. ALBERT, R. and BARABÁSI, A.-L. (2002). Statistical mechanics of complex networks. Rev. Modern Phys. 74 47-97. MR1895096
2. ALBERT, R., JEONG, H. and BARABÁSI, A. (1999). Diameter of the world wide web. Nature 401 130-131.
3. ALDOUS, D. (1998). Tree-valued Markov chains and Poisson-Galton-Watson distributions. In Microsurveys in Discrete Probability (Princeton, NJ, 1997). DIMACS Series in Discrete Mathematics and Theoretical Computer Science 41 1-20. Amer. Math. Soc., Providence, RI. MR1630406
4. BARABÁSI, A.-L. and ALBERT, R. (1999). Emergence of scaling in random networks. Science 286 509-512. MR2091634
5. BENJAMINI, I. and SCHRAMM, O. (2001). Recurrence of distributional limits of finite planar graphs. Electron. J. Probab. 6 13 pp. (electronic). MR1873300
6. BERGER, N., BORGS, C., CHAYES, J. T. and SABERI, A. (2005). On the spread of viruses on the internet. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms 301-310. ACM, New York. MR2298278
7. BOLLOBÁS, B. and RIORDAN, O. (2004). The diameter of a scale-free random graph. Combinatorica 24 5-34. MR2057681
8. BOLLOBÁS, B. and RIORDAN, O. (2011). Sparse graphs: Metrics and random models. Random Structures Algorithms 39 1-38. MR2839983
9. BOLLOBÁS, B. and RIORDAN, O. M. (2003). Mathematical results on scale-free random graphs. In Handbook of Graphs and Networks (S. Bornholdt and H. G. Schuster, eds.) 1-34. VCH, Weinheim. MR2016117
10. BORGS, C., CHAYES, J., KAHN, J. and LOVÁSZ, L. (2013). Left and right convergence of graphs with bounded degree. Random Structures Algorithms 42 1-28. MR2999210
11. BORGS, C., CHAYES, J., LOVÁSZ, L., SóS, V. T. and VESZTERGOMBI, K. (2006). Counting graph homomorphisms. In Topics in Discrete Mathematics. Algorithms and Combinatorics 26 315-371. Springer, Berlin. MR2249277
12. BORGS, C., CHAYES, J. T., LOVÁSZ, L., SÓS, V. T. and VESZTERGOMBI, K. (2008). Convergent sequences of dense graphs. I. Subgraph frequencies, metric properties and testing. Adv. Math. 219 1801-1851. MR2455626
13. BORGS, C., CHAYES, J. T., LOVÁSZ, L., SÓS, V. T. and VESZTERGOMBI, K. (2012). Convergent sequences of dense graphs II. Multiway cuts and statistical physics. Ann. of Math. (2) 176 151-219. MR2925382
14. DURRETT, R. (1996). Probability: Theory and Examples, 2nd ed. Duxbury Press, Belmont, CA. MR1609153
15. EGGENBERGER, F. and POLYA, G. (1923). Uber die statistik verketteter vorgange. Zeitschrift für Angewandte Mathematik und Mechanik 3 279-289.
16. ELEK, G. (2007). On limits of finite graphs. Combinatorica 27 503-507. MR2359831
17. FALOUTSOS, M., FALOUTSOS, P. and FALOUTSOS, C. (1999). On power-law relationships of the internet topology. In SIGCOMM'99: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication 251-262. ACM, New York.
18. LESKOVEC, J., CHAKRABARTI, D.,KLEINBERG, J., FALOUTSOS, C. and GHAHRAMANI, Z. (2010). Kronecker graphs: An approach to modeling networks. J. Mach. Learn. Res. 11 985-1042. MR2600637
19. LESKOVEC, J., KLEINBERG, J. M. and FALOUTSOS, C. (2007). Graph evolution: Densification and shrinking diameters. Transactions on Knowledge Discovery from Data 1 Article 2.
20. LOVÁSZ, L. and SZEGEDY, B. (2006). Limits of dense graph sequences. J. Combin. Theory Ser. B 96 933-957. MR2274085
21. LYONS, R. (2005). Asymptotic enumeration of spanning trees. Combin. Probab. Comput. 14 491-522. MR2160416
22. RUDAS, A., TóTH, B. and VALKó, B. (2007). Random trees and general branching processes. Random Structures Algorithms 31 186-202. MR2343718