Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling
Advances in Applied Probability · 2013-12 · 45 (4) · 960-980
DOI: 10.1239/aap/1386857853 ↗Kurz gefasst
Fachartikel in der Zeitschrift Advances in Applied Probability, online erschienen am 04.01.2016. Verfasst von Ana Bušić und 2 weiteren Autor:innen. Die Arbeit wurde bisher 44-mal zitiert (Crossref) und nennt 28 Literaturangaben.
Abstract (Originalsprache)
A probabilistic cellular automaton (PCA) can be viewed as a Markov chain. The cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. We investigate the ergodicity of this Markov chain. A classical cellular automaton is a particular case of PCA. For a one-dimensional cellular automaton, we prove that ergodicity is equivalent to nilpotency, and is therefore undecidable. We then propose an efficient perfect sampling algorithm for the invariant measure of an ergodic PCA. Our algorithm does not assume any monotonicity property of the local rule. It is based on a bounding process which is shown to also be a PCA. Last, we focus on the PCA majority, whose asymptotic behavior is unknown, and perform numerical experiments using the perfect sampling procedure.
Zitieren
APA
Bušić, A., Mairesse, J., & Marcovici, I. (2013). Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling. Advances in Applied Probability, 45(4), 960-980. https://doi.org/10.1239/aap/1386857853
Vancouver
Bušić A, Mairesse J, Marcovici I. Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling. Advances in Applied Probability. 2013;45(4):960-980. doi:10.1239/aap/1386857853
BibTeX
@article{Bui2013,
author = {Bušić, Ana and Mairesse, Jean and Marcovici, Irène},
title = {Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling},
journal = {Advances in Applied Probability},
year = {2013},
volume = {45},
number = {4},
pages = {960--980},
doi = {10.1239/aap/1386857853}
}
EUVIMED