274
个编辑
更改
跳到导航
跳到搜索
第223行：
第223行： + + 第230行：
第232行： − 随机树是由随机过程组成的树或树木。在 n 阶和 m (n)大小的随机图的大范围内，k 阶树分量个数的分布是渐近泊松的。随机树的类型包括均匀生成树、随机最小生成树、随机二叉树、树、快速探索随机树、布朗树和随机森林。+ − −
→Random trees
== Random trees ==
== Random trees ==
随机树<br>
{{main|Random tree}}
{{main|Random tree}}
A random tree is a tree or arborescence that is formed by a stochastic process. In a large range of random graphs of order n and size M(n) the distribution of the number of tree components of order k is asymptotically Poisson. Types of random trees include uniform spanning tree, random minimal spanning tree, random binary tree, treap, rapidly exploring random tree, Brownian tree, and random forest.
A random tree is a tree or arborescence that is formed by a stochastic process. In a large range of random graphs of order n and size M(n) the distribution of the number of tree components of order k is asymptotically Poisson. Types of random trees include uniform spanning tree, random minimal spanning tree, random binary tree, treap, rapidly exploring random tree, Brownian tree, and random forest.
'''<font color="#FF8000">随机树 Random Tree </font>'''是由随机过程组成的树。在 ''n'' 阶和 ''M''(''n'')大小的随机图的大范围内，''k'' 阶树分量个数的分布是渐近泊松的。随机树的类型包括'''<font color="#FF8000">均匀生成树 Uniform Spanning Tree、随机最小生成树 Random Minimal Tree、随机二叉树 Random Binary Tree、树、快速探索随机树 Rapidly Exploring Random Tree、布朗树 Brownian Tree和随机森林 Random Forest </font>'''。
== Conditional random graphs ==
== Conditional random graphs ==