Degree asymptotics with rates for preferential attachment random graphs

We provide optimal rates of convergence to the asymptotic distribution of the (properly scaled) degree of a fixed vertex in two preferential attachment random graph models. Our approach is to show that these distributions are unique fixed points of certain distributional transformations which allows us to obtain rates of convergence using a new variation of Stein's method. Despite the large literature on these models, there is surprisingly little known about the limiting distributions so we also provide some properties and new representations, including an explicit expression for the densities in terms of the confluent hypergeometric function of the second kind.

[1]  Jim Pitman,et al.  Archimedes, Gauss, and Stein , 2012, 1201.4422.

[2]  Horst Alzer,et al.  Gamma function inequalities , 2008, Numerical Algorithms.

[3]  E. Peköz,et al.  New rates for exponential approximation and the theorems of Rényi and Yaglom , 2011, The Annals of Probability.

[4]  Nathan Ross,et al.  Total variation error bounds for geometric approximation , 2010 .

[5]  Ina Ruck,et al.  USA , 1969, The Lancet.

[6]  G. Letac,et al.  Additive Properties of the Dufresne Laws and Their Multivariate Extension , 1999 .

[7]  Tamás F. Móri,et al.  The Maximum Degree of the Barabási–Albert Random Tree , 2005, Combinatorics, Probability and Computing.

[8]  Samar Sen Sarma,et al.  On degree sequence , 2008, UBIQ.

[9]  A. Pakes,et al.  LENGTH‐BIASING, CHARACTERIZATIONS OF LAWS AND THE MOMENT PROBLEM , 1992 .

[10]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[11]  R. Durrett.  Probability: Theory and Examples , 1993 .

[12]  Martin Raič,et al.  Normal Approximation by Stein ’ s Method , 2003 .

[13]  Nathan Ross.  Fundamentals of Stein's method , 2011, 1109.1880.

[14]  Milton Abramowitz,et al.  Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables , 1964 .

[15]  Larry Goldstein,et al.  Size bias, sampling, the waiting time paradox, and infinite divisibility: when is the increment independent? , 2010, 1007.3910.

[16]  Conceptual Proofs of L log L Criteria , 2004, math/0404083.

[17]  Béla Bollobás,et al.  The degree sequence of a scale‐free random graph process , 2001, Random Struct. Algorithms.

[18]  Svante Janson,et al.  Moments of Gamma type and the Brownian supremum process area , 2010, 1002.4135.

[19]  G. Reinert.  Three general approaches to Stein's method , 2005 .

[20]  Erol A. Peköz,et al.  A Second Course in Probability , 2007 .

[21]  Svante Janson,et al.  Limit theorems for triangular urn schemes , 2006 .

[22]  Ágnes Backhausz,et al.  Limit distribution of degrees in random family trees , 2010, ArXiv.

[23]  R. D. Gordon.  Values of Mills' Ratio of Area to Bounding Ordinate and of the Normal Probability Integral for Large Values of the Argument , 1941 .

[24]  R. Durrett.  Random Graph Dynamics: References , 2006 .

[25]  Russell Lyons,et al.  Conceptual proofs of L log L criteria for mean behavior of branching processes , 1995 .

[26]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[27]  Mark Brown,et al.  EXPLOITING THE WAITING TIME PARADOX: APPLICATIONS OF THE SIZE-BIASING TRANSFORMATION , 2006, Probability in the Engineering and Informational Sciences.

[28]  C. Stein.  Approximate computation of expectations , 1986 .

[29]  G. Reinert,et al.  Stein's method and the zero bias transformation with application to simple random sampling , 1997, math/0510619.

[30]  L. Goldstein.  L1 bounds in normal approximation , 2007, 0710.3262.