The upper threshold in ballistic annihilation
From MaRDI portal
Abstract: Three-speed ballistic annihilation starts with infinitely many particles on the real line. Each is independently assigned either speed- with probability , or speed- symmetrically with the remaining probability. All particles simultaneously begin moving at their assigned speeds and mutually annihilate upon colliding. Physicists conjecture when all particles are eventually annihilated. Dygert et. al. prove , while Sidoravicius and Tournier describe an approach to prove . For the variant in which particles start at the integers, we improve the bound to . A renewal property lets us equate survival of a particle to the survival of a Galton-Watson process whose offspring distribution a computer can rigorously approximate. This approach may help answer the nearly thirty-year old conjecture that .
Recommendations
Cites work
Cited in
(10)- Combinatorial universality in three-speed ballistic annihilation
- The phase structure of asymmetric ballistic annihilation
- Dynamical pruning of rooted trees with applications to 1-D ballistic annihilation
- Note on a one-dimensional system of annihilating particles
- The bullet problem with discrete speeds
- Non-universality in clustered ballistic annihilation
- Three-velocity coalescing ballistic annihilation
- Arrivals are universal in coalescing ballistic annihilation
- Four-parameter coalescing ballistic annihilation
- Three-speed ballistic annihilation: phase transition and universality
This page was built for publication: The upper threshold in ballistic annihilation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5235494)