IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v6y2004i2d10.1023_bmcap.0000017712.55431.96.html
   My bibliography  Save this article

Markov Chain Analysis for One-Dimensional Asynchronous Cellular Automata

Author

Listed:
  • Alexandru Agapie

    (Fraunhofer Institute AIS)

  • Robin Höns

    (Fraunhofer Institute AIS)

  • Heinz Mühlenbein

    (Fraunhofer Institute AIS)

Abstract

We consider the finite homogeneous Markov chain induced by a class of one-dimensional asynchronous cellular automata—automata that are allowed to change only one cell per iteration. Furthermore, we confine to totalistic automata, where transitions depend only on the number of 1s in the neighborhood of the current cell. We consider three different cases: (i) size of neighborhood equals length of the automaton; (ii) size of neighborhood two, length of automaton arbitrary; and (iii) size of neighborhood three, length of automaton arbitrary. For each case, the associated Markov chain proves to be ergodic. We derive simple-form stationary distributions, in case (i) by lumping states with respect to the number of 1s in the automaton, and in cases (ii) and (iii) by considering the number of 0–1 borders within the automaton configuration. For the three-neighborhood automaton, we analyze also the Markov chain at the boundary of the parameter domain, and the symmetry of the entropy. Finally, we show that if the local transition rule is exponential, the stationary probability is the Boltzmann distribution of the Ising model.

Suggested Citation

  • Alexandru Agapie & Robin Höns & Heinz Mühlenbein, 2004. "Markov Chain Analysis for One-Dimensional Asynchronous Cellular Automata," Methodology and Computing in Applied Probability, Springer, vol. 6(2), pages 181-201, June.
    • Handle: RePEc:spr:metcap:v:6:y:2004:i:2:d:10.1023_b:mcap.0000017712.55431.96
    DOI: 10.1023/B:MCAP.0000017712.55431.96
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/B:MCAP.0000017712.55431.96
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/B:MCAP.0000017712.55431.96?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:metcap:v:6:y:2004:i:2:d:10.1023_b:mcap.0000017712.55431.96. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.