Large-scale topological and dynamical properties of the Internet.
By A. Vázquez, Romualdo Pastor-Satorras, Alessandro Vespignani. Physical review. E, Statistical, nonlinear, and soft matter physics, 2001
651 citations recorded by the source corpus.
We study the large-scale topological and dynamical properties of real Internet maps at the autonomous system level, collected in a 3-yr time interval. We find that the connectivity structure of the Internet presents statistical distributions settled in a well-defined stationary state. The large-scale properties are characterized by a scale-free topology consistent with previous observations. Correlation functions and clustering coefficients exhibit a remarkable structure due to the underlying hierarchical organization of the Internet. The study of the Internet time evolution shows a growth dynamics with aging features typical of recently proposed growing network models. We compare the properties of growing network models with the present real Internet data analysis.
Subfields: Computer Networks and Communications, Statistical and Nonlinear Physics
View Paper: https://www.semanticscholar.org/paper/b3a90b83aa61ee8871a59a107749aba97af92d61
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Cecilia Mascolo
- Mirco Musolesi
- Marc Barthelemy
- Mark Newman
- Duncan J. Watts
- Francisco Aparecido Rodrigues
- Matjaz Perc
- Tao Zhou
In Statistical and Nonlinear Physics
- Sophie Ahrens
- Jure Leskovec
- Mark Newman
- Linyuan Lu
- Tao Zhou
- Marc Barthelemy
- Francisco Aparecido Rodrigues
- Matjaz Perc
Citations in the corpus
- Link Prediction in Complex Networks: A Survey (2010, background): “The stochastic blockmodel can capture the community structure [22], role-to-role connections [94,95] and maybe other factors for the establishing of connections, especially when the group membership plays a considerable role in determining how nodes interact with each other, which usually could not ”
- Recommender Systems (2012, background): “This degree-degree correlation can be characterized by the average degree of the nearest neighbors [62, 63] or a variant of Pearson coefficient called assortativity coefficient [64, 65].”
- Systematic topology analysis and generation using degree correlations (2006, background): “In our experience, we find that dK-randomizing rewiring is easiest to use.”
- Analysis of the airport network of India as a complex weighted network (2004, background): “Many real networks have been found [14,15,18] to have such nontrivial decay.”
- Statistical physics of vaccination (2016, background): “Betweenness-betweenness correlations and betweenness-degree correlations have been studied respectively in [186] and in [187].”