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

The DOI matches its Crossref record.

Component behavior near the critical point of the random graph process

Łuczak, Tomasz·1990·Random Structures & Algorithms

Abstract

We study the behavior of a random graph process (G(n, M))02 n for M(n) = n/2 + s and ∣s∣3n−;2 → ∞. Among others we find the number of components in G(n, M) and estimate the number of vertices and edges in the k th largest component of G(n, M), for any natural number k, Moreover, it is shown that, with probability 1 –o(1), when M(n) = n/2 + s, s3n−2 →−∞, then during a random graph process in some step M 1 > M a “new” largest component will emerge, whereas when s3n−2→∞, the largest component of G(n, M) remains largest until the very end of the process.

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.1002/rsa.3240010305

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 215

Metadata

Authors
Łuczak, T.
Venue
Random Structures & Algorithms
Publisher
Wiley
Published
1990-09
Volume
1
Issue
3
Pages
287-310
ISSN
  • 1042-9832 (ISSN-L)
  • 1098-2418
OpenAlex
W2040419749
Cited by
215
References
0
FWCI
5.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: Component behavior near the critical point of the random graph process. https://app.cochat.ai/papers/10.1002/rsa.3240010305
The paper
Łuczak, T. (1990). Component behavior near the critical point of the random graph process. Random Structures & Algorithms. https://doi.org/10.1002/rsa.3240010305

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.