An adjacent-swap Markov chain on coalescent trees
From MaRDI portal
Publication:5049907
DOI10.1017/jpr.2022.15zbMath1501.60038arXiv2012.08030WikidataQ114118001 ScholiaQ114118001MaRDI QIDQ5049907
Julia A. Palacios, Mackenzie Simper
Publication date: 14 November 2022
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.08030
62F15: Bayesian inference
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
60J90: Coalescent processes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
- On the total external length of the Kingman coalescent
- Limitations of Markov chain Monte Carlo algorithms for Bayesian inference of phylogeny
- The coalescent
- Alternating permutations and binary increasing trees
- Shuffling chromosomes
- Mixing times of lozenge tiling and card shuffling Markov chains
- Random walks on trees and matchings
- Sequential importance sampling for multiresolution Kingman-Tajima coalescent counting
- Finding the best resolution for the Kingman-Tajima coalescent: theory and applications
- A note on the relaxation time of two Markov chains on rooted phylogenetic tree spaces
- Random doubly stochastic tridiagonal matrices
- Fast Convergence of Markov Chain Monte Carlo Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species
- Matchings and phylogenetic trees
- Mixing Time for a Markov Chain on Cladograms
- Increasing trees and alternating permutations