The inhomogeneous evolution of subgraphs and cycles in complex networks
Disordered Systems and Neural Networks
2009-11-11 v2 Statistical Mechanics
Abstract
Subgraphs and cycles are often used to characterize the local properties of complex networks. Here we show that the subgraph structure of real networks is highly time dependent: as the network grows, the density of some subgraphs remains unchanged, while the density of others increase at a rate that is determined by the network's degree distribution and clustering properties. This inhomogeneous evolution process, supported by direct measurements on several real networks, leads to systematic shifts in the overall subgraph spectrum and to an inevitable overrepresentation of some subgraphs and cycles.
Cite
@article{arxiv.cond-mat/0501399,
title = {The inhomogeneous evolution of subgraphs and cycles in complex networks},
author = {Alexei Vazquez and Joao G. Oliveira and Albert-Laszlo Barabasi},
journal= {arXiv preprint arXiv:cond-mat/0501399},
year = {2009}
}
Comments
4 pages, 4 figures, submitted to Phys. Rev. E