The embedding problem for Markov matrices
Visualitza/Obre
Cita com:
hdl:2117/384822
Tipus de documentArticle
Data publicació2023-01-01
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 4.0 Internacional
Abstract
Characterizing whether a Markov process of discrete random variables has a homogeneous continuous-time realization is a hard problem. In practice, this problem reduces to deciding when a given Markov matrix can be written as the exponential of some rate matrix (a Markov generator). This is an old question known in the literature as the embedding problem [11], which has been solved only for matrices of size 2 × 2 or 3 × 3. In this paper, we address this problem and related questions and obtain results along two different lines. First, for matrices of any size, we give a bound on the number of Markov generators in terms of the spectrum of the Markov matrix. Based on this, we establish a criterion for deciding whether a generic (distinct eigenvalues) Markov matrix is embeddable and propose an algorithm that lists all its Markov generators. Then, motivated and inspired by recent results on substitution models of DNA, we focus on the 4 × 4 case and completely solve the embedding problem for any Markov matrix. The solution in this case is more concise as the embeddability is given in terms of a single condition.
CitacióCasanellas, M.; Fernández-Sánchez, J.; Roca, J. The embedding problem for Markov matrices. "Publicacions matematiques", 1 Gener 2023, vol. 67, núm. 1, p. 411-445.
ISSN0214-1493
Versió de l'editorhttps://mat.uab.cat/pubmat/articles/view_doi/10.5565/PUBLMAT6712308
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
6712308.pdf | 552,0Kb | Visualitza/Obre |