Dynamic Space Filling
arXiv:2506.01128 · doi:10.1088/1742-5468/ae1df6
Abstract
Dynamic space filling (DSF) is a stochastic process defined on any connected graph. Each vertex can host an arbitrary number of particles forming a pile, with every arriving particle landing on the top of the pile. Particles in a pile, except for the particle at the bottom, can hop to neighboring vertices. Eligible particles hop independently and stochastically, with the overall hopping rate set to unity. When the number of vertices in a graph is equal to the total number of particles, the evolution stops when a single particle occupies every vertex. We determine the halting time distribution on complete graphs. Using the mapping of the DSF into a two-species annihilation process, we argue that on -dimensional tori with vertices, the average halting time scales with the number of vertices as when and as when .
12 pages, 1 figure. V2: Appendix and refs added
References in corpus (22)
- Shot Noise in Mesoscopic Conductors
- 2D Gravity and Random Matrices
- Jammed Hard-Particle Packings: From Kepler to Bernal and Beyond
- Current fluctuations in non-equilibrium diffusive systems: an additivity principle
- Current fluctuations in the one dimensional Symmetric Exclusion Process with open boundaries
- Universal Statistics of Transport in Disordered Conductors
- How limit cycles and quasi-cycles are related in systems with intrinsic noise
- Cascade Boltzmann - Langevin approach to higher-order current correlations in diffusive metal contacts
- Census of Planar Maps: From the One-Matrix Model Solution to a Combinatorial Proof
- A conceptual breakthrough in sphere packing
- Sublogarithmic fluctuations for internal DLA
- Computational Approaches to Lattice Packing and Covering Problems
- Symmetry and species segregation in diffusion-limited pair annihilation
- How large a disc is covered by a random walk in n steps?
- Finite Size Fluctuations in Interacting Particle Systems
- Non-extensive super-cluster states in aggregation with fragmentation
- Reaction-Diffusion Process Driven by a Localized Source: First Passage Properties
- Local Covering Optimality of Lattices: Leech Lattice versus Root Lattice E8
- Random Sequential Covering
- Finite Size Effects in Addition and Chipping Processes
- Supercluster states and phase transitions in aggregation-fragmentation processes
- Random sequential covering of a one-dimensional lattice by -mers