Structure of n-clique networks embedded in a complex network
arXiv:physics/0702160 · doi:10.1016/j.physa.2007.02.042
Abstract
We propose the n-clique network as a powerful tool for understanding global structures of combined highly-interconnected subgraphs, and provide theoretical predictions for statistical properties of the n-clique networks embedded in a complex network using the degree distribution and the clustering spectrum. Furthermore, using our theoretical predictions, we find that the statistical properties are invariant between 3-clique networks and original networks for several observable real-world networks with the scale-free connectivity and the hierarchical modularity. The result implies that structural properties are identical between the 3-clique networks and the original networks.
12 pages, 5 figures
References in corpus (19)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Finding community structure in very large networks
- Power laws, Pareto distributions and Zipf's law
- Uncovering the overlapping community structure of complex networks in nature and society
- Lethality and centrality in protein networks
- Assortative mixing in networks
- Mean-field theory for scale-free random networks
- Hierarchical Organization in Complex Networks
- Identity and Search in Social Networks
- Clique percolation in random networks
- The topological relationship between the large-scale attributes and local interaction patterns of complex networks
- Subgraphs in random networks
- Topological Generalizations of network motifs
- Rate equation approach for correlations in growing network models
- Number of loops of size h in growing scale-free networks
- Preferential attachment of communities: the same principle, but a higher level
- The inhomogeneous evolution of subgraphs and cycles in complex networks
- Evolving networks by merging cliques