Diffusion-limited annihilating systems and the increasing convex order

DOI10.1214/22-EJP808MaRDI QIDQ6366172arXivFDO

Authors Riti Bahl, Philip Barnet, Tobias Johnson, Matthew Junge

Publication date 26 April 2021

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Abstract: We consider diffusion-limited annihilating systems with mobile $A$-particles and stationary $B$-particles placed throughout a graph. Mutual annihilation occurs whenever an $A$-particle meets a $B$-particle. Such systems, when ran in discrete time, are also referred to as parking processes. We show for a broad family of graphs and random walk kernels that augmenting either the size or variability of the initial placements of particles increases the total occupation time by $A$-particles of a given subset of the graph. A corollary is that the same phenomenon occurs with the total lifespan of all particles in internal diffusion-limited aggregation.

This page was built for publication: Diffusion-limited annihilating systems and the increasing convex order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6366172)