# Loops structure of the Internet at the autonomous system level.

@article{Bianconi2005LoopsSO, title={Loops structure of the Internet at the autonomous system level.}, author={Ginestra Bianconi and Guido Caldarelli and Andrea Capocci}, journal={Physical review. E, Statistical, nonlinear, and soft matter physics}, year={2005}, volume={71 6 Pt 2}, pages={ 066116 } }

We present here a study of the clustering and loops in a graph of the 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, and 5 remain stable during the evolution. Moreover, we will bring evidence that the Internet graphs show characteristic Markovian signatures, since the structure is very well described by two-point correlations between the degrees of the vertices. This indeed proves…

## 36 Citations

Population Dynamics on Complex Food Webs

- MathematicsAdv. Complex Syst.
- 2011

In this work, "prey" and "predators" weighted overlap graphs derived from the niche model are introduced and new tests for the goodness of synthetic food web models are found and a possible direction of improvement for existing ones is indicated.

Application of triangle count in branch contingency screening

- MathematicsInternational Journal of Electrical Power & Energy Systems
- 2022

Characterizing cycle structure in complex networks

- Computer ScienceCommunications Physics
- 2021

The authors investigate the cycle organization of synthetic and real systems, and use such information to define a centrality measure that is more informative than traditional indexes to the end of understanding network dismantling, synchronization, and spreading processes.

Estimating degree–degree correlation and network cores from the connectivity of high–degree nodes in complex networks

- Computer ScienceScientific Reports
- 2020

In here, new results are presented showing how to construct network ensembles which give a good approximation to the degree–degree correlations, and hence to the projections of this correlation like the assortativity coefficient or the average neighbours degree.

Relationships between Perron–Frobenius eigenvalue and measurements of loops in networks

- Computer SciencePhysica A: Statistical Mechanics and its Applications
- 2018

Beyond the rich-club: Properties of networks related to the better connected nodes

- Computer ScienceArXiv
- 2018

In here, new results are presented showing how to construct network ensembles which give a good approximation to the degree-degree correlations, and hence to the projections of this correlation like the assortativity coefficient or the average neighbours degree.

Complex Networks: Principles, Methods and Applications

- Computer Science
- 2017

This textbook presents a detailed overview of the new theory and methods of network science, covering algorithms for graph exploration, node ranking and network generation, among the others, and allows students to experiment with network models and real-world data sets.

The role of clustering in the stucture and function of complex networks

- Computer Science
- 2016

The role played by clustering in the structure and function of complex networks is studied, and it is analytically proved that multiple percolation transitions are possible in networks that are sufficiently weakly connected.

Evolution of the Internet at the autonomous system level

- Computer Science2015 34th Chinese Control Conference (CCC)
- 2015

The evolution of Internet at the autonomous system (AS) level during the past fourteen years is studied and it is shown that the size of Internet grows linearly and the number of ASes increases by around 238.6 per month.

On the spectra of large sparse graphs with cycles

- Mathematics
- 2012

We present a general method for obtaining the spectra of large graphs with short cycles using ideas from statistical mechanics of disordered systems. This approach leads to an algorithm that…

## References

SHOWING 1-10 OF 18 REFERENCES

Evolution of networks

- Computer Science
- 2002

The recent rapid progress in the statistical physics of evolving networks is reviewed, and how growing networks self-organize into scale-free structures is discussed, and the role of the mechanism of preferential linking is investigated.

Eur. Phys. J. B

- Eur. Phys. J. B

Phys. Rev. Lett

- Phys. Rev. Lett

Europhys. Lett

- Europhys. Lett

Proceedings, ACM SIGCOMM '99 ͓Comput

- Proceedings, ACM SIGCOMM '99 ͓Comput

Phys. Rev. E

- Phys. Rev. E

Phys. Rev. Lett

- Phys. Rev. Lett

Eur. Phys. J. B

- Eur. Phys. J. B

Phys. Rev. Lett

- Phys. Rev. Lett