Erdős–Rényi model
In the mathematical field of graph theory, the Erdős–Rényi model is either of two closely related models for generating random graphs or the evolution of a random network. They are named after Hungarian mathematicians Paul Erdős and Alfréd Rényi, who first introduced one of the models in 1959, while Edgar Gilbert introduced the other model contemporaneously 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, 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
Aanderaa–Karp–Rosenberg conjectureAlfréd RényiAlmost surelyAnatol RapoportAsymmetric graphAverage path lengthBack-and-forth methodBarabási–Albert modelBounded expansionCatalog of articles in probability theoryClique percolation methodClique problemCommunity structureComplex networkComputational hardness assumptionConfiguration modelCopying network modelsCristopher MooreCuckoo hashingDegree-preserving randomizationDegree distributionDeterministic finite automatonDual-phase evolutionERER graphEdgar GilbertErdoes-Renyi modelErdos-Renyi modelErdos-Renyi random graphErdos-ReyniErdos–Renyi modelErdos–Renyi random graphErdös-Renyi modelErdősErdős-RényiErdős-Rényi modelErdős–Hajnal conjectureErdős–RényiEvolution of a random networkEvolving network
Link from a Wikipage to another Wikipage
primaryTopic
Erdős–Rényi model
In the mathematical field of graph theory, the Erdős–Rényi model is either of two closely related models for generating random graphs or the evolution of a random network. They are named after Hungarian mathematicians Paul Erdős and Alfréd Rényi, who first introduced one of the models in 1959, while Edgar Gilbert introduced the other model contemporaneously 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, 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
has abstract
En teoria de grafs, el model d ...... r-se a gairebé tots els grafs.
@ca
En teoría de grafos el modelo ...... a generación de otras redes.
@es
In the mathematical field of g ...... to hold for almost all graphs.
@en
Na teoria de grafos, o modelo ...... ou grafo aleatório Binomial).
@pt
Модель Ердеша — Реньї — це одн ...... ається майже для всіх графів».
@uk
Модель Эрдёша — Реньи — это од ...... лняется для почти всех графов.
@ru
在图论中，ER随机图（Erdős–Rényi random ...... 性的图的存在，或者对几乎所有图具有属性的含义提供严格的定义。
@zh
Link from a Wikipage to an external page
Wikipage page ID
10,477,221
page length (characters) of wiki page
Wikipage revision ID
1,015,677,656
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
En teoria de grafs, el model d ...... uè significa per una propietat
@ca
En teoría de grafos el modelo ...... a generación de otras redes.
@es
In the mathematical field of g ...... ovide a rigorous definition of
@en
Na teoria de grafos, o modelo ...... nter quase todos estes grafos.
@pt
Модель Ердеша — Реньї — це одн ...... ається майже для всіх графів».
@uk
Модель Эрдёша — Реньи — это од ...... оно выполняется для почти всех
@ru
在图论中，ER随机图（Erdős–Rényi random ...... 性的图的存在，或者对几乎所有图具有属性的含义提供严格的定义。
@zh
label
ER随机图
@zh
Erdős–Rényi model
@en
Model d'Erdős-Rényi
@ca
Modelo Erdös–Rényi
@es
Modelo Erdős–Rényi
@pt
Модель Ердеша — Реньї
@uk
Модель Эрдёша — Реньи
@ru