Embedding of Markov matrices for \(d \leqslant 4\)
type: Item
instance of: scholarly article
title: Embedding of Markov matrices for \(d \leqslant 4\)
author: Michael Baake
author: Jeremy G. Sumner
published in: Journal of Mathematical Biology
publication date: 2024-08-06T00:00:00Z
review text: The classical embedding problem consists of finding a generator matrix \(Q\) (the infinitesimal operator of a continuous-time Markov chain) such that \(e^Q=M\), where \(M\) is a given Markov or stochastic matrix, representing the transition probabilities of a discrete-time Markov chain. In this paper, the authors address the case where the matrices are \(4\times4, (d=4)\) and provide a complete and simplified analysis of the case \(d = 3\). Additionally, they revisit the formulation of the embedding problem for time-inhomogeneous Markov chains.
Mathematics Subject Classification ID: 60J10
Mathematics Subject Classification ID: 60J27
Mathematics Subject Classification ID: 92D10
zbMATH DE Number: 7893158
zbMATH Keywords: Markov matrices and generators
zbMATH Keywords: embedding problem
zbMATH Keywords: phylogenetics
MaRDI profile type: MaRDI publication profile
cites work: Ordinary differential equations. An introduction to nonlinear analysis. Transl. from the German by Gerhard Metzen
cites work: Haldane linearisation done right: solving the nonlinear recombination equation the easy way
cites work: The Peano-Baker series
cites work: Notes on Markov embedding
cites work: On equal-input and monotone Markov matrices
cites work: Characterizations of embeddable \(3 \times 3\) stochastic matrices with a negative eigenvalue
cites work: Embeddability of Kimura 3ST Markov matrices
cites work: Embeddability and rate identifiability of Kimura 2-parameter matrices
cites work: An open set of 4×4 embeddable matrices whose principal logarithm is not a Markov generator
cites work: The embedding problem for Markov matrices
cites work: Uniformization Stable Markov Models and Their Jordan Algebraic Structure
cites work: On the Existence and Uniqueness of the Real Logarithm of a Matrix
cites work: On Uniqueness of the Logarithm for Markov Semi-Groups
cites work: The Logarithm Function for Finite-State Markov Semi-Groups
cites work: Embeddable Markov matrices
cites work: Q5768818
cites work: The embedding problem for Markov chains with three states
cites work: A structure of the Bang-Bang representation for 3�3 embeddable matrices
cites work: On a number of Poisson matrices in bang-bang representations for 3x3 embeddable matrices
cites work: Total positivity and the embedding problem for Markov chains
cites work: An intrinsic time for non-stationary finite markov chains
cites work: Functions of Matrices
cites work: Q3244654
cites work: Q4902474
cites work: The Bang-Bang problem for stochastic matrices
cites work: Some Results on the Imbedding Problem for Finite Markov Chains
cites work: A Bang-Bang representation for 3�3 embeddable stochastic matrices
cites work: Estimation of evolutionary distances between homologous nucleotide sequences.
cites work: The imbedding problem for finite Markov chains
cites work: Q4695311
cites work: Q4340096
cites work: Two Markov chains with a common skeleton
cites work: Phylogeny. Discrete and random processes in evolution
cites work: Q3838091
DOI: 10.1007/S00285-024-02112-W
description: scientific article; zbMATH DE number 7893158