The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
The evolution of random graphs
Abstract
According to a fundamental result of Erdös and Rényi, the structure of a random graph GM changes suddenly when M∼n/2: if M=⌊cn⌋and c>12 then a.e. random graph of order n and since M is such that its largest component has O(logn)vertices, but for c>12 a.e.GM has a giant component: a component of order(1−αc+o(1))n where αc>1. The aim of this paper is to examine in detail the structure of a random graph GM when M is close to n/2. Among others it is proved that if M=n/2+s,s=o(n)and s≥(logn)1/2n2/3 then the giant component has(4+o(1))s vertices. Furthermore, rather precise estimates are given for the order of the r th largest component for every fixed r.
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
Harary, F. (1969) · Cited by 10,739
Bollobás, B. (1985) · Cited by 6,196
Self-citationThe Evolution of Random Graphs
(1986) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/062/06 · Cited by 5,543
Erdős, P., & Rényi, A. (2022) · Publicationes Mathematicae Debrecen · doi:10.5486/pmd.1959.6.3-4.12 · Cited by 5,337
Bollobás, B. (1979) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-9967-7 · Cited by 610
Self-citationProbability of Indecomposability of a Random Mapping Function
Katz, L. (1955) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177728496 · Cited by 91
Poisson convergence and random graphs
Barbour, A. D. (1982) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100059995 · Cited by 80
Cited by
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
Random Graphs and Complex Networks
Hofstad, R. V. D. (2016) · Cambridge University Press eBooks · doi:10.1017/9781316779422 · Cited by 840
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
MOLLOY, M., & REED, B. (1998) · Combinatorics, Probability and Computing · doi:10.1017/s0963548398003526 · Cited by 831
Frieze, A., & Karoński, M. (2015) · doi:10.1017/cbo9781316339831 · Cited by 576
The phase transition in inhomogeneous random graphs
Bollobás, B., Janson, S., & Riordan, O. (2007) · Random Structures & Algorithms · doi:10.1002/rsa.20168 · Cited by 545
Self-citation
Metadata
- Authors
- Bollobás, B.
- Venue
- Transactions of the American Mathematical Society
- Publisher
- American Mathematical Society (AMS)
- Published
- 1984
- Volume
- 286
- Issue
- 1
- Pages
- 257-274
- ISSN
- 0002-9947 (ISSN-L)
- 1088-6850
- OpenAlex
- W1983610133
- Cited by
- 415
- References
- 7
- FWCI
- 0.78
- 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: The evolution of random graphs. https://app.cochat.ai/papers/10.1090/s0002-9947-1984-0756039-5
- The paper
- Bollobás, B. (1984). The evolution of random graphs. Transactions of the American Mathematical Society. https://doi.org/10.1090/s0002-9947-1984-0756039-5
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.