Sannolikhet, statistik och kombinatorik: Competing frogs on Z^d

  • Datum:
  • Plats: Ångströmlaboratoriet 64119
  • Föreläsare: Maria Deijfen, Stockholms universitet
  • Kontaktperson: Xing Shi Cai
  • Seminarium

Abstract: The so called frog model on Z^d is driven by moving particles on the sites of the Z^d-lattice. Each site is independently assigned a random number of particles. At time 0, the particles at the origin are activated, while all other particles are sleeping. When a particle is activated, it starts moving according to a simple random walk and, when a site is visited by an active particle, any sleeping particles at the site are activated and start moving. I will describe a two-type version of the model, where an active particle can be of either of two types. For this model, a natural question is whether the types can coexist in the sense that they both activate infinitely many particles. I will describe existing results and open problems related to this.