The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Fast Monte Carlo algorithm for site or bond percolation
Open accessAbstract
We describe in detail an efficient algorithm for studying site or bond percolation on any lattice. The algorithm can measure an observable quantity in a percolation system for all values of the site or bond occupation probability from zero to one in an amount of time that scales linearly with the size of the system. We demonstrate our algorithm by using it to investigate a number of issues in percolation theory, including the position of the percolation transition for site percolation on the square lattice, the stretched exponential behavior of spanning probabilities away from the critical point, and the size of the giant component for site percolation on random graphs.
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
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
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · RePEc: Research Papers in Economics · Cited by 6,469
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316229 · Cited by 4,196
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
Self-citationBroder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810 · cited 2×
“A number of authors [18,52,53] have examined the resilience of networks to the selective removal of the vertices with highest degree.”
BackgroundNew Monte Carlo technique for studying phase transitions
Ferrenberg, A. M., & Swendsen, R. H. (1988) · Physical Review Letters · doi:10.1103/physrevlett.61.2635 · Cited by 2,673
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
Self-citation
Cited by
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
Stochastic Geometry for Wireless Networks
Haenggi, M. (2012) · Cambridge University Press eBooks · doi:10.1017/cbo9781139043816 · Cited by 2,438
Newman, M. (2018) · doi:10.1093/oso/9780198805090.001.0001 · Cited by 2,297
Self-citationThe Anatomy of the Facebook Social Graph
Ugander, J., Karrer, B., Backstrom, L., & Marlow, C. (2011) · arXiv · doi:10.48550/arxiv.1111.4503 · Cited by 819
Flexible transparent conductive materials based on silver nanowire networks: a review
Langley, D., Giusti, G., Mayousse, C., Celle, C., Bellet, D., & Simonato, J.-P. (2013) · Nanotechnology · doi:10.1088/0957-4484/24/45/452001 · Cited by 709
Explosive Percolation in Random Networks
Achlioptas, D., D'Souza, R. M., & Spencer, J. (2009) · Science · doi:10.1126/science.1167782 · Cited by 673
Electrical properties of single wall carbon nanotube reinforced polyimide composites
Ounaies, Z. (2003) · Composites Science and Technology · doi:10.1016/s0266-3538(03)00067-8 · Cited by 662
Piezoresistive Strain Sensors Made from Carbon Nanotubes Based Polymer Nanocomposites
Alamusi, Hu, N., Fukunaga, H., Atobe, S., Liu, Y., & Li, J. (2011) · Sensors · doi:10.3390/s111110691 · Cited by 633
Connectivity metrics for subsurface flow and transport
Renard, P., & Allard, D. (2013) · Advances in Water Resources · doi:10.1016/j.advwatres.2011.12.001 · Cited by 419
Percolation on complex networks: Theory and application
Li, M., Liu, R.-R., Lü, L., Hu, M.-B., Xu, S., & Zhang, Y.-C. (2021) · Physics Reports · doi:10.1016/j.physrep.2020.12.003 · Cited by 365
The electrical properties of polymer nanocomposites with carbon nanotube fillers
Hu, N., Masuda, Z., Yan, C., Yamamoto, G., Fukunaga, H., & Hashida, T. (2008) · Nanotechnology · doi:10.1088/0957-4484/19/21/215701 · Cited by 353
Metadata
- Authors
- Newman, M. E. J., & Ziff, R. M.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2001-06-27
- Volume
- 64
- Issue
- 1
- Pages
- 016706-016706
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W2022819543
- Cited by
- 536
- References
- 34
- FWCI
- 4.50
- 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.