Growth of preferential attachment random graphs via continuous-time branching processes
Tóm tắt
Từ khóa
Tài liệu tham khảo
Albert R and Barabasi A-L, Statistical mechanics of complex networks, Rev. Mod. Phys. 74 (2002) 47–97
Asmussen S and Hering H, Branching Processes, Progress in Probability and Statistics, 3 (Boston: Birkhäuser) (1983)
Athreya K B, On the equivalence of conditions on a branching process in continuous time and on its offspring distribution, J. Math. Kyoto Univ. 9 (1969) 41–53
Athreya K B and Karlin S, Limit theorems for the split times of branching processes, J. Math. Mech. 17 (1967) 257–277
Athreya K B and Ney P, Branching Processes (New York: Dover) (2004)
Athreya K B and Lahiri S N, Measure Theory and Probability Theory (New York: Springer) (2006)
Bollobas B, Riordan O, Spencer J and Tusnady G, The degree sequence of a scale-free random graph process, Random Structures and Algorithms 18 (2001) 279–290
Chung F and Lu L, Complex Graphs and Networks, CMBS, 107, American Mathematical Society, Providence (2006)
Cooper C and Frieze A, A general model of web graphs, Random Structures and Algorithms 22 (2003) 311–335
Mitzenmacher M, A brief history of generative models for power law and lognormal distributions, Internet Math. 1 (2006) 226–251
Mori T, On random trees, Studia Sci. Math. Hungar. 39 (2002) 143–155
Mori T, The maximum degree of the Barabasi-Albert random tree, Comb. Probab. Computing 14 (2005) 339–348
Oliveira R and Spencer J, Connectivity transitions in networks with super-linear preferential attachment, Internet Math. 2 (2006) 121–163
Rudas A, Toth B and Valko B, Random trees and general branching processes, Random Structures and Algorithms 31 (2007) 186–202
Yule G, A mathematical theory of evolution based on the conclusions of Dr J.C. Willis, Phil. Trans. Roy. Soc. London B213 (1925) 21–87