scholarly journals Simulation of transient performance measures for stiff markov chains

2000 ◽  
Vol 34 (4) ◽  
pp. 385-396
Author(s):  
Abdelaziz Nasroallah
1992 ◽  
Vol 38 (3) ◽  
pp. 388-399 ◽  
Author(s):  
Mohamed A. Ahmed ◽  
Donald Gross ◽  
Douglas R. Miller

OR Spectrum ◽  
1995 ◽  
Vol 17 (1) ◽  
pp. 19-22 ◽  
Author(s):  
M. C. T. van de Coevering

1998 ◽  
Vol 30 (3) ◽  
pp. 676-692 ◽  
Author(s):  
Xi-Ren Cao

We derive formulas for the first- and higher-order derivatives of the steady state performance measures for changes in transition matrices of irreducible and aperiodic Markov chains. Using these formulas, we obtain a Maclaurin series for the performance measures of such Markov chains. The convergence range of the Maclaurin series can be determined. We show that the derivatives and the coefficients of the Maclaurin series can be easily estimated by analysing a single sample path of the Markov chain. Algorithms for estimating these quantities are provided. Markov chains consisting of transient states and multiple chains are also studied. The results can be easily extended to Markov processes. The derivation of the results is closely related to some fundamental concepts, such as group inverse, potentials, and realization factors in perturbation analysis. Simulation results are provided to illustrate the accuracy of the single sample path based estimation. Possible applications to engineering problems are discussed.


2015 ◽  
Vol 52 (3) ◽  
pp. 609-621 ◽  
Author(s):  
Hendrik Baumann ◽  
Werner Sandmann

We consider long-run averages of additive functionals on infinite discrete-state Markov chains, either continuous or discrete in time. Special cases include long-run average costs or rewards, stationary moments of the components of ergodic multi-dimensional Markov chains, queueing network performance measures, and many others. By exploiting Foster-Lyapunov-type criteria involving drift conditions for the finiteness of long-run averages we determine suitable finite subsets of the state space such that the truncation error is bounded. Illustrative examples demonstrate the application of this method.


1999 ◽  
Vol 13 (2) ◽  
pp. 147-167 ◽  
Author(s):  
Eugene W. Wong ◽  
Peter W. Glynn ◽  
Donald L. Iglehart

In this paper we consider the use of coupling ideas in efficiently computing a certain class of transient performance measures. Specifically, we consider the setting in which the stationary distribution is unknown, and for which no exact means of generating stationary versions of the process is known. In this context, we can approximate the stationary distribution from empirical data obtained from a first-stage steady-state simulation. This empirical approximation is then used in place of the stationary distribution in implementing our coupling-based estimator. In addition to the empirically based coupling estimator itself, we also develop an associated confidence interval procedure.


2015 ◽  
Vol 52 (03) ◽  
pp. 609-621 ◽  
Author(s):  
Hendrik Baumann ◽  
Werner Sandmann

We consider long-run averages of additive functionals on infinite discrete-state Markov chains, either continuous or discrete in time. Special cases include long-run average costs or rewards, stationary moments of the components of ergodic multi-dimensional Markov chains, queueing network performance measures, and many others. By exploiting Foster-Lyapunov-type criteria involving drift conditions for the finiteness of long-run averages we determine suitable finite subsets of the state space such that the truncation error is bounded. Illustrative examples demonstrate the application of this method.


1998 ◽  
Vol 30 (03) ◽  
pp. 676-692 ◽  
Author(s):  
Xi-Ren Cao

We derive formulas for the first- and higher-order derivatives of the steady state performance measures for changes in transition matrices of irreducible and aperiodic Markov chains. Using these formulas, we obtain a Maclaurin series for the performance measures of such Markov chains. The convergence range of the Maclaurin series can be determined. We show that the derivatives and the coefficients of the Maclaurin series can be easily estimated by analysing a single sample path of the Markov chain. Algorithms for estimating these quantities are provided. Markov chains consisting of transient states and multiple chains are also studied. The results can be easily extended to Markov processes. The derivation of the results is closely related to some fundamental concepts, such as group inverse, potentials, and realization factors in perturbation analysis. Simulation results are provided to illustrate the accuracy of the single sample path based estimation. Possible applications to engineering problems are discussed.


Sign in / Sign up

Export Citation Format

Share Document