Competing frogs on Z^d
Journal article, 2019
When an active type i particle moves to a new site, any sleeping particles there are activated and assigned type i, with an arbitrary tie-breaker deciding the type if the site is hit by particles of both types in the same time step. Let G_i denote the event that type i activates infinitely many particles. We show that the events G_1 \cap G_2^c and G_1^c \cap G_2 both have positive probability for all 0< p_1, p_2 <=1. Furthermore, if p_1 = p_2, then the types can coexist in the sense that the event G_1 \cap G_2 has positive probability.
We also formulate several open problems. For instance, we conjecture that, when the initial number of particles per site has a heavy tail, the types can coexist also when p_1 does not equal p_2.
Universidad Tecnológica Metropolitana
Electronic Journal of Probability
1083-6489 (ISSN)Vol. 24 1-17 146
Probability Theory and Statistics