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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
