Joint degree distributions of preferential attachment random graphs

Abstract We study the joint degree counts in linear preferential attachment random graphs and find a simple representation for the limit distribution in infinite sequence space. We show weak convergence with respect to the p-norm topology for appropriate p and also provide optimal rates of convergence of the finite-dimensional distributions. The results hold for models with any general initial seed graph and any fixed number of initial outgoing edges per vertex; we generate nontree graphs using both a lumping and a sequential rule. Convergence of the order statistics and optimal rates of convergence to the maximum of the degrees is also established.

[1]  Mark E. J. Newman,et al.  Structure and Dynamics of Networks , 2009 .

[2]  Codina Cotar,et al.  On a Preferential Attachment and Generalized Pólya's Urn Model , 2012, 1203.5758.

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

[4]  Elchanan Mossel,et al.  Coexistence in Preferential Attachment Networks , 2013, Combinatorics, Probability and Computing.

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

[6]  Charles Suquet.  Tightness in Schauder decomposable Banach spaces∗ , 2005 .

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

[8]  Elchanan Mossel,et al.  On the Influence of the Seed Graph in the Preferential Attachment Model , 2014, IEEE Transactions on Network Science and Engineering.

[9]  J. Pitman.  Combinatorial Stochastic Processes , 2006 .

[10]  Gesine Reinert,et al.  Stein's Method for the Beta Distribution and the Pólya-Eggenberger Urn , 2013, J. Appl. Probab..

[11]  Amin Saberi,et al.  Asymptotic behavior and distributional limits of preferential attachment graphs , 2014, 1401.2792.

[12]  Nathan Ross,et al.  Generalized gamma approximation with rates for urns, walks and trees , 2013, 1309.4183.

[13]  Remco van der Hofstad,et al.  Random Graphs and Complex Networks , 2016, Cambridge Series in Statistical and Probabilistic Mathematics.

[14]  Lancelot F. James.  Generalized Mittag Leffler distributions arising as limits in preferential attachment models , 2015, 1509.07150.

[15]  J. Pitman.  Brownian Motion, Bridge, Excursion, and Meander Characterized by Sampling at Independent Uniform Times , 1999 .

[16]  A survey of random processes with reinforcement , 2007, math/0610076.

[17]  Daniel Dufresne,et al.  G distributions and the beta-gamma algebra , 2010 .

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

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

[20]  E. Lieb,et al.  Analysis, Second edition , 2001 .

[21]  Nicolas Curien,et al.  Scaling limits and influence of the seed graph in preferential attachment trees , 2014, ArXiv.

[22]  David Aldous,et al.  The Continuum Random Tree III , 1991 .

[23]  S. Redner,et al.  Connectivity of growing random networks. , 2000, Physical review letters.

[24]  Bálint Tóth,et al.  Random trees and general branching processes , 2007, Random Struct. Algorithms.

[25]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[26]  Nathan Ross,et al.  Power Laws in Preferential Attachment Graphs and Stein's Method for the Negative Binomial Distribution , 2013, Advances in Applied Probability.

[27]  Marion Kee,et al.  Analysis , 2004, Machine Translation.

[28]  Nathan Ross,et al.  Degree asymptotics with rates for preferential attachment random graphs , 2011, 1108.5236.

[29]  J. Pitman.  Coalescents with multiple collisions , 1999 .

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