Electronic Communications in Probability · 2010 · 25 citations · 3 references
Natural SciencesMathematicsPhysicsCombinatoricsProbability TheoryStochastic ProcessesFixed PointsMarkov ChainsMarkov ProcessesProbabilistic CombinatoricsRandom WalksStatistical MechanicsDensityMarkov Chains On GraphsRandom Walk ModelsRandom Walks On Graphs
We prove that for the Activated Random Walks model on transitive unimodular graphs, if there is fixation, then every particle eventually fixates, almost surely. We deduce that the critical density is at most 1. Our methods apply for much more general processes on unimodular graphs. Roughly put, our result apply whenever the path of each particle has an automorphism invariant distribution and is independent of other particles' paths, and the interaction between particles is automorphism invariant and local. In particular, we do not require the particles path distribution to be Markovian. This allows us to answer a question of Rolla and Sidoravicius, in a more general setting then had been previously known (by Shellef).
3
Nonfixation for Activated Random Walks
Eric Shellef · arXiv (Cornell University) · 2009 · 19 citations · Full text