Metraipolis › archive › dc_1201ad4e2226
Erdős–Rényi model — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93R%C3%A9nyi_model
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T11:39:03.370Z
- SHA-256 of the archived text
d1779af05d0e956d3427c8a874026171e3baf0eb66991616fc3f6be6cbeb5751- Stable URL of this page
https://metraipolis.com/documento/dc_1201ad4e2226
How to cite
Erdős–Rényi model — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93R%C3%A9nyi_model (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_1201ad4e2226 (Metraipolis archive dc_1201ad4e2226, sha256 d1779af05d0e956d3427c8a874026171e3baf0eb66991616fc3f6be6cbeb5751)
BibTeX
@misc{dc1201ad4e2226,
title = {Erdős–Rényi model — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93R%C3%A9nyi_model},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_1201ad4e2226; sha256 d1779af05d0e956d3427c8a874026171e3baf0eb66991616fc3f6be6cbeb5751},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93R%C3%A9nyi_model. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In the mathematical field of graph theory, the Erdős–Rényi models are two closely related models for generating random graphs and the evolution of a random network. These models are named after Hungarian mathematicians Paul Erdős and Alfréd Rényi, who introduced one of the models in 1959. Edgar Gilbert introduced the other model contemporaneously with and independently of Erdős and Rényi. In the model of Erdős and Rényi, all graphs on a fixed vertex set with a fixed number of edges are equally likely. In the model introduced by Gilbert, also called the Erdős–Rényi–Gilbert model, each edge has a fixed probability of being present or absent, independently of the other edges. These models can be used in the probabilistic method to prove the existence of graphs satisfying various properties, or to provide a rigorous definition of what it means for a property to hold for almost all graphs. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «graph theory»). Fonte: Wikipedia in inglese, voce «Erdős–Rényi model» — https://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93R%C3%A9nyi_model Wikidata Q605807 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q605807 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93R%C3%A9nyi_model?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1348103247, consultata il 2026-10-07T11:19:02.058Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: f9431043191cd60206742862e2c6e2d559d0b30e09771bd2b62b54d309631b8a