Skip to main content
×
Home
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 13
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Anderson, D. Blom, J. Mandjes, M. Thorsdottir, H. and de Turck, K. 2016. A Functional Central Limit Theorem for a Markov-Modulated Infinite-Server Queue. Methodology and Computing in Applied Probability, Vol. 18, Issue. 1, p. 153.


    Braunsteins, Peter Hautphenne, Sophie and Taylor, Peter G. 2016. The roles of coupling and the deviation matrix in determining the value of capacity in M/M/1/C queues. Queueing Systems, Vol. 83, Issue. 1-2, p. 157.


    Jansen, H. M. Mandjes, M. R. H. De Turck, K. and Wittevrongel, S. 2016. A large deviations principle for infinite-server queues in a random environment. Queueing Systems, Vol. 82, Issue. 1-2, p. 199.


    Mandal, Dibyendu and Jarzynski, Christopher 2016. Analysis of slow transitions between nonequilibrium steady states. Journal of Statistical Mechanics: Theory and Experiment, Vol. 2016, Issue. 6, p. 063204.


    Hautphenne, Sophie Kerner, Yoav Nazarathy, Yoni and Taylor, Peter 2015. The intercept term of the asymptotic variance curve for some queueing output processes. European Journal of Operational Research, Vol. 242, Issue. 2, p. 455.


    Liu, YuanYuan 2015. Perturbation analysis for continuous-time Markov chains. Science China Mathematics, Vol. 58, Issue. 12, p. 2633.


    Blom, J. Kella, O. Mandjes, M. and Thorsdottir, H. 2014. Markov-modulated infinite-server queues with general service times. Queueing Systems, Vol. 76, Issue. 4, p. 403.


    Hamoudi, Zina Aïssani, Djamil and Heidergott, Bernd 2014. Non-Parametric Sensitivity Analysis of the Finite M/M/1 Queue. IFAC Proceedings Volumes, Vol. 47, Issue. 2, p. 498.


    Liu, Yuanyuan Wang, Pengfei and Xie, Yanmin 2014. Deviation matrix and asymptotic variance for GI/M/1-type Markov chains. Frontiers of Mathematics in China, Vol. 9, Issue. 4, p. 863.


    Dendievel, Sarah Latouche, Guy and Liu, Yuanyuan 2013. Poisson’s equation for discrete-time quasi-birth-and-death processes. Performance Evaluation, Vol. 70, Issue. 9, p. 564.


    Vanderbruggen, T. and Mitchell, M. W. 2013. Near-resonant optical forces beyond the two-level approximation for a continuous source of spin-polarized cold atoms. Physical Review A, Vol. 87, Issue. 3,


    Liu, Yuanyuan 2012. Perturbation Bounds for the Stationary Distributions of Markov Chains. SIAM Journal on Matrix Analysis and Applications, Vol. 33, Issue. 4, p. 1057.


    Prieto-Rumeau, Tomás and Hernández-Lerma, Onésimo 2006. Bias Optimality for Continuous-Time Controlled Markov Chains. SIAM Journal on Control and Optimization, Vol. 45, Issue. 1, p. 51.


    ×
  • Probability in the Engineering and Informational Sciences, Volume 16, Issue 3
  • July 2002, pp. 351-366

THE DEVIATION MATRIX OF A CONTINUOUS-TIME MARKOV CHAIN

  • Pauline Coolen-Schrijner (a1) and Erik A. van Doorn (a2)
  • DOI: http://dx.doi.org/10.1017/S0269964802163066
  • Published online: 01 July 2002
Abstract

The deviation matrix of an ergodic, continuous-time Markov chain with transition probability matrix P(·) and ergodic matrix Π is the matrix D ≡ ∫0(P(t) − Π) dt. We give conditions for D to exist and discuss properties and a representation of D. The deviation matrix of a birth–death process is investigated in detail. We also describe a new application of deviation matrices by showing that a measure for the convergence to stationarity of a stochastically increasing Markov chain can be expressed in terms of the elements of the deviation matrix of the chain.

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Probability in the Engineering and Informational Sciences
  • ISSN: 0269-9648
  • EISSN: 1469-8951
  • URL: /core/journals/probability-in-the-engineering-and-informational-sciences
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×