具有r分叉的最可能概率树拓扑
Maximally probable tree topologies with $r$-furcation
AI总结:
本文通过霍夫曼树与信息论的联系,识别出最可能的r分叉树拓扑,并扩展了双叉树的最可能拓扑结果。
摘要:
对于特定的根标记树拓扑,一个标记历史是产生该标记拓扑的一系列分支事件序列。在这里,对于r分叉树,我们利用与信息论中霍夫曼树的联系,识别出最可能的根树——未标记的r分叉拓扑,其每个标记都具有比其他标记拓扑更多的标记历史数量。我们对唯一最可能的r分叉未标记拓扑的特征化扩展了Harding-Hammersley-Grimmett的结果,该结果确定了最可能的双叉未标记拓扑,并为该结果提供了新的证明。我们提出一个猜想,即如果允许在树的多个内部节点上同时发生分支事件,则最可能的r分叉未标记拓扑。
英文摘要:
For a specific rooted labeled tree topology, a labeled history is a sequence of branchings that give rise to that labeled topology as it unfolds over time. Here, for $r$-furcating trees, we use a connection with Huffman trees from information theory to identify maximally probable rooted trees -- unlabeled $r$-furcating topologies whose labelings each have a number of labeled histories greater than or equal to those of all other labeled topologies. Our characterization of the unique maximally probable $r$-furcating unlabeled topology generalizes the Harding--Hammersley--Grimmett result identifying the maximally probable bifurcating unlabeled topology, and it provides a new proof for that result. We present a conjecture for the maximally probable $r$-furcating unlabeled topology if labeled histories are tabulated allowing for simultaneous branching events across multiple internal nodes of a tree.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。