Limit theorems and structural properties of the cat-and-mouse Markov chain and its generalisations
From MaRDI portal
Publication:5066876
Abstract: We revisit the so-called Cat-and-Mouse Markov chain, studied earlier by Litvak and Robert (2012). This is a 2-dimensional Markov chain on the lattice , where the first component (the cat) is a simple random walk and the second component (the mouse) changes when the components meet. We obtain new results for two generalisations of the model. Firstly, in the 2-dimensional case we consider far more general jump distributions for the components and obtain a scaling limit for the second component. When we let the first component be a simple random walk again, we further generalise the jump distribution of the second component. Secondly, we consider chains of three and more dimensions, where we investigate structural properties of the model and find a limiting law for the last component.
Recommendations
- A scaling analysis of a cat and mouse Markov chain
- Limit theorems for some Markov chains
- scientific article; zbMATH DE number 3854149
- scientific article; zbMATH DE number 844009
- Some limit theorems for non-homogeneous Markov chains
- scientific article; zbMATH DE number 3459642
- A generalization of a result concerning the asymptotic behavior of finite Markov chains
- Limit theorems for Markov chains of finite rank
- scientific article; zbMATH DE number 151644
- scientific article; zbMATH DE number 3883365
Cites work
- scientific article; zbMATH DE number 3113849 (Why is no real title available?)
- scientific article; zbMATH DE number 1454690 (Why is no real title available?)
- scientific article; zbMATH DE number 4000257 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- scientific article; zbMATH DE number 3194856 (Why is no real title available?)
- A scaling analysis of a cat and mouse Markov chain
- An analog of Wald's identity for random walks with infinite mean
- An optimal on-line algorithm for metrical task system
- Analysis of Stochastic Online Bin Packing Processes
- Asymptotics of randomly stopped sums in the presence of heavy tails
- Competitive algorithms for server problems
- Discrete and continuous time modulated random walks with heavy-tailed increments
- Fractional governing equations for coupled random walks
- Lagging and leading coupled continuous time random walks, renewal times and their joint limits
- Large claims approximations for risk processes in a Markovian environment
- Limit theorems for Lévy processes and Poisson point processes and their applications to Brownian excursions
- Limit theorems for continuous-time random walks with infinite mean waiting times
- Limit theorems for coupled continuous time random walks.
- Non-homogeneous random walks on a semi-infinite strip
- On the probability of ruin in a Markov-modulated risk model
- One dimensional lattice random walks with absorption at a point/on a half line
- Random walks on weighted graphs and applications to on-line algorithms
- Randomized scheduling algorithm for queueing networks
- Searching in the plane
- Stability of a Markov-modulated Markov chain, with application to a wireless network governed by two protocols
- Stability of parallel queueing systems with coupled service rates
- Stochastic bandwidth packing process: stability conditions via Lyapunov function technique
- Stochastic stability of monotone economies in regenerative environments
- Stochastic-Process Limits
- Subexponential asymptotics of a Markov-modulated random walk with queueing applications
- The extremal behaviour over regenerative cycles for Markov additive processes with heavy tails
- The first hitting time of a single point for random walks
This page was built for publication: Limit theorems and structural properties of the cat-and-mouse Markov chain and its generalisations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5066876)