Two-type annihilating systems on the complete and star graph

  title={Two-type annihilating systems on the complete and star graph},
  author={Irina Cristali and Yufeng Jiang and Matthew Junge and R. Kassem and David Sivakoff and Grayson York},
  journal={arXiv: Probability},
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 when particles with different colors meet. We study the expected number of steps needed to extinguish every particle. In particular, we compare this quantity to the one-type setting, and study the effect of asymmetric particle speeds. 
1 Citations
Particle density in diffusion-limited annihilating systems
Place an $A$-particle at each site of a graph independently with probability $p$ and otherwise place a $B$-particle. $A$- and $B$-particles perform independent continuous time random walks at ratesExpand


Coalescing Random Walks and Voter Model Consensus Times on the Torus in $\mathbb{Z}^d$
Voter models on Z d and on the torus of site N in Z d are considered. The second ones get trapped with probability 1, as t tends to infinity, at all 0's or all 1's. The asymptotic growth of theseExpand
Coalescing Random Walks and Voting on Connected Graphs
In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continuesExpand
Recurrence and density decay for diffusion-limited annihilating systems
We study an infinite system of moving particles, where each particle is of type A or B. Particles perform independent random walks at rates $$D_A > 0$$DA>0 and $$D_B \geqslant 0$$DB⩾0, and theExpand
Some Problems on Random Intervals and Annihilating Particles
Particles perform independent random walks on the integers, and are annihilated if they cross paths or land at the same point. The problem is to determine whether the origin is hit infinitely often.Expand
Non-equilibrium Phase Transitions: Activated Random Walks at Criticality
In this paper we present rigorous results on the critical behavior of the Activated Random Walk model. We conjecture that on a general class of graphs, including $$\mathbb Z^d$$Zd, and under generalExpand
Spatial Structure in Low Dimensions for Diffusion Limited Two-Particle Reactions
Consider the system of particles on ${\Bbb Z}^d$ where particles are of two types, $A$ and $B$, and execute simple random walks in continuous time. Particles do not interact with their own type, butExpand
Asymptotic behavior of densities for two-particle annihilating random walks
Consider the system of particles onℤd where particles are of two types—A andB—and execute simple random walks in continuous time. Particles do not interact with their own type, but when anA-particleExpand
Particle–antiparticle annihilation in diffusive motion
We study both numerically and analytically the time development of a system of particles and antiparticles moving diffusively and annihilating irreversibly. The asymptotic behavior is found to dependExpand
On coalescence time in graphs-When is coalescing as fast as meeting?
It is proved that for any graph the coalescence time is bounded by O(n^3) (which is tight for the Barbell graph); surprisingly even such a basic question about the coalescing time was not answered before this work. Expand
Multiple Random Walks and Interacting Particle Systems
Combining results from the predator-prey and multiple random walk models allows us to compare expected detection time in the following cops and robbers scenarios: both the predator and the prey move randomly, the prey moves randomly and the predators stay fixed, the predators move randomly andThe prey stays fixed. Expand