Asymptotic behavior and distributional limits of preferential attachment graphs

Eggenberger, F.F. andPolya, G.G. (1923). Uber die statistik verketteter vorgange. Zeitschrift für Angewandte Mathematik und Mechanik 3 279–289

1923

Earlier work this paper cites.

Durrett, RichardR. (1996). Probability: Theory and Examples, 2nd ed. Duxbury Press, Belmont, CA

1996

Earlier work this paper cites.

Aldous, DavidD. (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

1997

Earlier work this paper cites.

Albert, R.R., Jeong, H.H. andBarabási, A.A. (1999). Diameter of the world wide web. Nature 401 130–131

1999

Earlier work this paper cites.

Barabási, Albert-LászlóA.-L. andAlbert, RékaR. (1999). Emergence of scaling in random networks. Science 286 509–512

1999

Earlier work this paper cites.

Faloutsos, MichalisM., Faloutsos, PetrosP. andFaloutsos, ChristosC. (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

1999

Earlier work this paper cites.

Benjamini, ItaiI. andSchramm, OdedO. (2001). Recurrence of distributional limits of finite planar graphs. Electron. J. Probab. 6 13 pp. (electronic)

2001

Earlier work this paper cites.

Albert, RékaR. andBarabási, Albert-LászlóA.-L. (2002). Statistical mechanics of complex networks. Rev. Modern Phys. 74 47–97

2002

Earlier work this paper cites.

Bollobás, BélaB. andRiordan, Oliver M.O. M. (2003). Mathematical results on scale-free random graphs. In Handbook of Graphs and Networks (S.S. Bornholdt andH. G.H. G. Schuster, eds.) 1–34. VCH, Weinheim

2003

Cited alongside, same era.

Bollobás, BélaB. andRiordan, OliverO. (2004). The diameter of a scale-free random graph. Combinatorica 24 5–34

2004

Cited alongside, same era.

Berger, NoamN., Borgs, ChristianC., Chayes, Jennifer T.J. T. andSaberi, AminA. (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

2005

Cited alongside, same era.

Lyons, RussellR. (2005). Asymptotic enumeration of spanning trees. Combin. Probab. Comput. 14 491–522

2005

Cited alongside, same era.

Leskovec, JureJ., Kleinberg, Jon M.J. M. andFaloutsos, ChristosC. (2007). Graph evolution: Densification and shrinking diameters. Transactions on Knowledge Discovery from Data

2007

Later among the works it cites.

Rudas, AnnaA., Tóth, BálintB. andValkó, BenedekB. (2007). Random trees and general branching processes. Random Structures Algorithms 31 186–202

2007

Later among the works it cites.

Borgs, C.C., Chayes, J. T.J. T., Lovász, L.L., Sós, V. T.V. T. andVesztergombi, K.K. (2008). Convergent sequences of dense graphs. I. Subgraph frequencies, metric properties and testing. Adv. Math. 219 1801–1851

2008

Later among the works it cites.

Leskovec, JureJ., Chakrabarti, DeepayanD., Kleinberg, JonJ., Faloutsos, ChristosC. andGhahramani, ZoubinZ. (2010). Kronecker graphs: An approach to modeling networks. J. Mach. Learn. Res. 11 985–1042

2010

Later among the works it cites.