Synchronization of finite-state pulse-coupled oscillators on \mathbb{Z}

From MaRDI portal
Publication:6281473




Abstract: We study class of cellular automata called kappa-color firefly cellular automata, which were introduced recently by the first author. At each discrete time t, each vertex in a graph has a state in 0,ldots,kappa−1, and a special state b(kappa)=lfloorfrackappa−12floor is designated as the `blinking' state. At step t, simultaneously for all vertices, the state of a vertex increments from k to k+1modkappa unless k>b(kappa) and at least one of its neighbors is in the state b(kappa). We study this system on mathbbZ where the initial configuration is drawn from a uniform product measure on 0,ldots,kappa−1mathbbZ. We show that the system clusters with high probability for all kappage3, and give upper and lower bounds on the rate. In the special case of kappa=3, we obtain sharp results using a combination of functional central limit theorem for Markov chains and generating function method. Our proof relies on a classic idea of relating the limiting behavior with an accompanying interacting particle system, as well as another monotone comparison process that we introduce in this paper.














This page was built for publication: Synchronization of finite-state pulse-coupled oscillators on $\mathbb{Z}$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6281473)