{
  "id": "2212.02176",
  "version": "v1",
  "published": "2022-12-05T11:17:33.000Z",
  "updated": "2022-12-05T11:17:33.000Z",
  "title": "Ergodicity of some probabilistic cellular automata with two letters alphabet via random walks",
  "authors": [
    "Jérôme Casse"
  ],
  "comment": "18 pages, 5 figures",
  "categories": [
    "math.PR"
  ],
  "abstract": "Ergodicity of probabilistic cellular automata is a very important issue in the PCA theory. In particular, the question about the ergodicity of all PCA with two-size neighbourhood, two letters alphabet and positive rates is still open. In this article, we do not try to improve this issue, but we show a new kind of proof (to the best knowledge of the author) about the ergodicity of some of those PCA, including also some CA with errors. The proof is based on the study of the boundaries of islands where the PCA is totally decorrelated from its initial condition. The behaviours of these boundaries are the ones of random walks.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2022-12-05T11:17:33.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "60K35",
      "60J05",
      "37B15",
      "37A50"
    ],
    "keywords": [
      "probabilistic cellular automata",
      "random walks",
      "letters alphabet",
      "ergodicity",
      "pca theory"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 18,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}