We study the ( )-color cyclic particle system on the one-dimensional integer lattice ( Z ), first introduced by Bramson and Griffeath (Ann Prob:26–45, 1989). In that paper they show that almost surely, every site changes its color infinitely often if ( 3,4 ) and only finitely many times if ( 5 ). In addition, they conjecture that for ( 3,4 ) the system clusters, that is, for any pair of sites x, y, with probability tending to 1 as (t ), x and y have the same color at time t. Here we prove that conjecture.
Ballistic annihilation (BA) was introduced in the 1990's in the physics community @cite_10 . There, particles are released from a Poisson point process (or any translation invariant distribution) on @math with i.i.d. velocities sampled from a bounded distribution @math . Once we place particles and assign their velocities, they move deterministically with a constant velocity, annihilating with one other upon collision. A specific case that has been given a detailed treatment is when @math is symmetric on @math @cite_2 . In this setup, there are three types of particles ( @math , @math , and @math ), assigned according to their initial velocities, and they interact by annihilating upon collision (see Figure ). See @cite_6 for a recent survey on this process.
@cite_10 @cite_6 @cite_2
1998664146 2528231449 2031810620 2083093559
We study the kinetics of ballistic annihilation, A+A→0, with continuous initial particle velocity distributions. The concentration and the rms velocity are found to decay as c∼t -α and υ rms ∼t -β , respectively, with the relation α+β=1 holding in any spatial dimension. A «mean-field» Boltzmann equation for the evolution of the velocity distribution predicts that a and β depend strongly on the initial condition, a behavior which is confirmed numerically in one and two dimensions Bullets are fired, one per second, with independent speeds sampled uniformly from a discrete set. Collisions result in mutual annihilation. We show that the second fastest bullet survives with positive probability, while a slowest bullet does not. This also holds for exponential spacings between firing times, and for certain non-uniform measures that place less probability on the second fastest bullet. Our results provide new insights into a two-sided version of the bullet process known to physicists as ballistic annihilation. Abstract At the heart of this article will be the study of a branching Brownian motion (BBM) with killing , where individual particles move as Brownian motions with drift − ρ , perform dyadic branching at rate β and are killed on hitting the origin. Firstly, by considering properties of the right-most particle and the extinction probability, we will provide a probabilistic proof of the classical result that the ‘one-sided’ FKPP travelling-wave equation of speed − ρ with solutions f : [ 0 , ∞ ) → [ 0 , 1 ] satisfying f ( 0 ) = 1 and f ( ∞ ) = 0 has a unique solution with a particular asymptotic when ρ 2 β , and no solutions otherwise. Our analysis is in the spirit of the standard BBM studies of [S.C. Harris, Travelling-waves for the FKPP equation via probabilistic arguments, Proc. Roy. Soc. Edinburgh Sect. A 129 (3) (1999) 503–517] and [A.E. Kyprianou, Travelling wave solutions to the K-P-P equation: alternatives to Simon Harris' probabilistic analysis, Ann. Inst. H. Poincare Probab. Statist. 40 (1) (2004) 53–72] and includes an intuitive application of a change of measure inducing a spine decomposition that, as a by product, gives the new result that the asymptotic speed of the right-most particle in the killed BBM is 2 β − ρ on the survival set. Secondly, we introduce and discuss the convergence of an additive martingale for the killed BBM, W λ , that appears of fundamental importance as well as facilitating some new results on the almost-sure exponential growth rate of the number of particles of speed λ ∈ ( 0 , 2 β − ρ ) . Finally, we prove a new result for the asymptotic behaviour of the probability of finding the right-most particle with speed λ > 2 β − ρ . This result combined with Chauvin and Rouault's [B. Chauvin, A. Rouault, KPP equation and supercritical branching Brownian motion in the subcritical speed area. Application to spatial trees, Probab. Theory Related Fields 80 (2) (1988) 299–314] arguments for standard BBM readily yields an analogous Yaglom-type conditional limit theorem for the killed BBM and reveals W λ as the limiting Radon–Nikodým derivative when conditioning the right-most particle to travel at speed λ into the distant future. This paper investigates the computational complexity of planning the motion of a body B in 2-D or 3-D space, so as to avoid collision with moving obstacles of known, easily computed, trajectories. Dynamic movement problems are of fundamental importance to robotics, but their computational complexity has not previously been investigated. We provide evidence that the 3-D dynamic movement problem is intractable even if B has only a constant number of degrees of freedom of movement. In particular, we prove the problem is PSPACE-hard if B is given a velocity modulus bound on its movements and is NP-hard even if B has no velocity modulus bound, where, in both cases, B has 6 degrees of freedom. To prove these results, we use a unique method of simulation of a Turing machine that uses time to encode configurations (whereas previous lower bound proofs in robotic motion planning used the system position to encode configurations and so required unbounded number of degrees of freedom). We also investigate a natural class of dynamic problems that we call asteroid avoidance problems : B, the object we wish to move, is a convex polyhedron that is free to move by translation with bounded velocity modulus, and the polyhedral obstacles have known translational trajectories but cannot rotate. This problem has many applications to robot, automobile, and aircraft collision avoidance. Our main positive results are polynomial time algorithms for the 2-D asteroid avoidance problem, where B is a moving polygon and we assume a constant number of obstacles, as well as single exponential time or polynomial space algorithms for the 3-D asteroid avoidance problem, where B is a convex polyhedron and there are arbitrarily many obstacles. Our techniques for solving these asteroid avoidance problems use “normal path” arguments, which are an intereting generalization of techniques previously used to solve static shortest path problems. We also give some additional positive results for various other dynamic movers problems, and in particular give polynomial time algorithms for the case in which B has no velocity bounds and the movements of obstacles are algebraic in space-time.