The embedding problem for Markov matrices
From MaRDI portal
Publication:2687300
DOI10.5565/PUBLMAT6712308MaRDI QIDQ2687300
Jordi Roca-Lacostena, Jesús Fernández-Sánchez, Marta Casanellas
Publication date: 2 March 2023
Published in: Publicacions Matemàtiques (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.00818
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Continuous-time Markov processes on discrete state spaces (60J27) Stochastic matrices (15B51) Matrix exponential and similar functions of matrices (15A16)
Related Items
Embeddability of real and positive operators, An open set of 4×4 embeddable matrices whose principal logarithm is not a Markov generator, Markov evolution algebras, Designing weights for quartet-based methods when data are heterogeneous across lineages, Embeddability of centrosymmetric matrices capturing the double-helix structure in natural and synthetic DNA
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding Generators for Markov Chains via Empirical Transition Matrices, with Applications to Credit Ratings
- A solution to the reversible embedding problem for finite Markov chains
- On the imbedding problem for stochastic and doubly stochastic matrices
- Full reconstruction of Markov models on evolutionary trees: identifiability and consistency.
- Characterizations of embeddable \(3 \times 3\) stochastic matrices with a negative eigenvalue
- Embeddability of Kimura 3ST Markov matrices
- Embeddability and rate identifiability of Kimura 2-parameter matrices
- Notes on Markov embedding
- Phylogeny
- Mobility Indices in Continuous Time Markov Chains
- Asynchronous Distance between Homologous DNA Sequences
- The Logarithm Function for Finite-State Markov Semi-Groups
- Some Results on the Imbedding Problem for Finite Markov Chains
- On equal-input and monotone Markov matrices
- Sufficient embedding conditions for three-state discrete-time Markov chains with real eigenvalues
- On the Embedding Problem for Discrete-Time Markov Chains
- Functions of Matrices
- On the Existence and Uniqueness of the Real Logarithm of a Matrix
- Two Markov chains with a common skeleton
- On Uniqueness of the Logarithm for Markov Semi-Groups
- The imbedding problem for finite Markov chains
- An open set of 4×4 embeddable matrices whose principal logarithm is not a Markov generator
