scholarly journals Gaussian Elimination, Perturbation Theory, and Markov Chains

Author(s):  
G. W. Stewart
1968 ◽  
Vol 5 (2) ◽  
pp. 401-413 ◽  
Author(s):  
Paul J. Schweitzer

A perturbation formalism is presented which shows how the stationary distribution and fundamental matrix of a Markov chain containing a single irreducible set of states change as the transition probabilities vary. Expressions are given for the partial derivatives of the stationary distribution and fundamental matrix with respect to the transition probabilities. Semi-group properties of the generators of transformations from one Markov chain to another are investigated. It is shown that a perturbation formalism exists in the multiple subchain case if and only if the change in the transition probabilities does not alter the number of, or intermix the various subchains. The formalism is presented when this condition is satisfied.


1968 ◽  
Vol 5 (02) ◽  
pp. 401-413 ◽  
Author(s):  
Paul J. Schweitzer

A perturbation formalism is presented which shows how the stationary distribution and fundamental matrix of a Markov chain containing a single irreducible set of states change as the transition probabilities vary. Expressions are given for the partial derivatives of the stationary distribution and fundamental matrix with respect to the transition probabilities. Semi-group properties of the generators of transformations from one Markov chain to another are investigated. It is shown that a perturbation formalism exists in the multiple subchain case if and only if the change in the transition probabilities does not alter the number of, or intermix the various subchains. The formalism is presented when this condition is satisfied.


2017 ◽  
Vol 256 ◽  
pp. 16-30 ◽  
Author(s):  
Lisa Hutschenreiter ◽  
Christel Baier ◽  
Joachim Klein

Author(s):  
Izabella V. Lokshina ◽  
Cees J. M. Lanting

Equilibria of queueing networks are a means for performance analysis of real communication networks introduced as Markov chains. In this paper, the authors developed, evaluated, and compared computational procedures to obtain numerical solutions for queueing networks in equilibrium with the use of direct, iterative, and aggregative techniques in steady-state analysis of Markov chains. Advanced computational procedures are developed with the use of Gaussian elimination, power iteration, Courtois' decomposition, and Takahashi's iteration techniques. Numerical examples are provided together with comparative analysis of obtained results. The authors consider these procedures are also applicable to other domains where systems are described with comparable queuing models and stochastic techniques are sufficiently relevant. Several suitable domains of applicability are proposed.


2013 ◽  
Vol 50 (01) ◽  
pp. 184-194 ◽  
Author(s):  
Déborah Ferré ◽  
Loïc Hervé ◽  
James Ledoux

In this paper, new conditions for the stability ofV-geometrically ergodic Markov chains are introduced. The results are based on an extension of the standard perturbation theory formulated by Keller and Liverani. The continuity and higher regularity properties are investigated. As an illustration, an asymptotic expansion of the invariant probability measure for an autoregressive model with independent and identically distributed noises (with a nonstandard probability density function) is obtained.


2020 ◽  
Vol 272 ◽  
pp. 104504
Author(s):  
Christel Baier ◽  
Christian Hensel ◽  
Lisa Hutschenreiter ◽  
Sebastian Junges ◽  
Joost-Pieter Katoen ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document