Competition on Z^d driven by branching random walk
From MaRDI portal
Publication:6110554
Abstract: A competition process on is considered, where two species compete to color the sites. The entities are driven by branching random walks. Specifically red (blue) particles reproduce in discrete time and place offspring according to a given reproduction law, which may be different for the two types. When a red (blue) particle is placed at a site that has not been occupied by any particle before, the site is colored red (blue) and keeps this color forever. The types interact in that, when a particle is placed at a site of opposite color, the particle adopts the color of the site with probability . Can a given type color infinitely many sites? Can both types color infinitely many sites simultaneously? Partial answers are given to these questions and many open problems are formulated.
Recommendations
Cites work
- Branching random walk with catalysts
- Branching random walks. École d'Été de Probabilités de Saint-Flour XLII -- 2012
- Coexistence in locally regulated competing populations and survival of branching annihilating random walk
- Competing frogs on \({\mathbb Z}^d\)
- Competition in growth and urns
- Ergodic theorems for the multitype contact process
- First passage percolation and a model for competing spatial growth
- Group-invariant percolation on graphs
- Multi-particle diffusion limited aggregation
- On infection spreading and competition between independent random walks
- On multidimensional branching random walks in random environment
- Survival and extinction in a locally regulated population
- The Pleasures and Pains of Studying the Two-Type Richardson Model
- The asymptotic shape of the branching random walk
- The front location in branching Brownian motion with decay of mass
- Using moment equations to understand stochastically driven spatial pattern formation in ecological systems
This page was built for publication: Competition on \(\mathbb{Z}^d\) driven by branching random walk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6110554)