On the embedding problem for discrete-time Markov chains
From MaRDI portal
Publication:5407017
Recommendations
- Some results on the embeddable problem for discrete-time Markov models in manpower planning
- Sufficient embedding conditions for three-state discrete-time Markov chains with real eigenvalues
- The embedding problem for Markov matrices
- Necessary embedding conditions for state-wise monotone Markov chains
- A solution to the reversible embedding problem for finite Markov chains
Cites work
- scientific article; zbMATH DE number 193132 (Why is no real title available?)
- Algorithms and applications for approximate nonnegative matrix factorization
- Hidden heterogeneity in manpower systems: a Markov-switching model approach
- Inference in hidden Markov models.
- Modelling heterogeneity in a manpower system: a review
- Nonlinear Programming
Cited in
(19)- The embedding problem for Markov matrices
- Embeddability and rate identifiability of Kimura 2-parameter matrices
- EMBEDDED MATRICES FOR FINITE MARKOV CHAINS
- The square root law in the embedding detection problem for Markov chains with unknown matrix of transition probabilities
- On \(p\)th roots of stochastic matrices
- A solution to the reversible embedding problem for finite Markov chains
- On the use of Cauchy integral formula for the embedding problem of discrete-time Markov chains
- On the imbedding problem for three-state time homogeneous Markov chains with coinciding negative eigenvalues
- Detection of embeddings in binary Markov chains
- Embeddability of real and positive operators
- On the imbedding problem for stochastic and doubly stochastic matrices
- Finding generators for Markov chains via empirical transition matrices, with applications to credit ratings
- On monotonically proceeding structures and stepwise increasing transition matrices of Markov chains
- scientific article; zbMATH DE number 1537559 (Why is no real title available?)
- Some results on the embeddable problem for discrete-time Markov models in manpower planning
- On the positive semi-definite pth roots of positive semi-definite doubly stochastic matrices
- Matrix roots and embedding conditions for three-state discrete-time Markov chains with complex eigenvalues
- On perturbations of non-diagonalizable stochastic matrices of order 3
- Necessary embedding conditions for state-wise monotone Markov chains
This page was built for publication: On the embedding problem for discrete-time Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5407017)