Recurrence for branching Markov chains
From MaRDI portal
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 show that in emph{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.
Recommendations
Cited in
(12)- scientific article; zbMATH DE number 1191607 (Why is no real title available?)
- Limit distributions of branching Markov chains
- Large deviations for random walks on free products of finitely generated groups
- The timing of life history events in the presence of soft disturbances
- Branching Technique for Markov Chain Simulation (Finite State Case)
- Strong local survival of branching random walks is not monotone
- On mean recurrence times of Markov chains and spanning tree invariants
- On transience of frogs on Galton-Watson trees
- Recurrence of a class of quantum Markov chains on trees
- The critical branching Markov chain is transient
- Recurrence and transience of multitype branching random walks.
- Extinction probabilities in branching processes with count-ably many types: a general framework
This page was built for publication: Recurrence for branching Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1038919)