A Scaling Analysis of a Cat and Mouse Markov Chain

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

If C_n) a Markov chain on a discrete state space S, a Markov chain (C_n,M_n) on the product space SxS, the cat and mouse Markov chain, is constructed. The first coordinate of this Markov chain behaves like the original Markov chain and the second component changes only when both coordinates are equal. The asymptotic properties of this Markov chain are investigated. A representation of its invariant measure is in particular obtained. When the state space is infinite it is shown that this Markov chain is in fact null recurrent if the initial Markov chain $(C_n)$ is positive recurrent and reversible. In this context, the scaling properties of the location of the second component, the mouse, are investigated in various situations: simple random walks in Z and Z^2, reflected simple random walk in N and also in a continuous time setting. For several of these processes, a time scaling with rapid growth gives an interesting asymptotic behavior related to limit results for occupation times and rare events of Markov processes.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Scaling Analysis of a Cat and Mouse Markov Chain 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 A Scaling Analysis of a Cat and Mouse Markov Chain, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Scaling Analysis of a Cat and Mouse Markov Chain will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-399887

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.