Homogeneous complex networks
arXiv:cond-mat/0502124 · doi:10.1016/j.physa.2005.10.024
Abstract
We discuss various ensembles of homogeneous complex networks and a Monte-Carlo method of generating graphs from these ensembles. The method is quite general and can be applied to simulate micro-canonical, canonical or grand-canonical ensembles for systems with various statistical weights. It can be used to construct homogeneous networks with desired properties, or to construct a non-trivial scoring function for problems of advanced motif searching.
19 pages, 9 figures
References in corpus (6)
Cited by in corpus (21)
- Entropy measures for complex networks: Toward an information theory of complex topologies
- The entropy of network ensembles
- The entropy of randomized network ensembles
- Percolation transition in networks with degree-degree correlation
- Correlations in connected random graphs
- The Grand Canonical ensemble of weighted networks
- Ising model in clustered scale-free networks
- Link and subgraph likelihoods in random undirected networks with fixed and partially fixed degree sequence
- Analysis of the convergence of the degree distribution of contracting random networks towards a Poisson distribution using the relative entropy
- Convergence towards an Erd{\H o}s-Rényi graph structure in network contraction processes
- Antiferromagnetic Ising model in scale-free networks
- Power laws in zero-range processes on random networks
- A geometric entropy detecting the Erdös-Rényi phase transition
- Riemannian-geometric entropy for measuring network complexity
- Discovering universal statistical laws of complex networks
- Approaching the thermodynamic limit in equilibrated scale-free networks
- Ranking nodes according to their path-complexity
- Complex Networks in the Framework of Nonassociative Geometry
- Tsallis mapping in growing complex networks with fitness
- Nodal statistics-based equivalence relation for graph collections
- Catching homologies by geometric entropy