The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Default user image.

Timo Vilkas

Senior lecturer

Default user image.

Competition on Zd driven by branching random walk

Author

  • Maria Deijfen
  • Timo Vilkas

Summary, in English

A competition process on Zd 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 p ∈ [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.

Publishing year

2023

Language

English

Publication/Series

Electronic Communications in Probability

Volume

28

Document type

Journal article

Publisher

Institute of Mathematical Statistics

Topic

  • Probability Theory and Statistics

Keywords

  • asymptotic shape
  • branching random walk
  • coexistence
  • competing growth

Status

Published

ISBN/ISSN/Other

  • ISSN: 1083-589X