Higher-order distributions and nongrowing complex networks without multiple connections.

We study stochastic processes that generate nongrowing complex networks without self-loops and multiple edges (simple graphs). The work concentrates on understanding and formulation of constraints which keep the rewiring stochastic processes within the class of simple graphs. To formulate these constraints a different concept of wedge distribution (paths of length 2) is introduced and its relation to degree-degree correlation is studied. The analysis shows that the constraints, together with edge selection rules, do not even allow the formulation of a closed master equation in the general case. We also introduce a particular stochastic process which does not contain edge selection rules, but which, we believe, can provide some insight into the complexities of simple graphs.

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

[2]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[3]  Marián Boguñá,et al.  Clustering in complex networks. II. Percolation properties. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

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

[7]  B. Bollobás.  The evolution of random graphs , 1984 .

[8]  Petter Minnhagen,et al.  Self organized scale-free networks from merging and regeneration , 2005 .

[9]  Marián Boguñá,et al.  Clustering in complex networks. I. General formalism. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[11]  Gourab Ghoshal,et al.  Exact solutions for models of evolving networks with addition and deletion of nodes. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  S. N. Dorogovtsev,et al.  Complex networks created by aggregation. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  V. Roychowdhury,et al.  Scale-free and stable structures in complex ad hoc networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  R. Milo,et al.  Subgraphs in random networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[16]  Jun Ohkubo,et al.  Complex Networks by Non-growing Model with Preferential Rewiring Process , 2005 .

[17]  S. N. Dorogovtsev.  Clustering of correlated networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Priya Mahadevan,et al.  Systematic topology analysis and generation using degree correlations , 2006, SIGCOMM 2006.

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

[20]  S. Shen-Orr,et al.  Networks Network Motifs : Simple Building Blocks of Complex , 2002 .