Infinitely divisible nonnegative matrices, \(M\)-matrices, and the embedding problem for finite state stationary Markov chains

DOI10.1016/j.laa.2017.11.018zbMath1380.15032arXiv1709.09561OpenAlexW2964331008MaRDI QIDQ1690682

Alexander Van-Brunt

Publication date: 12 January 2018

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.09561

zbMATH Keywords

Markov chains\(M\)-matrixembedding problemnonnegative matrixstochastic matricesmatrix roots

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Positive matrices and their generalizations; cones of matrices (15B48) Stochastic matrices (15B51)

Related Items (5)

Embeddability of real and positive operators ⋮ Roots of completely positive maps ⋮ Matrix roots in the max-plus algebra ⋮ Embeddability and rate identifiability of Kimura 2-parameter matrices ⋮ Diffusion and consensus on weakly connected directed graphs

Uses Software

• mftoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding Generators for Markov Chains via Empirical Transition Matrices, with Applications to Credit Ratings
• On \(p\)th roots of stochastic matrices
• Inverse \(M\)-matrices. II
• Embeddable Markov matrices
• Inverse M-matrices
• M-matrix characterizations. I: nonsingular M-matrices
• Analytic functions ofM-matrices and generalizations
• Dense Sets of Diagonalizable Matrices
• Functions of Matrices
• The Theory of Infinitely Divisible Matrices and Kernels
• The imbedding problem for finite Markov chains

This page was built for publication: Infinitely divisible nonnegative matrices, \(M\)-matrices, and the embedding problem for finite state stationary Markov chains