On the enumeration of leaf-labeled increasing trees with arbitrary node-degree
From MaRDI portal
Publication:6065318
DOI10.26493/2590-9770.1589.7e1arXiv2211.03632MaRDI QIDQ6065318
Publication date: 11 December 2023
Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.03632
Trees (05C05) Exact enumeration problems, generating functions (05A15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Counting dendrograms: A survey
- The impact of genetic diversity statistics on model selection between coalescents
- Stochastic models and descriptive statistics for phylogenetic trees, from Yule to today.
- Coalescents with multiple collisions
- Topological linkage disequilibrium calculated from coalescent genealogies
- Rate of coalescence of lineage pairs in the spatial \(\varLambda\)-Fleming-Viot process
- The evolving Moran genealogy
- Demographic inference under the coalescent in a spatial continuum
- Yule-generated trees constrained by node imbalance
- Beta-coalescents and continuous stable random trees
- Measuring the external branches of a Kingman tree: a discrete approach
- Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study
- On probability distributions of single-linkage dendrograms
- The latent roots of certain Markov chains arising in genetics: A new approach, II. Further haploid models
- Mixing Time for a Markov Chain on Cladograms
- The general coalescent with asynchronous mergers of ancestral lines
This page was built for publication: On the enumeration of leaf-labeled increasing trees with arbitrary node-degree
