scientific article; zbMATH DE number 19232
From MaRDI portal
Publication:3976664
The author's intention is to simplify, unify, and extend the work of \textit{R. E. Funderlic} and \textit{C. D. Meyer jun.} [Linear Algebra Appl. 76, 1--17 (1986; Zbl 0583.60064)] and \textit{J. J. Hunter} [ibid. 82, 201--214 (1986; Zbl 0608.60062)]. He is able to do so by beginning with results already presented in the paper on perturbation of \textit{P. J. Schweitzer} [J. Appl. Probab. 5, 401--413 (1968; Zbl 0196.19803)]. [For the entire collection see Zbl 0733.00019.]
Recommendations
Cited in
(24)- Markov chain sensitivity measured by mean first passage times
- Perturbation bounds for Markov chains with general state space
- Off-policy temporal difference learning with distribution adaptation in fast mixing chains
- Sensitivity of finite Markov chains under perturbation
- New perturbation bounds for denumerable Markov chains
- Stationary distribution and perturbation bounds for a stochastic inventory model
- Generalized inverses of Markovian kernels in terms of properties of the Markov chain
- Strong stability and perturbation bounds for discrete Markov chains
- Mixing times with applications to perturbed Markov chains
- Stationary distributions and mean first passage times of perturbed Markov chains
- Asymptotic expansions for stationary distributions of perturbed semi-Markov processes
- The computation of key properties of Markov chains via perturbations
- scientific article; zbMATH DE number 7446610 (Why is no real title available?)
- Pseudometrics for State Aggregation in Average Reward Markov Decision Processes
- A structured condition number for Kemeny's constant
- Sharp entrywise perturbation bounds for Markov chains
- On the stability of the computation of the stationary probabilities of Markov chains using Perron complements
- Concentration of Contractive Stochastic Approximation and Reinforcement Learning
- Comparison of perturbation bounds for the stationary distribution of a Markov chain
- Perturbation and Inverse Problems of Stochastic Matrices
- Dynamic normal forms and dynamic characteristic polynomial
- Conditioning of the entries in the stationary vector of a Google-type matrix
- Transition matrices for well-conditioned Markov chains
- On optimal condition numbers for Markov chains
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3976664)
