Limit theorems and structural properties of the cat-and-mouse Markov chain and its generalisations

DOI10.1017/APR.2021.23zbMATH Open1486.60090arXiv1807.04504OpenAlexW4214771594WikidataQ113858385 ScholiaQ113858385MaRDI QIDQ5066876FDOQ5066876

Authors: Timofeĭ Vycheslavovich Prasolov, Sergey Foss, V. Shneer 

Publication date: 31 March 2022

Published in: Advances in Applied Probability (Search for Journal in Brave)

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 $mathbb{Z}^2$, 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.

Full work available at URL: https://arxiv.org/abs/1807.04504

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

zbMATH Keywords

weak convergenceregular variationcompound renewal processrandomly stopped sumsmultidimensional Markov chaincat-and-mouse games

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Communication networks in operations research (90B18)

Cites Work

• Title not available (Why is that?)
• Stability of parallel queueing systems with coupled service rates
• Title not available (Why is that?)
• Stochastic-Process Limits
• Searching in the plane
• Title not available (Why is that?)
• Limit theorems for continuous-time random walks with infinite mean waiting times
• Random walks on weighted graphs and applications to on-line algorithms
• Title not available (Why is that?)
• Competitive algorithms for server problems
• An optimal on-line algorithm for metrical task system
• Discrete and continuous time modulated random walks with heavy-tailed increments
• On the probability of ruin in a Markov-modulated risk model
• Randomized scheduling algorithm for queueing networks
• Large claims approximations for risk processes in a Markovian environment
• Asymptotics of randomly stopped sums in the presence of heavy tails
• Limit theorems for coupled continuous time random walks.
• Fractional governing equations for coupled random walks
• Lagging and leading coupled continuous time random walks, renewal times and their joint limits
• A scaling analysis of a cat and mouse Markov chain
• The first hitting time of a single point for random walks
• Subexponential asymptotics of a Markov-modulated random walk with queueing applications
• Non-homogeneous random walks on a semi-infinite strip
• One dimensional lattice random walks with absorption at a point/on a half line
• Limit theorems for Lévy processes and Poisson point processes and their applications to Brownian excursions
• The extremal behaviour over regenerative cycles for Markov additive processes with heavy tails
• Title not available (Why is that?)
• Stability of a Markov-modulated Markov chain, with application to a wireless network governed by two protocols
• Stochastic stability of monotone economies in regenerative environments
• Stochastic bandwidth packing process: stability conditions via Lyapunov function technique
• An analog of Wald's identity for random walks with infinite mean
• Analysis of Stochastic Online Bin Packing Processes

Cited In (1)

• A scaling analysis of a cat and mouse Markov chain

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)