On the Degree Distribution of Pólya Urn Graph Processes

This paper presents a tighter bound on the degree distribution of arbitrary P\'{o}lya urn graph processes, proving that the proportion of vertices with degree $d$ obeys a power-law distribution $P(d) \propto d^{-\gamma}$ for $d \leq n^{\frac{1}{6}-\epsilon}$ for any $\epsilon > 0$, where $n$ represents the number of vertices in the network. Previous work by Bollob\'{a}s et al. formalized the well-known preferential attachment model of Barab\'{a}si and Albert, and showed that the power-law distribution held for $d \leq n^{\frac{1}{15}}$ with $\gamma = 3$. Our revised bound represents a significant improvement over existing models of degree distribution in scale-free networks, where its tightness is restricted by the Azuma-Hoeffding concentration inequality for martingales. We achieve this tighter bound through a careful analysis of the first set of vertices in the network generation process, and show that the newly acquired is at the edge of exhausting Bollob\'as model in the sense that the degree expectation breaks down for other powers.

[1]  Norman L. Johnson,et al.  Urn models and their application , 1977 .

[2]  Rick Durrett,et al.  Random Graph Dynamics (Cambridge Series in Statistical and Probabilistic Mathematics) , 2006 .

[3]  Dinghua Shi,et al.  Degree-distribution stability of scale-free networks , 2008 .

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

[5]  Béla Bollobás,et al.  The Diameter of a Scale-Free Random Graph , 2004, Comb..

[6]  Albert-László Barabási,et al.  Scale-free networks , 2008, Scholarpedia.

[7]  A. Barabasi,et al.  Scale-free characteristics of random networks: the topology of the world-wide web , 2000 .

[8]  Duncan J. Watts,et al.  The Structure and Dynamics of Networks: (Princeton Studies in Complexity) , 2006 .

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

[10]  Béla Bollobás,et al.  Coupling Scale-Free and Classical Random Graphs , 2004, Internet Math..

[11]  S. Redner,et al.  Organization of growing random networks. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Kazuoki Azuma WEIGHTED SUMS OF CERTAIN DEPENDENT RANDOM VARIABLES , 1967 .

[13]  Jerzy Szymanski Concentration of vertex degrees in a scale-free random graph process , 2005 .

[14]  Chris Arney,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World (Easley, D. and Kleinberg, J.; 2010) [Book Review] , 2013, IEEE Technology and Society Magazine.

[15]  Béla Bollobás,et al.  Linearized chord diagrams and an upper bound for vassiliev invariants , 2000 .

[16]  Tamás F. Móri,et al.  A new class of scale free random graphs , 2006 .

[17]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[18]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

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

[20]  Oliver Riordan,et al.  The Small Giant Component in Scale-Free Random Graphs , 2005, Combinatorics, Probability and Computing.

[21]  S. N. Dorogovtsev,et al.  Structure of growing networks with preferential linking. , 2000, Physical review letters.