Abstract
We study the asymptotic behaviour of Markov chains on , where is the non-negative integers and is a finite set. Neither coordinate is assumed to be Markov. We assume a moments bound on the jumps of , and that, roughly speaking, is close to being Markov when is large. This departure from much of the literature, which assumes that is itself a Markov chain, enables us to probe precisely the recurrence phase transitions by assuming asymptotically zero drift for given . We give a recurrence classification in terms of increment moment parameters for and the stationary distribution for the large- limit of . In the null case we also provide a weak convergence result, which demonstrates a form of asymptotic independence between (rescaled) and . Our results can be seen as generalizations of Lamperti's results for non-homogeneous random walks on (the case where is a singleton). Motivation arises from modulated queues or processes with hidden variables where tracks an internal state of the system.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.