- 1、本文档共12页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
an strongostrong(n2) bound for the relaxation time of a markov chain on
2
An O(n ) Bound for the Relaxation Time
of a Markov Chain on Cladograms
Jason Schweinsberg
University of California, Berkeley, California; email: jasonsc h@
Received 9 March 2000; revised 9 May 2001; accepted 24 July 2001
ABSTRACT: A cladogram is an unrooted tree with labeled leaves and unlabeled internal
branchpoints of degree 3. Aldous has studied a Markov chain on the set of n-leaf cladograms
in which each transition consists of removing a random leaf and its incident edge from the
tree and then reattaching the leaf to a random edge of the remaining tree. Using coupling
methods, Aldous showed that the relaxation time (i.e., the inverse of the spectral gap) for
this chain is On3 2
. Here, we use a method based on distinguished paths to prove an On
bound for the relaxation time, establishing a conjecture of Aldous. © 2001 John Wiley Sons,
Inc. Random Struct. Alg., 20, 59–70, 2001
´
Key Words: mixing times; cladograms; Markov chains; distinguished paths; Poincare inequalities;
continuum random tree
1. INTRODUCTION
An n-leaf cladogram is an unrooted tree with n leaves and internal branchpoints of
degree 3. The leaves are labeled, usually by the integers 1 n, but the internal
branchpoints are unlabled. We denote the set of n-leaf cladograms by Tn . Each
n-leaf cladogram contains 2n 3 edges. The cardinality of Tn , which we denote by
© 2001 John Wiley Sons, Inc.
DOI 10.1002/rsa.1029
59
60 SCHWEINSBERG
Fig. 1. A 7-leaf cladogram.
c , is given by
n
您可能关注的文档
- a satellite-based global landslide strongmodelstrong - nhess.pdf
- a simple randomized scheme for constructing low-weight strongkstrong.pdf
- a simple method for the characterization of oho-hydrogen bonds.pdf
- a signal processing approach to fair surface design.pdf
- a situated strongaccountstrong of teacher agency and learning critical.pdf
- a simple virtual organisation strongmodelstrong and practical.pdf
- a situation based method to adapt the vehicle restraint strongsystemstrong.pdf
- a software safety strongmodelstrong for safety critical applications.pdf
- a software toolkit for visualizing strongenterprisestrong routing design.pdf
- a simple strongmodelstrong for the reliability of an infrastructure strongsystemstrong.pdf
最近下载
- 贝壳A+PC房源操作手册.pptx
- 活塞式调流阀.docx VIP
- vProxy:当所有虚拟机都成功完成时,VMware 策略显示失败.docx VIP
- 小学“双减”作业设计:小学英语四年级下册“Unit3 Weather ”单元作业设计优秀案例.pdf
- 成品保护方案.doc
- 2023年安徽安庆高新区面向全国招聘人才工作(共500题含答案解析)笔试历年难、易错考点试题含答案附详解.docx VIP
- 加强党的纪律之建设.doc VIP
- 中科普达科研项目管理系统整体解决方案.pdf
- 国家开放大学电大本科《社会政策》2024期末试题及答案(试卷号:1306).pdf VIP
- 涉路施工安全培训教育.pptx
文档评论(0)