Persistence of sums of correlated increments and clustering in cellular automata
Abstract
We consider sums of increments given by a functional of a stationary Markov chain. Letting T be the first return time of the partial sums process to (-∞,0], under general assumptions, we determine the asymptotic behavior of the survival probability, P(T t) Ct-1/2 for an explicit constant C. Our analysis is based on a connection between the survival probability and the running maximum of the time-reversed process, and relies on a functional central limit theorem for Markov chains. Our result extends the classic theorem of Sparre Anderson on sums of mean zero and independent increments to the case of correlated increments. As applications, we recover known clustering results for the 3-color cyclic cellular automaton and the Greenberg-Hastings model in one dimension, and we prove a new clustering result for the 3-color firefly cellular automaton.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.