Power laws in preferential attachment graphs and stein's method for the negative binomial distribution

Advances in Applied Probability

Volumn 45, Issue 3, 2013, Pages 876-893

  Ross, Nathan ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Distributional transformation; Negative binomial distribution; Power law; Preferential attachment; Random graph; Stein's method

Indexed keywords

DISTRIBUTIONAL TRANSFORMATION; NEGATIVE BINOMIAL DISTRIBUTION; POWER LAW; PREFERENTIAL ATTACHMENTS; RANDOM GRAPHS; STEIN'S METHOD;

PROBABILITY; STATISTICS;

GRAPH THEORY;

EID: 84884992604     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1377868543     Document Type: Article

References (21)

1. Adell, J. A. and Jodrá, P. (2006). Exact Kolmogorov and total variation distances between some familiar discrete distributions. J. Inequal. Appl. 2006, 64307, 8 pp.
2. Barabási, A.-L. and Albert, R. (1999). Emergence of scaling in random networks. Science 286, 509-512.
3. Barbour, A. D., Holst, L. and Janson, S. (1992). Poisson Approximation (Oxford Stud. Prob. 2). The Clarendon Press, Oxford University Press, NewYork.
4. Bollobás, B., Riordan, O., Spencer, J. and Tusnády, G. (2001). The degree sequence of a scale-free random graph process. Random Structures Algorithms 18, 279-290.
5. Brown, T. C. and Phillips, M. J. (1999). Negative binomial approximation with Stein's method. Methodology Comput. Appl. Prob. 1, 407-421.
6. Brown, T. C. and Xia, A. (2001). Stein's method and birth-death processes. Ann. Prob. 29, 1373-1403.
7. Buckley, P. G. and Osthus, D. (2004). Popularity based random graph models leading to a scale-free degree sequence. Discrete Math. 282, 53-68.
8. Chen, L. H. Y., Goldstein, L. and Shao, Q.-M. (2011). Normal Approximation by Stein's Method. Springer, Heidelberg.
9. Goldstein, L. and Reinert, G. (1997). Stein's method and the zero bias transformation with application to simple random sampling. Ann. Appl. Prob. 7, 935-952.
10. Johnson, N. L. and Kotz, S. (1977). Urn Models and Their Application. JohnWiley, NewYork.
11. Jordan, J. (2006). The degree sequences and spectra of scale-free random graphs. Random Structures Algorithms 29, 226-242.
12. Klar, B. (2000). Bounds on tail probabilities of discrete distributions. Prob. Eng. Inf. Sci. 14, 161-171.
13. Móri, T. F. (2005). The maximum degree of the Barabási- Albert random tree. Combinatorics Prob. Comput. 14, 339-348.
14. Peköz, E. A. (1996). Stein's method for geometric approximation. J. Appl. Prob. 33, 707-713.
15. Peköz, E. A. and Röllin, A. (2011). New rates for exponential approximation and the theorems of Rényi and Yaglom. Ann. Prob. 39, 587-608.
16. Peköz, E. A., Röllin, A. and Ross, N. (2013). Total variation error bounds for geometric approximation. Bernoulli 19, 610-632.
17. Peköz, E. A., Röllin, A. and Ross, N. (2013). Degree asymptotics with rates for preferential attachment random graphs. Ann. Appl. Prob. 23, 1188-1218.
18. Pitman, J. and Ross, N. (2012). Archimedes, Gauss, and Stein. Notices AMS 59, 1416-1421.
19. Ross, N. (2011). Fundamentals of Stein's method. Prob. Surveys 8, 210-293.
20. Rudas, A., Tóth, B. and Valkó, B. (2007). Random trees and general branching processes. Random Structures Algorithms 31, 186-202.
21. Van Der Hofstad, R. (2012). Random graphs and complex networks. Lecture Notes, Eindhoven University of Technology. Available at http://www.win.tue.nl/ ~rhofstad/NotesRGCN.pdf.