Higher-order distributions and nongrowing complex networks without multiple connections
arXiv:0907.1293 · doi:10.1103/PhysRevE.77.046101
Abstract
We study stochastic processes that generate non-growing 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 new 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 to formulate 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.
This is an updated version of the original article published in Physical Review E. The original article can be found at http://link.aps.org/doi/10.1103/PhysRevE.77.046101
References in corpus (12)
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Evolution of networks
- Subgraphs in random networks
- Exact solutions for models of evolving networks with addition and deletion of nodes
- Clustering in complex networks. I. General formalism
- Systematic Topology Analysis and Generation Using Degree Correlations
- Scale-Free and Stable Structures in Complex {\em Ad hoc} networks
- Clustering of correlated networks
- Exact Solution for the Time Evolution of Network Rewiring Models
- Self Organized Scale-Free Networks from Merging and Regeneration
- Complex networks created by aggregation