Author:
Lebensztayn Elcio,Machado Fábio Prates,Zuluaga Martinez Mauricio
Abstract
We consider a random walks system on ℤ in which each active particle performs a nearest-neighbor random walk and activates all inactive particles it encounters. The movement of an active particle stops when it reaches a certain number of jumps without activating any particle. We prove that if the process relies on efficient particles (i.e. those particles with a small probability of jumping to the left) being placed strategically on ℤ, then it might survive, having active particles at any time with positive probability. On the other hand, we may construct a process that dies out eventually almost surely, even if it relies on efficient particles. That is, we discuss what happens if particles are initially placed very far away from each other or if their probability of jumping to the right tends to 1 but not fast enough.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference5 articles.
1. Random walks systems with killing on ℤ
2. Limit theorems for an epidemic model on the complete graph;Kurtz;ALEA,2008
3. Recurrence for the frog model with drift on {Z};Gantert;Markov Process. Relat. Fields,2009
4. Markov Chains
5. Critical Behaviors and Critical Values of Branching Random Walks on Multigraphs
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献