pith. sign in

arxiv: cond-mat/0501399 · v2 · submitted 2005-01-17 · ❄️ cond-mat.dis-nn · cond-mat.stat-mech

The inhomogeneous evolution of subgraphs and cycles in complex networks

classification ❄️ cond-mat.dis-nn cond-mat.stat-mech
keywords networkssubgraphscyclescomplexdensityevolutioninhomogeneousnetwork
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.