EEMCS EPrints Service
Litvak, N. and Robert, P. (2009) A scaling analysis of a cat and mouse Markov chain. Memorandum 1899, Department of Applied Mathematics, University of Twente, Enschede. ISSN 1874-4850
Full text available as:
Official URL: http://www.math.utwente.nl/publications
Motivated by an original on-line page-ranking algorithm, starting from an arbitrary Markov chain on a discrete state space , a Markov chain on the product space , 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 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 and , reflected simple random walk in 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.
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item