The inhomogeneous evolution of subgraphs and cycles in complex networks
arXiv:cond-mat/0501399 · doi:10.1103/PhysRevE.71.025103
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.
arXiv comment4 pages, 4 figures, submitted to Phys. Rev. E
References in corpus (8)
- Statistical mechanics of complex networks
- Evolution of the social network of scientific collaborations
- Dynamical and correlation properties of the Internet
- Large-scale topological and dynamical properties of Internet
- Pseudofractal Scale-free Web
- The topological relationship between the large-scale attributes and local interaction patterns of complex networks
- Number of loops of size h in growing scale-free networks
- The role of clustering and gridlike ordering in epidemic spreading
Cited by in corpus (9)
- Cycles and clustering in bipartite networks
- Communicability Betweenness in Complex Networks
- New approaches to model and study social networks
- Structure of n-clique networks embedded in a complex network
- Statistics of cycles in large networks
- Accelerating networks
- Random graph model with power-law distributed triangle subgraphs
- Characterizing cycle structure in complex networks
- Detecting highly cyclic structure with complex eigenpairs