arXiv Analytics

Sign in

arXiv:1402.2558 [math.PR]AbstractReferencesReviewsResources

Non-homogeneous random walks on a semi-infinite strip

Nicholas Georgiou, Andrew R. Wade

Published 2014-02-11Version 1

We study the asymptotic behaviour of Markov chains $(X_n,\eta_n)$ on $\mathbb{Z}_+ \times S$, where $\mathbb{Z}_+$ is the non-negative integers and $S$ is a finite set. Neither coordinate is assumed to be Markov. We assume a moments bound on the jumps of $X_n$, and that, roughly speaking, $\eta_n$ is close to being Markov when $X_n$ is large. This departure from much of the literature, which assumes that $\eta_n$ is itself a Markov chain, enables us to probe precisely the recurrence phase transitions by assuming asymptotically zero drift for $X_n$ given $\eta_n$. We give a recurrence classification in terms of increment moment parameters for $X_n$ and the stationary distribution for the large-$X$ limit of $\eta_n$. In the null case we also provide a weak convergence result, which demonstrates a form of asymptotic independence between $X_n$ (rescaled) and $\eta_n$. Our results can be seen as generalizations of Lamperti's results for non-homogeneous random walks on $\mathbb{Z}_+$ (the case where $S$ is a singleton). Motivation arises from modulated queues or processes with hidden variables where $\eta_n$ tracks an internal state of the system.

Comments: 27 pages
Journal: Stochastic Processes and their Applications, Vol. 124 (2014), no. 10, p. 3179-3205
Categories: math.PR
Subjects: 60J10, 60F05, 60F15, 60K15, 60K25
Related articles: Most relevant | Search more
arXiv:0809.0177 [math.PR] (Published 2008-09-01, updated 2009-12-15)
Limit theorems for additive functionals of a Markov chain
arXiv:1602.06512 [math.PR] (Published 2016-02-21)
Waiting times and stopping probabilities for patterns in Markov chains
arXiv:1602.05247 [math.PR] (Published 2016-02-17)
The Computation of Key Properties of Markov Chains via Perturbations