The DOI matches its Crossref record.
Percolation processes: II. The connective constant
Abstract
The previous paper (1) omitted the proof of the theorem on the connective constant of a crystal. This paper supplies the proof. For ease of reference, we first recall the relevant nomenclature and enunciate the theorem; to this extent the present paper is self-contained.
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
Cited by
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Kirkpatrick, S. (1973) · Reviews of Modern Physics · doi:10.1103/revmodphys.45.574 · Cited by 5,260
Azizi Samir, M. A. S., Alloin, F., & Dufresne, A. (2005) · Biomacromolecules · doi:10.1021/bm0493685 · Cited by 2,311
Chemistry of Aerogels and Their Applications
Pierre, A. C., & Pajonk, G. M. (2002) · Chemical Reviews · doi:10.1021/cr0101306 · Cited by 2,239
The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk
Madras, N., & Sokal, A. D. (1988) · Journal of Statistical Physics · doi:10.1007/bf01022990 · Cited by 939
Metadata
- Authors
- Hammersley, J. M.
- Venue
- Mathematical Proceedings of the Cambridge Philosophical Society
- Publisher
- Cambridge University Press (CUP)
- Published
- 1957-07
- Volume
- 53
- Issue
- 3
- Pages
- 642-645
- ISSN
- 0305-0041 (ISSN-L)
- 1469-8064
- OpenAlex
- W577286
- Cited by
- 395
- References
- 0
- FWCI
- 3.96
- 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 processes: II. The connective constant. https://app.cochat.ai/papers/10.1017/s0305004100032692
- The paper
- Hammersley, J. M. (1957). Percolation processes: II. The connective constant. Mathematical Proceedings of the Cambridge Philosophical Society. https://doi.org/10.1017/s0305004100032692
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.
