Abstract
The question of recurrence and transience of branching Markov chains is more subtle than for ordinary Markov chains; they can be classified in transience, weak recurrence, and strong recurrence. We review criteria for transience and weak recurrence and give several new conditions for weak recurrence and strong recurrence. These conditions make a unified treatment of known and new examples possible and provide enough information to distinguish between weak and strong recurrence. This represents a step towards a general classification of branching Markov chains. In particular, we showthat in homogeneous cases weak recurrence and strong recurrence coincide. Furthermore, we discuss the generalization of positive and null recurrence to branching Markov chains and show that branching random walks on ℤ are either transient or positive recurrent. © 2008 Applied Probability Trust.
Author supplied keywords
Cite
CITATION STYLE
Müller, S. (2008). Recurrence for branching markov chains. Electronic Communications in Probability, 13, 576–605. https://doi.org/10.1214/ECP.v13-1424
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.