Computing the stationary distribution for infinite Markov chains
From MaRDI portal
Publication:1163856
DOI10.1016/0024-3795(80)90168-8zbMath0484.65086OpenAlexW1985586123MaRDI QIDQ1163856
Publication date: 1980
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(80)90168-8
Stochastic matrices (15B51) Markov processes (60J99) Probabilistic methods, stochastic differential equations (65C99) Statistical distribution theory (62E99)
Related Items (29)
Truncations of infinite matrices and algebraic series associated with some CF grammars ⋮ Hitting probabilities in a Markov additive process with linear movements and upward jumps: applications to risk and queueing processes. ⋮ Wavelet transform for quasi-birth-death process with a continuous phase set ⋮ Monotone infinite stochastic matrices and their augmented truncations ⋮ On the approximation of the stationary distribution of a monotone stochastic Markov chain ⋮ Solving certain queueing problems modelled by Toeplitz matrices ⋮ On truncations and perturbations of Markov decision problems with an application to queueing network overflow control ⋮ A monotonicity law for relative prices ⋮ Sensitivity to perturbation of the stationary distribution: Some refinements ⋮ Random walks on lattices with points of two colors. II: Some rigorous inequalities for symmetric random walks ⋮ Steady-state probabilities of the PH/PH/1 queue ⋮ Iterative aggregation: convergence rate ⋮ Weak stability bounds for approximations of invariant measures with applications to queueing ⋮ Response time of the queue with the dropping function ⋮ An O(n log n) algorithm for the generalized birthday problem ⋮ DES AND RES PROCESSES AND THEIR EXPLICIT SOLUTIONS ⋮ A weak perturbation theory for approximations of invariant measures in M/G/1 model ⋮ A note on connectedness of block designs ⋮ Stationary Distributions of Continuous-Time Markov Chains: A Review of Theory and Truncation-Based Approximations ⋮ Augmented truncation approximations to the solution of Poisson's equation for Markov chains ⋮ Markov-Entscheidungs-Prozesse mit abhängigen Aktionen für optimale Reparaturmaßnahmen bei unvollständiger Information. (Markov decision processes with dependent actions for optimal repair policies under incomplete information) ⋮ Augmented truncation approximations of discrete-time Markov chains ⋮ The effect of a non-uniform turning kernel on ant trail morphology ⋮ Some results characterizing the finite time behaviour of the simulated annealing algorithm. ⋮ Approximations to quasi-birth-and-death processes with infinite blocks ⋮ Error bounds for augmented truncation approximations of Markov chains via the perturbation method ⋮ The smallest eigenvalue for reversible Markov chains ⋮ Characterization of the conditional stationary distribution in Markov chains via systems of linear inequalities ⋮ Compactness of eigenvectors for certain families of non-negative matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ergodic properties of nonnegative matrices. I
- Computation of the stationary distribution of a markov chain
- Computation of the stationary distribution of an infinite stochastic matrix of special form
- Some Generalised Markov Chain Occupancy Processes and Their Application to Hospital Admission Systems
- Computation of the stationary distribution of an infinite Markov matrix
This page was built for publication: Computing the stationary distribution for infinite Markov chains
