A Markov embedding of ranked unlabelled trees reduces state space, enabling efficient Fréchet means, arbitrary-order F-matrix moments via phase-type theory, and improved neutrality tests under coalescent models.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Markov embedding of ranked unlabelled evolutionary trees and its applications
A Markov embedding of ranked unlabelled trees reduces state space, enabling efficient Fréchet means, arbitrary-order F-matrix moments via phase-type theory, and improved neutrality tests under coalescent models.