Petr Kůrka ; Enrico Formenti ; Alberto Dennunzio - Asymptotic distribution of entry times in a cellular automaton with annihilating particles

dmtcs:2976 - Discrete Mathematics & Theoretical Computer Science, January 1, 2011, DMTCS Proceedings vol. AP, Automata 2011 - 17th International Workshop on Cellular Automata and Discrete Complex Systems - https://doi.org/10.46298/dmtcs.2976
Asymptotic distribution of entry times in a cellular automaton with annihilating particlesConference paper

Authors: Petr Kůrka ORCID1; Enrico Formenti ORCID2; Alberto Dennunzio 3,2

  • 1 Center for Theoretical Study [Prague]
  • 2 Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe MC3
  • 3 Dipartimento di Informatica Sistemistica e Comunicazione

This work considers a cellular automaton (CA) with two particles: a stationary particle $1$ and left-going one $\overline{1}$. When a $\overline{1}$ encounters a $1$, both particles annihilate. We derive asymptotic distribution of appearence of particles at a given site when the CA is initialized with the Bernoulli measure with the probabilities of both particles equal to $1/2$.

https://doi.org/10.46298/dmtcs.2976
Source: HAL:hal-01196143v1
Volume: DMTCS Proceedings vol. AP, Automata 2011 - 17th International Workshop on Cellular Automata and Discrete Complex Systems
Section: Proceedings
Published on: January 1, 2011
Imported on: January 31, 2017
Keywords: Cellular Automata,Particle Systems,Entry Times,Return Times,[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS],[NLIN.NLIN-CG]Nonlinear Sciences [physics]/Cellular Automata and Lattice Gases [nlin.CG],[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
Funding:
    Source : OpenAIRE Graph
  • Funder: French National Research Agency (ANR); Code: ANR-09-BLAN-0164

1 Document citing this article

Share and export

Consultation statistics

This page has been seen 396 times.
This article's PDF has been downloaded 322 times.