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

The DOI matches its Crossref record.

Random Plane Networks

Gilbert, E. N.·1961·Journal of the Society for Industrial and Applied Mathematics

Abstract

Previous article Next article Random Plane NetworksE. N. GilbertE. N. Gilberthttps://doi.org/10.1137/0109045PDFPDF PLUSBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] T. L. Austin, , R. E. Fagen, , W. F. Penney and , John Riordan, The number of components in random linear graphs, Ann. Math. Statist, 30 (1959), 747–754 MR0115939 0088.11602 CrossrefISIGoogle Scholar[2] S. R. Broadbent and , J. M. Hammersley, Percolation processes. I. Crystals and mazes, Proc. Cambridge Philos. Soc., 53 (1957), 629–641 MR0091567 0091.13901 CrossrefGoogle Scholar[3] P. Erdo˝s and , A. Rényi, On the evolution of random graphs, Magyar Tud. Akad. Mat. Kutató Int. Közl., 5 (1960), 17–61 MR0125031 Google Scholar[4] William Feller, An introduction to probability theory and its applications. Vol. I, John Wiley and Sons, Inc., New York, 1957xv+461 MR0088081 Google Scholar[5] E. N. Gilbert, Random graphs, Ann. Math. Statist., 30 (1959), 1141–1144 MR0108839 0168.40801 CrossrefISIGoogle Scholar[6] J. M. Hammersley, Percolation processes. II. The connective constant, Proc. Cambridge Philos. Soc., 53 (1957), 642–645 MR0091568 0091.13902 CrossrefGoogle Scholar[7] J. M. Hammersley, Percolation processes: Lower bounds for the critical probability, Ann. Math. Statist., 28 (1957), 790–795 MR0101564 0091.13903 CrossrefISIGoogle Scholar[8] J. M. Hammersley, Bornes supérieures de la probabilité critique dans un processus de filtrationLe calcul des probabilités et ses applications. Paris, 15-20 juillet 1958, Colloques Internationaux du Centre National de la Recherche Scientifique, LXXXVII, Centre National de la Recherche Scientifique, Paris, 1959, 17–37 MR0105751 0096.11502 Google Scholar[9] T. E. Harris, A lower bound for the critical probability in a certain percolation process, Proc. Cambridge Philos. Soc., 56 (1960), 13–20 MR0115221 0122.36403 CrossrefGoogle Scholar Previous article Next article FiguresRelatedReferencesCited ByDetails On Treewidth and Related Parameters of Random Geometric GraphsDieter Mitsche and Guillem PerarnauSIAM Journal on Discrete Mathematics, Vol. 31, No. 2 | 22 June 2017AbstractPDF (619 KB)Mean Square Performance of Consensus-Based Distributed Estimation over Regular Geometric GraphsSIAM Journal on Control and Optimization, Vol. 50, No. 1 | 19 January 2012AbstractPDF (397 KB)Sharp Threshold for Hamiltonicity of Random Geometric GraphsSIAM Journal on Discrete Mathematics, Vol. 21, No. 1 | 26 January 2007AbstractPDF (148 KB)Percolation Processes and Related TopicsH. L. Frisch and J. M. HammersleyJournal of the Society for Industrial and Applied Mathematics, Vol. 11, No. 4 | 13 July 2006AbstractPDF (2830 KB) Volume 9, Issue 4| 1961Journal of the Society for Industrial and Applied Mathematics489-699 History Submitted:14 December 1960Published online:10 July 2006 InformationCopyright © 1961 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0109045Article page range:pp. 533-543ISSN (print):0368-4245ISSN (online):2168-3484Publisher:Society for Industrial and Applied Mathematics

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.1137/0109045

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 656

Metadata

Authors
Gilbert, E. N.
Venue
Journal of the Society for Industrial and Applied Mathematics
Published
1961-12
Volume
9
Issue
4
Pages
533-543
ISSN
  • 0368-4245 (ISSN-L)
  • 2168-3484
OpenAlex
W2088521668
Cited by
656
References
0
FWCI
0.59
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: Random Plane Networks. https://app.cochat.ai/papers/10.1137/0109045
The paper
Gilbert, E. N. (1961). Random Plane Networks. Journal of the Society for Industrial and Applied Mathematics. https://doi.org/10.1137/0109045

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.