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 …

In ballistic annihilation, infinitely many particles with randomly assigned velocities move
across the real line and mutually annihilate upon contact. We introduce a variant with …

At each site of a supercritical Galton-Watson tree place a parking spot which can
accommodate one car. Initially, an independent and identically distributed number of cars …

In coalescing ballistic annihilation, infinitely many particles move with fixed velocities across
the real line and, upon colliding, either mutually annihilate or generate a new particle. We …

Models of parking in which cars are placed randomly and then move according to a
deterministic rule have been studied since the work of Konheim and Weiss in the 1960s …

Red and blue particles are placed in equal proportion throughout either the complete or star
graph and iteratively sampled to take simple random walk steps. Mutual annihilation occurs …

We study a family of interacting particle systems with annihilating and coalescing reactions.
Two types of particles are interspersed throughout a transitive unimodular graph. Both types …

Models of parking in which cars are placed randomly and then move according to a
deterministic rule have been studied since the work of Konheim and Weiss in the 1960s …

Generalized gamma distributions arise as limits in many settings involving random graphs,
walks, trees, and branching processes. Peköz et al.(2016) exploited characterizing …

1.1. Motivation. In modern data analysis, a central step is to find a low-dimensional
representation to better understand, compress, or convey the key phenomena captured in …