The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Low-density series expansions for directed percolation: I. A new efficient algorithm with applications to the square lattice
Open accessAbstract
A new algorithm for the derivation of low-density series for percolation on directed lattices is introduced and applied to the square lattice bond and site problems. Numerical evidence shows that the computational complexity grows exponentially, but with a growth factor < , which is much smaller than the growth factor = of the previous best algorithm. For bond (site) percolation on the directed square lattice the series has been extended to order 171 (158). Analysis of the series yields sharper estimates of the critical points and exponents.
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
Cites
Wu, F. Y. (1982) · Reviews of Modern Physics · doi:10.1103/revmodphys.54.235 · Cited by 3,570
Cited by
Universality classes in nonequilibrium lattice systems
Ódor, G. (2004) · Reviews of Modern Physics · doi:10.1103/revmodphys.76.663 · Cited by 835
Recent advances in percolation theory and its applications
Saberi, A. A. (2015) · Physics Reports · doi:10.1016/j.physrep.2015.03.003 · Cited by 438
Metadata
- Authors
- Jensen, I.
- Venue
- Journal of Physics A: Mathematical and General
- Publisher
- IOP Publishing
- Published
- 1999-01-01
- Volume
- 32
- Issue
- 28
- Pages
- 5233-5249
- ISSN
- 0305-4470 (ISSN-L)
- 1361-6447
- OpenAlex
- W1968317380
- Cited by
- 181
- References
- 1
- FWCI
- 6.48
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Low-density series expansions for directed percolation: I. A new efficient algorithm with applications to the square lattice. https://app.cochat.ai/papers/10.1088/0305-4470/32/28/304
- The paper
- Jensen, I. (1999). Low-density series expansions for directed percolation: I. A new efficient algorithm with applications to the square lattice. Journal of Physics A: Mathematical and General. https://doi.org/10.1088/0305-4470/32/28/304
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.
