Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
random graph model
|
| gptkbp:application |
network science
random networks |
| gptkbp:describes |
random graph with n vertices and M edges
|
| gptkbp:edgeSelection |
M edges chosen uniformly at random from all possible edges
|
| gptkbp:field |
gptkb:probability_theory
graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Erdős–Rényi model G(n,M)
|
| gptkbp:introducedIn |
1959
|
| gptkbp:namedAfter |
gptkb:Paul_Erdős
gptkb:Alfréd_Rényi |
| gptkbp:property |
graph
edges are independent simple graph no multiple edges no self-loops |
| gptkbp:publicationYear |
1959
|
| gptkbp:publishedIn |
On random graphs I
|
| gptkbp:relatedTo |
gptkb:Erdős–Rényi_model_G(n,p)
|
| gptkbp:studiedBy |
gptkb:Paul_Erdős
gptkb:Alfréd_Rényi |
| gptkbp:bfsParent |
gptkb:Gilbert_random_graph
|
| gptkbp:bfsLayer |
6
|