The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
The birth of the giant component
Abstract
Limiting distributions are derived for the sparse connected components that are present when a random graph on n vertices has approximately 1/2 n edges. In particular, we show that such a graph consists entirely of trees, unicyclic components, and bicyclic components with probability approaching √2/3 cosh √5/18 ≈ 0.9325 as n→∞. The limiting probability that it is consists of trees, unicyclic components, and at most one another component is approximately 0.9957; the limiting probability that it is planar lies between 0.987 and 0.9998. When a random graph evolves and the number of edges passes 1/2 n, its components grow in cyclic complexity according to an interesting Markov process whose asymptotic structure is derived. The probability that there never is more than a single component with more edges than vertices, throughout the veolution, approaches 5 π/18 ≈ 0.8727. A “uniform” model of random graphs, which allows self‐loops and multiple edges, is shown to lead to formulas that are substanitially simpler than the analogous formulas for the classical random graphs of Erdõs and Rényi. The notions of “excess” and “deficiency,” which are significant characteristics of the generating function as well as of the graphs themselves, lead to a mathematically attractive structural theory for the uniform model. A general approach to the study of stopping configurations makes it possible to sharpen previously obtained estimates in a uniform manner and often to obtain closed forms for the constants of interest. Empirical results are presented to complement the analysis, indicating the typical behavior when n is near 2oooO. © 1993 John Wiley & Sons, Inc.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Erdős, P., & Rényi, A. (2022) · Publicationes Mathematicae Debrecen · doi:10.5486/pmd.1959.6.3-4.12 · Cited by 5,337
Applied and Computational Complex Analysis
Thacher, H. C., & Henrici, P. (1977) · Mathematics of Computation · doi:10.2307/2005805 · Cited by 2,022
Mitrinović, D. S. (1970) · Springer eBooks · doi:10.1007/978-3-642-99970-3 · Cited by 1,377
A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs
Bollobás, B. (1980) · European Journal of Combinatorics · doi:10.1016/s0195-6698(80)80030-8 · Cited by 1,151
Correlation inequalities on some partially ordered sets
Fortuin, C. M., Kasteleyn, P. W., & Ginibre, J. (1971) · Communications in Mathematical Physics · doi:10.1007/bf01651330 · Cited by 1,096
The Evolution of Random Graphs
Bollobas, B. (1984) · Transactions of the American Mathematical Society · doi:10.2307/1999405 · Cited by 1,023
Pemantle, R., Wilson, M. C., & Melczer, S. (2024) · Cambridge University Press eBooks · doi:10.1017/9781108874144.003 · Cited by 939
The evolution of random graphs
Bollobás, B. (1984) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1984-0756039-5 · Cited by 415
Component behavior near the critical point of the random graph process
Łuczak, T. (1990) · Random Structures & Algorithms · doi:10.1002/rsa.3240010305 · Cited by 215
Self-citationThe transitive closure of a random digraph
Karp, R. M. (1990) · Random Structures & Algorithms · doi:10.1002/rsa.3240010106 · Cited by 215
The number of connected sparsely edged graphs
Wright, E. M. (1977) · Journal of Graph Theory · doi:10.1002/jgt.3190010407 · Cited by 135
The Structure of a Random Graph at the Point of the Phase Transition
Łuczak, T., Pittel, B. G., & Wierman, J. C. (1994) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1994-1138950-5 · Cited by 127
Self-citationThe first cycles in an evolving graph
Flajolet, P., Knuth, D. E., & Pittel, B. G. (1989) · Discrete Mathematics · doi:10.1016/0012-365x(89)90087-3 · Cited by 108
Self-citationOn Matchings and Hamiltonian Cycles in Random Graphs
Bollobás, B., & FRIEZE, A. M. (1985) · North-Holland mathematics studies · doi:10.1016/s0304-0208(08)73611-9 · Cited by 100
Ueber eine der Interpolation entsprechende Darstellung der Eliminations-Resultante.
Borchardt, C. W. (1860) · Journal für die reine und angewandte Mathematik (Crelles Journal) · doi:10.1515/crll.1860.57.111 · Cited by 61
Cycles in a random graph near the critical point
Łuczak, T. (1991) · Random Structures and Algorithms · doi:10.1002/rsa.3240020405 · Cited by 50
Self-citationMulticyclic components in a random graph process
Janson, S. (1993) · Random Structures and Algorithms · doi:10.1002/rsa.3240040105 · Cited by 24
Self-citation
Cited by
Corless, R. M., Gonnet, G. H., Hare, D. E. G., Jeffrey, D. J., & Knuth, D. E. (1996) · Advances in Computational Mathematics · doi:10.1007/bf02124750 · Cited by 6,150
Self-citationDorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
A critical point for random graphs with a given degree sequence
Molloy, M., & Reed, B. (1995) · Random Structures & Algorithms · doi:10.1002/rsa.3240060204 · Cited by 2,351
Combinatorial Stochastic Processes
(2006) · Lecture Notes in Mathematics · doi:10.1007/b11601500 · Cited by 935
Random Graphs and Complex Networks
Hofstad, R. V. D. (2016) · Cambridge University Press eBooks · doi:10.1017/9781316779422 · Cited by 840
Metadata
- Authors
- Janson, S., Knuth, D. E., Łuczak, T., & Pittel, B.
- Venue
- Random Structures & Algorithms
- Publisher
- Wiley
- Published
- 1993-01
- Volume
- 4
- Issue
- 3
- Pages
- 233-358
- ISSN
- 1042-9832 (ISSN-L)
- 1098-2418
- OpenAlex
- W2010894431
- Cited by
- 389
- References
- 17
- FWCI
- 8.17
- 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
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.