The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Percolation critical exponents in scale-free networks
Open accessAbstract
We study the behavior of scale-free networks, having connectivity distribution P(k) approximately k(-lambda), close to the percolation threshold. We show that for networks with 3 4.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
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
Introduction to Percolation Theory
Stauffer, D., Aharony, A., & Redner, S. (1993) · Physics Today · doi:10.1063/1.2808877 · Cited by 6,666
Random graphs with arbitrary degree distributions and their applications
Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2001) · Physical Review E · doi:10.1103/physreve.64.026118 · Cited by 3,648
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
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
Resilience of the Internet to Random Breakdowns
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4626 · Cited by 2,391
Self-citationA critical point for random graphs with a given degree sequence
Molloy, M., & Reed, B. (1995) · Random Structures & Algorithms · doi:10.1002/rsa.3240060204 · Cited by 2,351
An Introduction To Percolation Theory
Hughes, B. D. (1996) · Random Walks and Random Environments · doi:10.1093/oso/9780198537892.003.0002 · Cited by 1,731
Epidemic dynamics and endemic states in complex networks
Pastor-Satorras, R., & Vespignani, A. (2001) · Physical Review E · doi:10.1103/physreve.63.066117 · Cited by 1,682
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
Self-citationDiffusion and Reactions in Fractals and Disordered Systems
ben-Avraham, D., & Havlin, S. (2000) · Cambridge University Press eBooks · doi:10.1017/cbo9780511605826 · Cited by 1,369
Self-citationAspects and Applications of the Random Walk.
PE, & Weiss, G. H. (1995) · Journal of the American Statistical Association · doi:10.2307/2291190 · Cited by 863
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
MOLLOY, M., & REED, B. (1998) · Combinatorics, Probability and Computing · doi:10.1017/s0963548398003526 · Cited by 831
Are randomly grown graphs really random?
Callaway, D. S., Hopcroft, J. E., Kleinberg, J. M., Newman, M. E. J., & Strogatz, S. H. (2001) · Physical Review E · doi:10.1103/physreve.64.041902 · Cited by 448
Statistical ensemble of scale-free random graphs
Burda, Z., Correia, J. D., & Krzywicki, A. (2001) · Physical Review E · doi:10.1103/physreve.64.046118 · Cited by 175
Anomalous percolation properties of growing networks
Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2001) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.64.066110 · Cited by 153
Cited by
Catastrophic cascade of failures in interdependent networks
Buldyrev, S. V., Parshani, R., Paul, G., Stanley, H. E., & Havlin, S. (2010) · Nature · doi:10.1038/nature08932 · Cited by 4,513
Self-citationEpidemic processes in complex networks
Pastor-Satorras, R., Castellano, C., Van Mieghem, P., & Vespignani, A. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.925 · Cited by 3,697
The structure and dynamics of multilayer networks
Boccaletti, S., Bianconi, G., Criado, R., del Genio, C. I., Gómez-Gardeñes, J., Romance, M., Sendiña-Nadal, I., Wang, Z., & Zanin, M. (2014) · Physics Reports · doi:10.1016/j.physrep.2014.07.001 · Cited by 3,125
Critical phenomena in complex networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1275 · Cited by 2,220
k-Core Organization of Complex Networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.040601 · Cited by 709
Metadata
- Authors
- Cohen, R., ben-Avraham, D., & Havlin, S.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2002-09-17
- Volume
- 66
- Issue
- 3
- Pages
- 036113-036113
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W2123820136
- Cited by
- 312
- References
- 17
- FWCI
- 6.48
- Type
- journal article
- Language
- en
- Open access
- green
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.