| 无向随机网络图的最优树研究 |
| |
| 引用本文： | 张伦,李赵祥,杜少安. 无向随机网络图的最优树研究[J]. 中央民族大学学报(自然科学版), 2011, 0(4) |
| |
| 作者姓名： | 张伦 李赵祥 杜少安 |
| |
| 作者单位： | 1. 中央民族大学理学院,北京,100081
2. 张家界市第一中学,湖南张家界,427000 |
| |
| 摘 要： | 本文对权值为随机变量的无向随机网络的最优树进行了分析．证明了随机网络最优树仍为一随机变量，并给出了已知随机变量密度分布的最优树权值和的求解方法与模拟．最后对未知随机变量进行分析，并给出方法．
|
| 关 键 词： | 随机网络 最优树 MonteCado模拟 Bootstrap模拟 |
Minimal Trees in Random Garphs |
| |
| ZHANG Lun,LI Zhao-xiang,DU Shao-an. Minimal Trees in Random Garphs[J]. Journal of The Central University for Nationalities(Natural Sciences Edition), 2011, 0(4) |
| |
| Authors: | ZHANG Lun LI Zhao-xiang DU Shao-an |
| |
| Affiliation: | ZHANG Lun1,LI Zhao-xiang1,DU Shao-an2(1.College of science,Minzu University of China,Beijing 100081,China,2.The first high school of zhang jia jie,HuNan ZhangJiajie 427000,China) |
| |
| Abstract: | 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. |
| |
| Keywords: | random graph minimal tree monte carlo simulation bootstrap simulation |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
