Loops structure of the Internet at the Autonomous System Level
arXiv:cond-mat/0408349 · doi:10.1103/PhysRevE.71.066116
Abstract
We present here a study of the clustering and cycles in the graph of Internet at the Autonomous Systems level. We show that,even if the whole structure is changing with time, the statistical distributions of loops of order 3,4,5 remain stable during the evolution. Moreover we will bring evidence that the Internet graphs show characteristic Markovian signatures, since the loops structure is very well described by the two point correlations between the connectivities of the nodes. This represent another essential characteristic of this evolving graph. To capture this feature of the Internet represent one of the challenges in the future Internet modeling.
(4 pages, 3 figures)
Cited by in corpus (21)
- Characterization of complex networks: A survey of measurements
- Preferential attachment in the growth of social networks: the case of Wikipedia
- Cycles and clustering in bipartite networks
- Random graphs containing arbitrary distributions of subgraphs
- The weighted random graph model
- Networking - A Statistical Physics Perspective
- On the number of circuits in random graphs
- Spectra of sparse regular graphs with loops
- Clustering of random scale-free networks
- Scale-free networks as preasymptotic regimes of superlinear preferential attachment
- Effect of degree correlations on the loop structure of scale-free networks
- Schroedinger-like PageRank equation and localization in the WWW
- Statistics of cycles in large networks
- Finding long cycles in graphs
- Percolation and Loop Statistics in Complex Networks
- Modeling the Internet
- Evolution of the Internet AS-Level Ecosystem
- Mixing properties of growing networks and the Simpson's paradox
- Hierarchical Spatial Organization of Geographical Networks
- Characterizing cycle structure in complex networks
- Population Dynamics on Complex Food Webs