无向随机网络图的最优树研究

Minimal Trees in Random Garphs

本文对权值为随机变量的无向随机网络的最优树进行了分析.证明了随机网络最优树仍为一随机变量,并给出了已知随机变量密度分布的最优树权值和的求解方法与模拟.最后对未知随机变量进行分析,并给出方法.

This paper analyses the problem of finding minimal-tree probability distributions in random graphs whose branches are weighted with probability functions, and gives a method to get the probability distribution. Finally it discusses briefly the method of unknown weighted random graphs.