The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Dynamical and Correlation Properties of the Internet
Open accessAbstract
The description of the Internet topology is an important open problem, recently tackled with the introduction of scale-free networks. We focus on the topological and dynamical properties of real Internet maps in a three-year time interval. We study higher order correlation functions as well as the dynamics of several quantities. We find that the Internet is characterized by non-trivial correlations among nodes and different dynamical regimes. We point out the importance of node hierarchy and aging in the Internet structure and growth. Our results provide hints towards the realistic modeling of the Internet evolution.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Epidemic Spreading in Scale-Free Networks
Pastor-Satorras, R., & Vespignani, A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3200 · Cited by 5,731
Self-citationClasses of small-world networks
Amaral, L. A. N., Scala, A., Barthélémy, M., & Stanley, H. E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.200327197 · Cited by 3,051
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/316194.316229 · Cited by 2,613
Network Robustness and Fragility: Percolation on Random Graphs
Callaway, D. S., Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5468 · Cited by 2,480
Breakdown of the Internet under Intentional Attack
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3682 · Cited by 1,455
Topology of Evolving Networks: Local Events and Universality
Albert, R., & Barabási, A.-L. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5234 · Cited by 1,308
Structure of Growing Networks with Preferential Linking
Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4633 · Cited by 1,307
Connectivity of Growing Random Networks
Krapivsky, P. L., Redner, S., & Leyvraz, F. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4629 · Cited by 1,197
Competition and multiscaling in evolving networks
Bianconi, G., & Barabási, A.-L. (2001) · Europhysics Letters (EPL) · doi:10.1209/epl/i2001-00260-6 · Cited by 1,067
Organization of growing random networks
Krapivsky, P. L., & Redner, S. (2001) · Physical Review E · doi:10.1103/physreve.63.066123 · Cited by 871
A quantitative comparison of graph-based models for Internet topology
Zegura, E. W., Calvert, K. L., & Donahoo, M. J. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.650138 · Cited by 482
On the origin of power laws in Internet topologies
Medina, A., Matta, I., & Byers, J. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/505680.505683 · Cited by 406
Scaling behaviour of developing and decaying networks
Dorogovtsev, S. N., & Mendes, J. F. F. (2000) · Europhysics Letters (EPL) · doi:10.1209/epl/i2000-00400-0 · Cited by 250
Effect of the accelerating growth of communications networks on their structure
Dorogovtsev, S. N., & Mendes, J. F. F. (2001) · Physical Review E · doi:10.1103/physreve.63.025101 · Cited by 209
The fractal properties of Internet
Caldarelli, G., Marchetti, R., & Pietronero, L. (2000) · Europhysics Letters (EPL) · doi:10.1209/epl/i2000-00450-8 · Cited by 181
Cited by
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Complex network measures of brain connectivity: Uses and interpretations
Rubinov, M., & Sporns, O. (2010) · NeuroImage · doi:10.1016/j.neuroimage.2009.10.003 · Cited by 11,522
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Network biology: understanding the cell's functional organization
Barabási, A.-L., & Oltvai, Z. N. (2004) · Nature Reviews Genetics · doi:10.1038/nrg1272 · Cited by 7,903
Metadata
- Authors
- Pastor-Satorras, R., Vázquez, A., & Vespignani, A.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2001-11
- Volume
- 87
- Issue
- 25
- Pages
- 258701-258701
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2002396510
- Cited by
- 1,466
- References
- 19
- FWCI
- 29.71
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.