Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
random graph model
|
| gptkbp:alternativeName |
binomial random graph
|
| gptkbp:defines |
Each possible edge between n nodes is included independently with probability p.
|
| gptkbp:describes |
random graphs
|
| gptkbp:field |
gptkb:probability_theory
graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Erdős–Rényi model G(n,p)
|
| gptkbp:introducedIn |
1959
|
| gptkbp:namedAfter |
gptkb:Paul_Erdős
gptkb:Alfréd_Rényi |
| gptkbp:parameter |
n
p |
| gptkbp:property |
degree distribution is binomial
edges are independent expected number of edges is p*n(n-1)/2 giant component emerges above critical threshold phase transition at p=1/n |
| gptkbp:relatedTo |
gptkb:Erdős–Rényi_model_G(n,M)
|
| gptkbp:usedIn |
gptkb:mathematics
computer science network science |
| gptkbp:bfsParent |
gptkb:Gilbert_random_graph
|
| gptkbp:bfsLayer |
6
|