Survival, extinction and approximation of discrete-time branching random walks

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

32 pages, a few misprints have been corrected

Scientific paper

We consider a general discrete-time branching random walk on a countable set X. We relate local, strong local and global survival with suitable inequalities involving the first-moment matrix M of the process. In particular we prove that, while the local behavior is characterized by M, the global behavior cannot be completely described in terms of properties involving M alone. Moreover we show that locally surviving branching random walks can be approximated by sequences of spatially confined and stochastically dominated branching random walks which eventually survive locally if the (possibly finite) state space is large enough. An analogous result can be achieved by approximating a branching random walk by a sequence of multitype contact processes and allowing a sufficiently large number of particles per site. We compare these results with the ones obtained in the continuous-time case and we give some examples and counterexamples.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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

Rate now

     

Profile ID: LFWR-SCP-O-353543

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.