Generation of arbitrarily two-point-correlated random networks.

Random networks are intensively used as null models to investigate properties of complex networks. We describe an efficient and accurate algorithm to generate arbitrarily two-point degree-degree correlated undirected random networks without self-edges or multiple edges among vertices. With the goal to systematically investigate the influence of two-point correlations, we furthermore develop a formalism to construct a joint degree distribution P(j,k) , which allows one to fix an arbitrary degree distribution P(k) and an arbitrary average nearest neighbor function k_{nn}(k) simultaneously. Using the presented algorithm, this formalism is demonstrated with scale-free networks [P(k) proportional, variantk;{-gamma}] and empirical complex networks [ P(k) taken from network] as examples. Finally, we generalize our algorithm to annealed networks which allows networks to be represented in a mean-field-like manner.

[1]  R. Pastor-Satorras,et al.  Class of correlated random networks with hidden variables. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Markus Porto,et al.  Multicomponent reaction-diffusion processes on complex networks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  R. Pastor-Satorras,et al.  Generation of uncorrelated random scale-free networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

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

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

[7]  B. Derrida,et al.  Random networks of automata: a simple annealed approximation , 1986 .

[8]  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.

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

[10]  M E J Newman.  Assortative mixing in networks. , 2002, Physical review letters.

[11]  Marián Boguñá,et al.  Tuning clustering in random networks with arbitrary degree distributions. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  G. Parisi,et al.  Closing probabilities in the Kauffman model: an annealed computation , 1995, cond-mat/9510137.

[13]  Muhammad Sahimi,et al.  Diffusion in scale-free networks with annealed disorder. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[15]  Edward A. Bender,et al.  The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.

[16]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[17]  Z. Burda,et al.  Statistical ensemble of scale-free random graphs. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  M. Newman.  Properties of highly clustered networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Alexei Vazquez,et al.  Computational complexity arising from degree correlations in networks , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  B. Kahng,et al.  Intrinsic degree-correlations in the static model of scale-free networks , 2006 .

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

[22]  Sergey N. Dorogovtsev,et al.  Organization of complex networks without multiple connections , 2005, Physical review letters.

[23]  Shlomo Havlin,et al.  Origins of fractality in the growth of complex networks , 2005, cond-mat/0507216.

[24]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[25]  R. Pastor-Satorras,et al.  Diffusion-annihilation processes in complex networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  S. N. Dorogovtsev,et al.  Metric structure of random networks , 2002, cond-mat/0210085.

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

[28]  Sergey N. Dorogovtsev,et al.  Ising Model on Networks with an Arbitrary Distribution of Connections , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[30]  Alessandro Vespignani,et al.  Cut-offs and finite size effects in scale-free networks , 2003, cond-mat/0311650.

[31]  M. Newman,et al.  Mixing patterns in networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.