Abstract
We consider a synchronous process of particles moving on the vertices of a graph G, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, M particles are placed on a vertex of G. In subsequent time steps, all particles that are located on a vertex inhabited by at least two particles jump independently to a neighbour chosen uniformly at random. The process ends at the first step when no vertex is inhabited by more than one particle; we call this (random) time step the dispersion time.
Dokumententyp: | Paper |
---|---|
Fakultät: | Mathematik, Informatik und Statistik > Mathematik > Finanz- und Versicherungsmathematik |
Themengebiete: | 500 Naturwissenschaften und Mathematik > 510 Mathematik |
Sprache: | Englisch |
Dokumenten ID: | 121474 |
Datum der Veröffentlichung auf Open Access LMU: | 18. Sep. 2024 06:24 |
Letzte Änderungen: | 16. Okt. 2024 09:03 |