# Persistence of sums of correlated increments and clustering in cellular automata

## TL;DR

This paper extends Sparre Anderson's theorem to correlated Markov chain increments, analyzing the persistence of sums and applying results to clustering phenomena in cellular automata models.

## Contribution

It introduces a novel extension of classic persistence results to correlated increments and applies this to cellular automata clustering.

## Key findings

- Asymptotic survival probability behaves as Ct^{-1/2}
- Extended Sparre Anderson theorem to correlated Markov chains
- Established new clustering results for cellular automata models

## 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 $(-\infty,0]$, under general assumptions, we determine the asymptotic behavior of the survival probability, $\mathbb{P}(T\ge t)\sim 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.