Sensitivity of the stationary distribution vector for an ergodic Markov chain
From MaRDI portal
Publication:1069213
DOI10.1016/0024-3795(86)90210-7zbMath0583.60064OpenAlexW2005325188MaRDI QIDQ1069213
Carl D. jun. Meyer, Robert E. Funderlic
Publication date: 1986
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(86)90210-7
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items
Perturbation results for nearly uncoupled Markov chains with applications to iterative methods ⋮ Stationary distributions of perturbed Markov chains ⋮ An Arnoldi-type algorithm for computing Page Rank ⋮ Sensitivity to perturbation of the stationary distribution: Some refinements ⋮ Applications of Paz's inequality to perturbation bounds for Markov chains ⋮ Acute perturbation of the group inverse ⋮ Transition matrices for well-conditioned Markov chains ⋮ Sensitivity of Steady States in Networks with Application to Markov Chains and Chemical Reaction Networks ⋮ Sensitivity analysis of discrete Markov chains via matrix calculus ⋮ Asymptotic Expansions for Stationary Distributions of Perturbed Semi-Markov Processes ⋮ Unnamed Item ⋮ A direct projection method for Markov chains ⋮ Improved bounds for a condition number for Markov chains ⋮ Perturbation analysis of continuous‐time absorbing Markov chains ⋮ On Perturbation Bounds for the Joint Stationary Distribution of Multivariate Markov Chain Models ⋮ On optimal condition numbers for Markov chains ⋮ Strong stability and perturbation bounds for discrete Markov chains ⋮ A special stochastic decision problem ⋮ Blockwise perturbation theory for nearly uncoupled Markov chains and its application ⋮ New perturbation bounds for denumerable Markov chains ⋮ Comparison of perturbation bounds for the stationary distribution of a Markov chain ⋮ Sensitivity of finite Markov chains under perturbation ⋮ Influence of Preconditioning and Blocking on Accuracy in Solving Markovian Models ⋮ Stationary distribution and perturbation bounds for a stochastic inventory model ⋮ Generalized inverses of matrices: a perspective of the work of Penrose ⋮ Convergent Iterations for Computing Stationary Distributions of Markov Chains ⋮ Response and sensitivity using Markov chains ⋮ Markov chain sensitivity measured by mean first passage times ⋮ Regular Markov chains for which the transition matrix has large exponent ⋮ Cut-off Phenomenon for Converging Processes in the Sense of α-Divergence Measures ⋮ Stationary distributions and mean first passage times of perturbed Markov chains ⋮ Sharp Entrywise Perturbation Bounds for Markov Chains
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matrix Methods for Queuing Problems
- Comparison of Some Direct Methods for Computing Stationary Distributions of Markov Chains
- The Use of Positive Matrices for the Analysis of the Large Time Behavior of the Numerical Solution of Reaction-Diffusion Systems
- Using the QR Factorization and Group Inversion to Compute, Differentiate, and Estimate the Sensitivity of Stationary Probabilities for Markov Chains
- $LU$-Decompositions of Tridiagonal Irreducible H-Matrices
- Finite Continuous Time Markov Chains
- Solution of Homogeneous Systems of Linear Equations Arising from Compartmental Models
- The Condition of a Finite Markov Chain and Perturbation Bounds for the Limiting Probabilities
- Stability and monotonicity for interactive Markov chains
- The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains
- Perturbation theory and finite Markov chains
- The Mathematical Basis of the Interpretation of Tracer Experiments in Closed Steady-State Systems