A branching process approach to level‐k phylogenetic networks
From MaRDI portal
Publication:6052469
DOI10.1002/rsa.21065zbMath1523.60028arXiv2102.10329OpenAlexW3215141734MaRDI QIDQ6052469
Publication date: 17 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.10329
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Related Items
Counting phylogenetic networks with few reticulation vertices: a second approach ⋮ Exact-Size Sampling of Enriched Trees in Linear Time ⋮ A branching process with coalescence to model random phylogenetic networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scaling limits of random graphs from subcritical classes
- Invariance principles for Galton-Watson trees conditioned on the number of leaves
- The continuum random tree. I
- Une théorie combinatoire des séries formelles
- Schröder parenthesizations and chordates
- Random enriched trees with applications to random graphs
- Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees
- Rerooting multi-type branching trees: the infinite spine case
- Limits of random tree-like discrete structures
- Counting and enumerating tree-child networks and their subclasses
- Counting phylogenetic networks of level 1 and 2
- Trinets encode tree-child and level-2 phylogenetic networks
- Counting phylogenetic networks
- Scaling limits of Markov branching trees and Galton-Watson trees conditioned on the number of vertices with out-degree in a given set
- The continuum random tree. III
- Local limits of conditioned Galton-Watson trees: the infinite spine case
- The CRT is the scaling limit of random dissections
- Random Trees
- The Structure of Level-k Phylogenetic Networks
- Tessellations of random maps of arbitrary genus
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
- Graphon convergence of random cographs
