Nongrowing Preferential Attachment Random Graphs

Abstract We consider an edge rewiring process that is widely used to model the dynamics of scale-free weblike networks. This process uses preferential attachment and operates on sparse multigraphs with n vertices and m edges. We prove that its mixing time is optimal and develop a framework that simplifies the calculation of graph properties in the steady state. The applicability of this framework is demonstrated by calculating the degree distribution, the number of self-loops, and the threshold for the appearance of the giant component.

[1]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[2]  D. Aldous.  Random walks on finite groups and rapidly mixing markov chains , 1983 .

[3]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[4]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[5]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[6]  Elizabeth L. Wilmer,et al.  Markov Chains and Mixing Times , 2008 .

[7]  Bruce A. Reed,et al.  The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.

[8]  M. Luczak.  Concentration of measure and mixing for Markov chains , 2008, 0809.4856.

[9]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[10]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

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

[12]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

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

[14]  Dudley,et al.  Real Analysis and Probability: Measurability: Borel Isomorphism and Analytic Sets , 2002 .

[15]  Y. Lai,et al.  Self-organized scale-free networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Narsingh Deo,et al.  Techniques for analyzing dynamic random graph models of web‐like networks: An overview , 2008, Networks.

[17]  Tomas Hruz,et al.  Higher-order distributions and nongrowing complex networks without multiple connections. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Martin E. Dyer,et al.  An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract) , 2000, SODA '00.

[19]  Vijaya Ramachandran,et al.  The diameter of sparse random graphs , 2007, Random Struct. Algorithms.

[20]  T S Evans,et al.  Exact solution for the time evolution of network rewiring models. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Michael Mitzenmacher,et al.  Editorial: The Future of Power Law Research , 2005, Internet Math..