2000 character limit reached
Extinction window of mean field branching annihilating random walk
Published 15 Oct 2013 in math.PR | (1310.3976v2)
Abstract: We study a model of growing population that competes for resources. At each time step, all existing particles reproduce and the offspring randomly move to neighboring sites. Then at any site with more than one offspring, the particles are annihilated. This is a nonmonotone model, which makes the analysis more difficult. We consider the extinction window of this model in the finite mean-field case, where there are $n$ sites but movement is allowed to any site (the complete graph). We show that although the system survives for exponential time, the extinction window is logarithmic.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.