Asymptotic behaviour of random Markov chains with tridiagonal generators

Details Asymptotic behaviour of random Markov chains with tridiagonal generators Asymptotic behaviour of random Markov chains with tridiagonal generators

2012-01-10

arxiv.org/abs/1201.1999v2

Mathematics

Dynamical Systems

11 pages, 15 bibliography references, added bibliography, minor changes

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Asymptotic behaviour of random Markov chains with tridiagonal generators does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymptotic behaviour of random Markov chains with tridiagonal generators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic behaviour of random Markov chains with tridiagonal generators will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-462379