首页> 外文会议>Annual ACM symposium on Theory of computing;ACM symposium on Theory of computing >Generating random spanning trees more quickly than the cover time

【24h】

Generating random spanning trees more quickly than the cover time

机译：比覆盖时间更快地生成随机生成树

获取原文

页面导航

著录项
相似文献
相关主题

著录项

来源
《Annual ACM symposium on Theory of computing;ACM symposium on Theory of computing》|1996年|P.296-303|共8页
会议地点
作者
David Bruce Wilson;
展开▼
作者单位

展开▼
会议组织
原文格式 PDF
正文语种
中图分类计算技术、计算机技术;
关键词

相似文献

外文文献
中文文献
专利

1. How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph [J] . James Gary Propp, David Bruce Wilson Journal of Algorithms . 1998,第2期

机译：如何从通用马尔可夫链中获得完全随机的样本并生成有向图的随机生成树
2. A SPANNING TREE METHOD FOR BOUNDING HITTING TIMES OF RANDOM WALKS ON GRAPHS [J] . RANDY COGILL, CHENG PENG SIAM Journal on Discrete Mathematics . 2011,第3期

机译：图上树的随机游击时间的约束树
3. Topological properties of stock networks based on minimal spanning tree and random matrix theory in financial time series [J] . Eom C, Oh G, Jung WS, Physica, A. Statistical mechanics and its applications . 2009,第6期

机译：基于最小生成树和随机矩阵理论的金融时间序列的股票网络拓扑特性
4. How to get an exact sample from a generic Markov chain and sample a random spanning tree from a directed graph, both within the cover time [C] . David Bruce Wilson, James Gary Propp Annual ACM-SIAM symposium on Discrete algorithms;ACM-SIAM symposium on Discrete algorithms . 1996

机译：如何在覆盖时间内在通用马尔可夫链中获取精确样本并从有向图中采样随机生成树
5. Model tree analysis with randomly generated and evolved trees. [D] . Sasamoto, Mark Makoto. 2010

机译：使用随机生成和演化的树进行模型树分析。
6. RECOVERING A TREE FROM THE LENGTHS OF SUBTREES SPANNED BY A RANDOMLY CHOSEN SEQUENCE OF LEAVES [O] . Steven N. Evans, Daniel Lanoue -1

机译：从由叶子的随机选择序列产生的子树的长度中恢复树
7. Generating Random Spanning Trees More Quickly than the Cover Time [O] . David Bruce Wilson 1996

机译：比覆盖时间更快地生成随机生成树

获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

客服微信
服务号