320
个编辑
更改
→Erdős–Rényi random graph model
[[File:ER model.svg|thumb|This [[Erdős–Rényi model]] is generated with {{math|<VAR>N</VAR> {{=}} 4}} nodes. For each edge in the complete graph formed by all {{mvar|N}} nodes, a random number is generated and compared to a given probability. If the random number is less than {{mvar|p}}, an edge is formed on the model.]]
[[File:ER model.svg|thumb|This [[Erdős–Rényi model]] is generated with {{math|<VAR>N</VAR> {{=}} 4}} nodes. For each edge in the complete graph formed by all {{mvar|N}} nodes, a random number is generated and compared to a given probability. If the random number is less than {{mvar|p}}, an edge is formed on the model.]]
The '''[[Erdős–Rényi model]]''', named for [[Paul Erdős]] and [[Alfréd Rényi]], is used for generating [[random graph]]s in which edges are set between nodes with equal probabilities. It can be used in the [[probabilistic method]] to prove the existence of graphs satisfying various properties, or to provide a rigorous definition of what it means for a property to hold for almost all graphs.
The '''[[Erdős–Rényi model]]''', named for [[Paul Erdős]] and [[Alfréd Rényi]], is used for generating [[random graph]]s in which edges are set between nodes with equal probabilities. It can be used in the [[probabilistic method]] to prove the existence of graphs satisfying various properties, or to provide a rigorous definition of what it means for a property to hold for almost all graphs.
以[[Paul Erdős]]和[[Alfréd Rényi]]命名的'''[[Erdős–Rényi 模型]]'''用于生成[[随机图]]，它的边是等概率连接的节点的集合。[[随机图]]可以用来证明[[概率方法]]中满足某些条件的图的存在性，或者对几乎所有图给出某个性质的严格定义。
To generate an Erdős–Rényi model <math>G(n, p)
To generate an Erdős–Rényi model <math>G(n, p)