Evolving complex networks with conserved clique distributions
Physics and Society
2009-11-13 v1 Disordered Systems and Neural Networks
Networking and Internet Architecture
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.
Cite
@article{arxiv.0806.2937,
title = {Evolving complex networks with conserved clique distributions},
author = {Gregor Kaczor and Claudius Gros},
journal= {arXiv preprint arXiv:0806.2937},
year = {2009}
}
Comments
Physical Review E, in press