Statements (26)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:random_graph_model
|
| gptkbp:alsoKnownAs |
gptkb:Erdős–Rényi_model_G(n,p)
|
| gptkbp:application |
gptkb:percolation_theory
network science random networks |
| gptkbp:describes |
probabilistic method for generating random graphs
|
| gptkbp:edgeFormationRule |
each possible edge included independently with probability p
|
| gptkbp:edgeProbability |
p
|
| gptkbp:field |
graph theory
|
| gptkbp:introducedIn |
1959
|
| gptkbp:namedAfter |
gptkb:Edgar_Gilbert
|
| gptkbp:notation |
G(n,p)
|
| gptkbp:relatedTo |
gptkb:Erdős–Rényi_model_G(n,M)
|
| gptkbp:studiedProperty |
connectivity
diameter giant component threshold functions clustering coefficient degree distribution |
| gptkbp:usedIn |
random graph theory
statistical physics probabilistic combinatorics |
| gptkbp:vertices |
n
|
| gptkbp:bfsParent |
gptkb:Erdős–Rényi_random_graph
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Gilbert random graph
|