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
New 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-citationResilience 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
The Art of Computer Programming
Worlton, W. J. (1968) · Nuclear Science and Engineering · doi:10.13182/nse68-a19548 · Cited by 2,251
Data Structures and Network Algorithms
Tarjan, R. E. (1983) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970265 · Cited by 2,057
Hoshen, J., & Kopelman, R. (1976) · Physical Review B · doi:10.1103/physrevb.14.3438 · Cited by 1,928
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
Efficiency of a Good But Not Linear Set Union Algorithm
Tarjan, R. E. (1975) · Journal of the ACM · doi:10.1145/321879.321884 · Cited by 1,403
Scaling and percolation in the small-world network model
Newman, M. E. J., & Watts, D. J. (1999) · Physical Review E · doi:10.1103/physreve.60.7332 · Cited by 1,202
Self-citationCritical Thresholds in Species' Responses to Landscape Structure
With, K. A., & Crist, T. O. (1995) · Ecology · doi:10.2307/2265819 · Cited by 759
Efficient Monte Carlo Algorithm and High-Precision Results for Percolation
Newman, M. E. J., & Ziff, R. M. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4104 · Cited by 503
Self-citationLarge-cell Monte Carlo renormalization group for percolation
Reynolds, P., Stanley, H., & Klein, W. (1980) · Physical Review B · doi:10.1103/physrevb.21.1223 · Cited by 456
An improved equivalence algorithm
Galler, B. A., & Fischer, M. J. (1964) · Communications of the ACM · doi:10.1145/364099.364331 · Cited by 312
Percolation theory of two phase flow in porous media
Larson, R. G., Scriven, L. E., & Davis, H. T. (1981) · Chemical Engineering Science · doi:10.1016/0009-2509(81)80048-6 · Cited by 289
Spanning probability in 2D percolation
Ziff, R. M. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.2670 · Cited by 261
Self-citationSolomon, S., Weisbuch, G., de Arcangelis, L., Jan, N., & Stauffer, D. (2000) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(99)00543-9 · Cited by 234
Exact solution of site and bond percolation on small-world networks
Moore, C., & Newman, M. E. J. (2000) · Physical Review E · doi:10.1103/physreve.62.7059 · Cited by 183
Self-citationPercolation by position-space renormalisation group with large cells
Reynolds, P. J., Stanley, H. E., & Klein, W. (1978) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/11/8/006 · Cited by 169
Sedgewick, R. (1988) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 128
Bentz, D. P., & Garboczi, E. J. (1992) · Materials and Structures · doi:10.1007/bf02472448 · Cited by 123
Statistical errors in histogram reweighting
Ferrenberg, A. M., Landau, D. P., & Swendsen, R. H. (1995) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.51.5092 · Cited by 87
Histogram Monte Carlo renormalization-group method for percolation problems
Hu, C. (1992) · Physical review. B, Condensed matter · doi:10.1103/physrevb.46.6592 · Cited by 62
Anomalous approach to the self-organized critical state in a model for ‘‘life at the edge of chaos’’
Ray, T. S., & Jan, N. (1994) · Physical Review Letters · doi:10.1103/physrevlett.72.4045 · Cited by 59
Largest cluster in subcritical percolation
Bazant, M. Z. (2000) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.62.1660 · Cited by 56
The relation between the critical exponents of percolation theory
Levinshteĭn, M. E., Shklovskii, B. I., Shur, M. S., & Éfros, A. L. (1976) · Journal of Experimental and Theoretical Physics · Cited by 51
Ames, W. F. (1990) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(90)90088-z · Cited by 49
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
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.