Competition on Z^d driven by branching random walk

From MaRDI portal
Publication:6110554

DOI10.1214/23-ECP521arXiv2203.14166MaRDI QIDQ6110554FDOQ6110554


Authors: Maria Deijfen, Timo Vilkas Edit this on Wikidata


Publication date: 2 August 2023

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Abstract: A competition process on mathbbZd 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 pin[0,1]. 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.


Full work available at URL: https://arxiv.org/abs/2203.14166




Recommendations




Cites Work






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)