A scaling analysis of a cat and mouse Markov chain

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Functional limit theorems; invariance principles (60F17) Communication networks in operations research (90B18)

Abstract: If

(C_{n})

is a Markov chain on a discrete state space

m a t h c a l S

, a Markov chain

(C_{n}, M_{n})

on the product space

m a t h c a l S i m e s m a t h c a l S

, 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

m a t h b b Z

and

{m a t h b b Z}^{2}

reflected a simple random walk in

m a t h b b 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 limiting results for occupation times and rare events of Markov processes.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: A scaling analysis of a cat and mouse Markov chain

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