Random networks with sublinear preferential attachment: Degree evolutions

Electronic Journal of Probability

Volumn 14, Issue , 2009, Pages 1222-1267

  Dereich, Steffen ^a   Mörters, Peter ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b University of Bath   (United Kingdom)

Author keywords

Barab si Albert model; Degree distribution; Dynamic random graphs; Large deviation principle; Maximal degree; Moderate deviation principle; Sublinear preferential attachment

Indexed keywords

EID: 67651227045     PISSN: None     EISSN: 10836489     Source Type: Journal    
DOI: 10.1214/EJP.v14-647     Document Type: Article

References (14)

1. Barabasi, A.-L. and R. Albert (1999). Emergence of scaling in random networks. Science 286(5439), 509-512.
2. Bingham, N. H., C. M. Goldie, and J. L. Teugels (1987). Regular variation, Volume 27 of Encyclopedia of Mathematics and its Applications. Cambridge: Cambridge University Press.
3. Bollobas, B., O. Riordan, J. Spencer, and G. Tusnady (2001). The degree sequence of a scale-free random graph process. Random Structures Algorithms 18, 279-290.
4. Chernoff, H. (1981). A note on an inequality involving the normal distribution. Ann. Probab. 9(3), 533-535.
5. Chung, F. and L. Lu (2006). Complex graphs and networks, Volume 107 of CBMS Regional Conference Series in Mathematics. Published for the Conference Board of the Mathematical Sciences, Washington, DC.
6. Dembo, A. and O. Zeitouni (1998). Large deviations techniques and applications (Second ed.), Volume 38 of Applications of Mathematics. New York: Springer-Verlag.
7. Hofstad, R. v. d. (2009). Random graphs and complex networks. Eindhoven. Lecture Notes.
8. Jacod, J. and A. N. Shiryaev (2003). Limit theorems for stochastic processes (Second ed.), Volume 288 of Grundlehren der Mathematischen Wissenschaften. Berlin: Springer-Verlag.
9. Krapivsky, I and S. Redner (2001). Organization of growing random networks. Phys. Rev. E 63, Paper 066123.
10. Mori, T. F. (2002). On random trees. Studia Sci. Math. Hungar. 39, 143-155.
11. Mori, T. F. (2005). The maximum degree of the Barabasi-Albert random tree. Combin. Probab. Comput. 14, 339-348.
12. Oliveira, R. and J. Spencer (2005). Connectivity transitions in networks with super-linear preferential attachment. Internet Math. 2, 121-163.
13. Rudas, A., B. Toth, and B. Valko (2007). Random trees and general branching processes. Random Structures and Algorithms 31, 186-202.
14. Williams, D. (1991). Probability with martingales. Cambridge Mathematical Textbooks. Cambridge: Cambridge University Press