Description
We consider a discrete-time branching annihilating random walk (BARW). Within a
time step, each particle, before dying, produces a random number of offspring which are
then randomly and independently displaced in space. If, after the displacement, a site is
occupied by several particles, all particles at that site are annihilated. This can be thought
of as a very strong form of local competition and entails that the system is not monotone.
On the poster, we will discuss the BARW and its long-time asymptotics on Z^d as well as on the complete graph. Furthermore, we will explore its connection to a classical urn occupancy problem and to a randomly disturbed deterministic iteration.