Infinitely divisible nonnegative matrices, M-matrices, and the embedding problem for finite state stationary Markov chains
From MaRDI portal
(Redirected from Publication:1690682)
Infinitely divisible nonnegative matrices, \(M\)-matrices, and the embedding problem for finite state stationary Markov chains
Infinitely divisible nonnegative matrices, \(M\)-matrices, and the embedding problem for finite state stationary Markov chains
Abstract: This paper explicitly details the relation between -matrices, nonnegative roots of nonnegative matrices, and the embedding problem for finite-state stationary Markov chains. The set of nonsingular nonnegative matrices with arbitrary nonnegative roots is shown to be the closure of the set of matrices with matrix roots in . The methods presented here employ nothing beyond basic matrix analysis, however it answers a question regarding -matrices posed over 30 years ago and as an application, a new characterization of the set of all embeddable stochastic matrices is obtained as a corollary.
Recommendations
- EMBEDDED MATRICES FOR FINITE MARKOV CHAINS
- The embedding problem for Markov matrices
- Stochastic and substochastic solutions for infinite-state Markov chains with applications to matrix-analytic methods
- scientific article; zbMATH DE number 3879852
- About limit matrices of finite-state Markov chains
- On finite Markov chain imbedding and its applications
- Non-negative matrices and Markov chains.
- Finite approximations of infinite nonnegative matrices and the convergence of equilibrium distributions
- scientific article; zbMATH DE number 3928033
- OnM-multisplittings of singularM-matrices with application to Markov chains
Cites work
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 635657 (Why is no real title available?)
- scientific article; zbMATH DE number 3184361 (Why is no real title available?)
- Analytic functions ofM-matrices and generalizations
- Dense Sets of Diagonalizable Matrices
- Embeddable Markov matrices
- Finding generators for Markov chains via empirical transition matrices, with applications to credit ratings
- Functions of Matrices
- Inverse M-matrices
- Inverse \(M\)-matrices. II
- M-matrix characterizations. I: nonsingular M-matrices
- On \(p\)th roots of stochastic matrices
- The Theory of Infinitely Divisible Matrices and Kernels
- The imbedding problem for finite Markov chains
Cited in
(7)- Diffusion and consensus on weakly connected directed graphs
- Matrix roots in the max-plus algebra
- Embeddability and rate identifiability of Kimura 2-parameter matrices
- Embeddability of real and positive operators
- OnM-multisplittings of singularM-matrices with application to Markov chains
- On equal-input and monotone Markov matrices
- Roots of completely positive maps
This page was built for publication: Infinitely divisible nonnegative matrices, \(M\)-matrices, and the embedding problem for finite state stationary Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1690682)