Local and global survival for nonhomogeneous random walk systems on Z
Daniela Bertacchi, Fabio Prates Machado, Fabio Zucca

TL;DR
This paper analyzes the conditions for survival and activation in a nonhomogeneous interacting random walk system on Z, considering both immortal and mortal particles with various drift behaviors and providing explicit phase diagrams for specific cases.
Contribution
It offers new criteria for global and local survival in nonhomogeneous random walks with activation dynamics, including cases with mortal particles and explicit phase diagrams.
Findings
0-1 law for local survival with all particles drifting right
Conditions for local survival or extinction with particles drifting left
Complete phase diagrams for specific asymptotic behaviors of parameters
Abstract
We study an interacting random walk system on Z where at time 0 there is an active particle at 0 and one inactive particle on each site . Particles become active when hit by another active particle. Once activated, the particle starting at n performs an asymmetric, translation invariant, nearest neighbor random walk with left jump probability . We give conditions for global survival, local survival and infinite activation both in the case where all particles are immortal and in the case where particles have geometrically distributed lifespan (with parameter depending on the starting location of the particle). More precisely, once activated, the particle at n survives at each step with probability . In particular, in the immortal case, we prove a 0-1 law for the probability of local survival when all particles drift to the right. Besides that, we give…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Random Matrices and Applications · Advanced Queuing Theory Analysis
