Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 1,928

The DOI matches its Crossref record.

Percolation and cluster distribution. I. Cluster multiple labeling technique and critical concentration algorithm

Hoshen, J., Kopelman, R.·1976·Physical Review B

Abstract

A new approach for the determination of the critical percolation concentration, percolation probabilities, and cluster size distributions is presented for the site percolation problem. The novel "cluster multiple labeling technique" is described for both two- and three-dimensional crystal structures. Its distinctive feature is the assignment of alternate labels to sites belonging to the same cluster. These sites are members of a simulated finite random lattice. An algorithm useful for the determination of the critical percolation concentration of a finite lattice is also presented. This algorithm is especially useful when applied in conjunction with the cluster multiple labeling technique. The basic features of this technique are illustrated by applying it to a small planar square lattice. Numerical results are given for a triangular subcrystal containing up to 9 000 000 sites. These results compare favorably with the exact value of the infinite lattice critical percolation concentration.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physrevb.14.3438

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 1,928

Metadata

Authors
Hoshen, J., & Kopelman, R.
Venue
Physical Review B
Published
1976-10-15
Volume
14
Issue
8
Pages
3438-3445
ISSN
0556-2805 (ISSN-L)
OpenAlex
W2061832930
Cited by
1,928
References
0
FWCI
4.91
Type
journal article
Language
en
Open access
closed

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Percolation and cluster distribution. I. Cluster multiple labeling technique and critical concentration algorithm. https://app.cochat.ai/papers/10.1103/physrevb.14.3438
The paper
Hoshen, J., & Kopelman, R. (1976). Percolation and cluster distribution. I. Cluster multiple labeling technique and critical concentration algorithm. Physical Review B. https://doi.org/10.1103/physrevb.14.3438

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.