Statements (28)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
random graph model
|
| gptkbp:defines |
A model where a graph is constructed by connecting nodes randomly.
|
| gptkbp:describes |
random graphs
|
| gptkbp:field |
gptkb:probability_theory
graph theory |
| gptkbp:G(n,_M) |
A graph with n nodes and M edges chosen uniformly at random.
|
| gptkbp:G(n,_p) |
A graph with n nodes where each possible edge is included with probability p independently.
|
| gptkbp:hasVariant |
G(n, M)
G(n, p) |
| https://www.w3.org/2000/01/rdf-schema#label |
Erdős–Rényi model
|
| gptkbp:influenced |
random graph theory
modern network theory |
| gptkbp:introducedIn |
1959
|
| gptkbp:namedAfter |
gptkb:Paul_Erdős
gptkb:Alfréd_Rényi |
| gptkbp:property |
degree distribution is binomial
expected number of edges is p times n(n-1)/2 giant component emerges at p = 1/n threshold phenomena |
| gptkbp:publishedIn |
gptkb:Publication_of_the_Mathematical_Institute_of_the_Hungarian_Academy_of_Sciences
|
| gptkbp:relatedTo |
random network
scale-free network small-world network |
| gptkbp:usedFor |
gptkb:percolation_theory
network science studying phase transitions in graphs |
| gptkbp:bfsParent |
gptkb:Paul_Erdős
|
| gptkbp:bfsLayer |
4
|