Statements (28)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
random graph model
|
| gptkbp:alsoKnownAs |
gptkb:Erdős–Rényi_model
|
| gptkbp:describes |
random graphs
|
| gptkbp:field |
gptkb:probability_theory
graph theory |
| gptkbp:hasModel |
G(n, M)
G(n, p) |
| gptkbp:hasProperty |
binomial degree distribution
edges are added randomly edges are independent no clustering no community structure probability p for each edge vertices are fixed |
| https://www.w3.org/2000/01/rdf-schema#label |
Erdős–Rényi process
|
| gptkbp:influenced |
random network models
scale-free networks small-world networks |
| gptkbp:introducedIn |
1959
|
| gptkbp:namedAfter |
gptkb:Paul_Erdős
gptkb:Alfréd_Rényi |
| gptkbp:relatedTo |
gptkb:percolation_theory
network science phase transition |
| gptkbp:usedFor |
studying connectivity in graphs
studying emergence of giant component |
| gptkbp:bfsParent |
gptkb:Paul_Erdős
|
| gptkbp:bfsLayer |
4
|