Dynamical sensitivity of recurrence and transience of branching random walks

Details Dynamical sensitivity of recurrence and transience of branching random walks Dynamical sensitivity of recurrence and transience of branching random walks

2009-07-27

arxiv.org/abs/0907.4557v2

Mathematics

Probability

v2: proofs and presentation revised, corrected the proof for dynamical stability of transience, behaviour in critical case is

Scientific paper

Consider a sequence of i.i.d. random variables $X_n$ where each random variable is refreshed independently according to a Poisson clock. At any fixed time $t$ the law of the sequence is the same as for the sequence at time 0 but at random times almost sure properties of the sequence may be violated. If there are such \emph{exceptional times} we say that the property is \emph{dynamically sensitive}, otherwise we call it \emph{dynamically stable}. In this note we consider branching random walks on Cayley graphs and prove that recurrence and transience are dynamically stable in the sub-and supercritical regime. While the critical case is left open in general we prove dynamical stability for a specific class of Cayley graphs. Our proof combines techniques from the theory of ranching random walks with those of dynamical percolation.

Affiliated with

Also associated with

No associations

Rating

Dynamical sensitivity of recurrence and transience of branching random walks 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 Dynamical sensitivity of recurrence and transience of branching random walks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamical sensitivity of recurrence and transience of branching random walks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-245653