Abstract
We present a method for computing probability of occurrence of ones in a configuration obtained by iteration of a probabilistic cellular automata (PCA), starting from a random initial configuration. If the PCA is sufficiently simple, one can construct a set of words (or blocks of symbols) which is complete, meaning that probabilities of occurrence of words from this set can be expressed as linear combinations of probabilities of occurrence of these words at the previous time step. One can then set up and solve a recursion for block probabilities. We demonstrate an example of such PCA, which can be viewed as a simple model of diffusion of information or spread of rumours. Expressions for the density of ones are obtained for this rule using the proposed method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
