Chapter 5. Coupling Method in Studying Stability of Time-Inhomogeneous Markov Chains

$39.50

Vitaliy Golomoziy
Taras Schevchenko National University of Kyiv, Kyiv, Ukraine

Part of the book: Stochastic Processes: Fundamentals and Emerging Applications

Chapter DOI: https://doi.org/10.52305/RXVO2856

Abstract

This chapter demonstrates how the coupling method can be adapted to study stability of time-inhomogeneous Markov chains. We consider two Markov chains (ꭓn(¹) )n≥0 and (Xn(²) )n≥o which are discrete-time, time-inhomogeneous, independent and having values in a general phase space. We show that, assuming some proximity of the transition kernels for the chains X(¹) and X(²), we can modify the standard coupling technique to establish the proximity of the n-step transition probabilities. We show how to obtain estimates for such proximity and calculate it explicitly under conditions similar to uniform ergodicity conditions for the homogeneous Markov chain.

Keywords: inhomogeneous Markov chain, coupling, renewal


References


[1] Doeblin W., Expose de la theorie des chaines simples constantes de Markov a un
nomber fini d’estats, Mathematique de l’Union Interbalkanique, vol. 2, pp. 77–105,
1938.
[2] Douc R., Moulines E., Priouret P. and Soulier P., Markov Chains, Springer, Cham, p.
757, 2018.
[3] Lindvall T., Lectures on the Coupling Method, Dover Publications, p. 288, 2002.
[4] Thorisson H., Coupling, Stationarity, and Regeneration, Springer, p. 517, 2000.
[5] Golomoziy V., Kartashov M. V. and Kartashov Yu. M., Impact of the stress factor
on the price of widow’s pensions. Proofs, Theory of Probability and Mathematical
Statistics, vol. 92, pp. 17-22, 2016. DOI:10.1090/tpms/979.
[6] Golomoziy V. and Kartashov M. V., Maximal coupling procedure and stability of
discrete Markov chains. I, Theory of Probability and Mathematical Statistics, vol. 86,
pp. 93-104, 2013. DOI:10.1090/S0094-9000-2013-00891-6.
[7] Golomoziy V. and Kartashov M. V., Maximal coupling procedure and stability of
discrete Markov chains. II, Theory of Probability and Mathematical Statistics, vol.
87, pp. 65-78, 2013. DOI:10.1090/S0094-9000-2014-00905-9.
[8] Golomoziy V. and Kartashov M. V., Maximal coupling and stability of discrete nonhomogeneous Markov chains, Theory of Probability and Mathematical Statistics, vol.
91, pp. 17-27, 2015. DOI:10.1090/S0094-9000-2015-00930-3.
[9] Golomoziy V. and Kartashov M. V., Maximal coupling and V -stability of discrete
nonhomogeneous markov chains, Theory of Probability and Mathematical Statistics,
vol. 93, pp. 19-31, 2016. DOI:10.1090/tpms/992.
[10] Golomoziy V., Estimates of stability of transition probabilities for non-homogeneous
markov chains in the case of the uniform minorization, Theory of Probability and
Mathematical Statistics, vol. 101, pp. 85-101, 2020. DOI:10.1090/tpms/1113.
[11] Golomoziy V., An estimate of the stability for nonhomogeneous Markov chains under
classical minorization condition, Theory of Probability and Mathematical Statistics,
vol. 88, pp. 35-49, 2014. DOI:10.1090/S0094-9000-2014-00917-5.
[12] Golomoziy V. and Kartashov M. V., On the integrability of the coupling moment for
time-inhomogeneous Markov chains, Theory of Probability and Mathematical Statistics, vol. 89, pp. 1-12, 2014. DOI:10.1090/S0094-9000-2015-00930-3.
[13] Golomoziy V., On estimation of expectation of simultaneous renewal time of timeinhomogeneous Markov chains using dominating sequence, Modern Stochastics: Theory and Applications, vol. 6, no. 3, pp. 333-343, 2019. DOI:10.15559/19-VMSTA138.
[14] Golomoziy V., An estimate of the expectation of the excess of a renewal sequence
generated by a time-inhomogeneous markov chain if a square-integrable majorizing
sequence exists, Theory of Probability and Mathematical Statistics, vol. 94, pp. 53-62,
2017. DOI:10.1090/tpms/1008.
[15] Golomoziy V., An inequality for the coupling moment in the case of two inhomogeneous markov chains, Theory of Probability and Mathematical Statistics, vol. 90, pp.
43-56, 2015. DOI:10.1090/tpms/948

Category:

Publish with Nova Science Publishers

We publish over 800 titles annually by leading researchers from around the world. Submit a Book Proposal Now!