Critical branching random walk in an IID environment

Details Critical branching random walk in an IID environment Critical branching random walk in an IID environment

2010-03-25

arxiv.org/abs/1003.4950v1

Mathematics

Probability

Scientific paper

Using a high performance computer cluster, we run simulations regarding an open problem about d-dimensional critical branching random walks in a random IID environment The environment is given by the rule that at every site independently, with probability p>0, there is a cookie, completely suppressing the branching of any particle located there. Abstract. The simulations suggest self averaging: the asymptotic survival probability in n steps is the same in the annealed and the quenched case; it is \frac{2}{qn}, where q:=1-p. This particular asymptotics indicates a non-trivial phenomenon: the tail of the survival probability (both in the annealed and the quenched case) is the same as in the case of non-spatial unit time critical branching, where the branching rule is modified: branching only takes place with probability q for every particle at every iteration.

Affiliated with

Also associated with

No associations

Rating

Critical branching random walk in an IID environment 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 Critical branching random walk in an IID environment, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Critical branching random walk in an IID environment will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-556729