Evolving complex networks with conserved clique distributions
arXiv:0806.2937 · doi:10.1103/PhysRevE.78.016107
Abstract
We propose and study a hierarchical algorithm to generate graphs having a predetermined distribution of cliques, the fully connected subgraphs. The construction mechanism may be either random or incorporate preferential attachment. We evaluate the statistical properties of the graphs generated, such as the degree distribution and network diameters, and compare them to some real-world graphs.
Physical Review E, in press
References in corpus (10)
- Statistical mechanics of complex networks
- Uncovering the overlapping community structure of complex networks in nature and society
- The diameter of the world wide web
- Random graphs with arbitrary degree distributions and their applications
- Evolution of networks
- k-core organization of complex networks
- Clique percolation in random networks
- The topological relationship between the large-scale attributes and local interaction patterns of complex networks
- Emergence of large cliques in random scale-free network
- Complex and Adaptive Dynamical Systems: A Primer