Limit theorems for patterns in ranked tree‐child networks

DOI10.1002/rsa.21177zbMath1527.60011arXiv2204.07676WikidataQ122613720 ScholiaQ122613720MaRDI QIDQ6144574

Tsan-Cheng Yu, Hexuan Liu, Michael Fuchs

Publication date: 5 January 2024

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.07676

zbMATH Keywords

method of momentspatternphylogenetic networktree-child networklimit lawranked tree-child network

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• Unnamed Item
• On joint subtree distributions under two evolutionary models
• Distributions of cherries for two models of trees
• Exact enumeration of cherries and pitchforks in ranked trees under the coalescent model
• On cherry and pitchfork distributions of random rooted and unrooted phylogenetic trees
• Asymptotic enumeration and distributional properties of galled networks
• Counting and enumerating galled networks
• Counting and enumerating tree-child networks and their subclasses
• On the asymptotic growth of the number of tree-child networks
• On asymptotic joint distributions of cherries and pitchforks for random phylogenetic trees
• Limit theorems for patterns in phylogenetic trees
• Counting phylogenetic networks
• The mean and variance of the numbers of \(r\)-pronged nodes and \(r\)-caterpillars in Yule-generated genealogical trees
• Limit laws for functions of fringe trees for binary search trees and random recursive trees
• Combinatorial and stochastic properties of ranked tree‐child networks
• Distributions of cherries and pitchforks for the Ford model

This page was built for publication: Limit theorems for patterns in ranked tree‐child networks