Asymptotic behaviour of random Markov chains with tridiagonal generators

From MaRDI portal
Publication:4909987

DOI10.1017/S0004972712000160zbMATH Open1268.34105arXiv1201.1999MaRDI QIDQ4909987FDOQ4909987


Authors: Victor Kozyakin, Peter E. Kloeden Edit this on Wikidata


Publication date: 22 March 2013

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Abstract: Continuous-time discrete-state random Markov chains generated by a random linear differential equation with a random tridiagonal matrix are shown to have a random attractor consisting of singleton subsets, essentially a random path, in the simplex of probability vectors. The proof uses comparison theorems for Carath'eodory random differential equations and the fact that the linear cocycle generated by the Markov chain is a uniformly contractive mapping of the positive cone into itself with respect to the the Hilbert projective metric. It does not involve probabilistic properties of the sample path and is thus equally valid in the nonautonomous deterministic context of Markov chains with, say, periodically varying transitions probabilities, in which case the attractor is a periodic path.


Full work available at URL: https://arxiv.org/abs/1201.1999




Recommendations




Cites Work


Cited In (2)





This page was built for publication: Asymptotic behaviour of random Markov chains with tridiagonal generators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909987)