The critical Branching Markov Chain is transient

Details The critical Branching Markov Chain is transient The critical Branching Markov Chain is transient

2005-10-26

arxiv.org/abs/math/0510556v1

Mathematics

Probability

Scientific paper

We investigate recurrence and transience of Branching Markov Chains (BMC) in discrete time. Branching Markov Chains are clouds of particles which move (according to an irreducible underlying Markov Chain) and produce offspring independently. The offspring distribution can depend on the location of the particle. If the offspring distribution is constant for all locations, these are Tree-Indexed Markov chains in the sense of \cite{benjamini94}. Starting with one particle at location $x$, we denote by $\alpha(x)$ the probability that $x$ is visited infinitely often by the cloud. Due to the irreducibility of the underlying Markov Chain, there are three regimes: either $\alpha(x) = 0$ for all $x$ (transient regime), or $0 < \alpha(x) < 1$ for all $x$ (weakly recurrent regime) or $\alpha(x) = 1$ for all $x$ (strongly recurrent regime). We give classification results, including a sufficient condition for transience in the general case. If the mean of the offspring distribution is constant, we give a criterion for transience involving the spectral radius of the underlying Markov Chain and the mean of the offspring distribution.

Affiliated with

Also associated with

No associations

Rating

The critical Branching Markov Chain is transient does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The critical Branching Markov Chain is transient, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The critical Branching Markov Chain is transient will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-555684