526
个编辑
更改
→Random trees
给定一个 ''q'' 颜色的随机图的真染色数，称为它的'''<font color="#FF8000">染色多项式 Chormatic Polynomial </font>'''（到目前为止还没有确定的正式名称）。利用'''<font color="#FF8000">符号模式匹配算法 Algorithm Based On Symbolic Pattern Matching </font>''' ，对参数为 ''n'' 、边数为 ''m'' 或连接概率为 ''p'' 的随机图的染色多项式零点的标度进行了实验研究。。
给定一个 ''q'' 颜色的随机图的真染色数，称为它的'''<font color="#FF8000">染色多项式 Chormatic Polynomial </font>'''（到目前为止还没有确定的正式名称）。利用'''<font color="#FF8000">符号模式匹配算法 Algorithm Based On Symbolic Pattern Matching </font>''' ，对参数为 ''n'' 、边数为 ''m'' 或连接概率为 ''p'' 的随机图的染色多项式零点的标度进行了实验研究。。
== Random trees ==
== Random trees 随机树图==
'''<font color="#FF8000">随机树 Random Tree </font>'''<br>
'''<font color="#FF8000">随机树图 Random Tree </font>'''<br>
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.
随机树是由随机过程组成的树状图。在 ''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 ==