Journal
JOURNAL OF MATHEMATICAL BIOLOGY
Volume 56, Issue 3, Pages 391-412Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s00285-007-0120-8
Keywords
counting processes; continuous-time Markov chains; evolution; phylogenetics
Categories
Ask authors/readers for more resources
Counting processes that keep track of labeled changes to discrete evolutionary traits play critical roles in evolutionary hypothesis testing. If we assume that trait evolution can be described by a continuous-time Markov chain, then it suffices to study the process that counts labeled transitions of the chain. For a binary trait, we demonstrate that it is possible to obtain closed-form analytic solutions for the probability mass and probability generating functions of this evolutionary counting process. In the general, multi-state case we show how to compute moments of the counting process using an eigen decomposition of the infinitesimal generator, provided the latter is a diagonalizable matrix. We conclude with two examples that demonstrate the utility of our results.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available