Cited by 5,337Limits and Structures in Graph TheoryStochastic processes and statistical mechanicsComplex Network Analysis Techniques

On random graphs. I.

Erdős, P., Rényi, A.·2022·Publicationes Mathematicae Debrecen

Integrity signals

Registry

Crossref · 10.5486/pmd.1959.6.3-4.12

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Since the early study of random graphs by Erdös and Renyi (1959), the degree distribution P(k) has become a common way of classifying graphs into categories.

    “Since the early study of random graphs performed by Erdös and Renyi (1959), the degree distribution”

    From A Network Approach to Link Visibility and Urban Activity Location (2018) · cites this paper as Erdös and Renyi 1959

Cited by

Sorted by citations

Authors
Erdős, P., & Rényi, A.
Venue
Publicationes Mathematicae Debrecen
Published
2022-07-01
Volume
6
Issue
3-4
Pages
290-297
ISSN
0033-3883 (ISSN-L)
OpenAlex
W4312512934
Cited by
5,337
References
0
Citations by year
2026: 202 · 2025: 283 · 2024: 275 · 2023: 229 · 2022: 258 · 2021: 280 · 2020: 297 · 2019: 335 · 2018: 327 · 2017: 293 · 2016: 286 · 2015: 279 · 2014: 245 · 2013: 226 · 2012: 215
FWCI
454.86
Type
journal article
Language
en
Open access
closed
Locations
Publicationes Mathematicae Debrecen (publishedVersion)
Topics
  • Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Limits and Structures in Graph Theory
  • Physical Sciences › Mathematics › Mathematical Physics › Stochastic processes and statistical mechanics
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
Keywords
random graphs

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