NDLI: Supercritical probabilistic cellular automata: how effective is the synchronous updating?

Content Provider	Springer Nature Link
Author	Louis, Pierre Yves
Copyright Year	2015
Abstract	Probabilistic cellular automata generalise CA by implementing in a synchronous way an updating rule defined through a probability. A probabilistic synchronous updating scheme does it mean an efficient parallel evolution mechanism? This article deals with the question of quantifying the effectiveness of the parallel updating. A good indicator of this effectiveness is the fraction of components whose value is updated between two time steps. Two classes of parameterised models are considered. Multiple stationary distributions may occur when an infinite number of interacting components is considered (ergodicity breaks/supercritical regime). As a consequence, these models both exhibit different dynamical regimes in the corresponding case when a finite number of sites are interacting. These two classes’ non trivial steady states are of different nature. One is a family of positive rates reversible PCA dynamics. The other one is the Stavskaja PCA dynamics. It exhibits an absorbing state. Thanks to numerical simulations, both these PCA dynamics are shown to behave nearly asynchronous when these phase transition phenomena occur.
Ending Page	534
Page Count	12
Starting Page	523
File Format	PDF
ISSN	15677818
e-ISSN	15729796
Journal	Natural Computing
Issue Number	4
Volume Number	14
Language	English
Publisher	Springer Netherlands
Publisher Date	2015-09-28
Publisher Place	Dordrecht
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Probabilistic cellular automata Processor Architectures Random fields Systems of interacting stochastic processes Interacting random processes; statistical mechanics type models; percolation theory Theory of Computation Cellular automata Statistical Physics, Dynamical Systems and Complexity Synchronous Asynchronous updating Artificial Intelligence (incl. Robotics) Computational methods in Markov chains Evolutionary Biology Discrete dynamical systems Loss of ergodicity Phase transition
Content Type	Text
Resource Type	Article
Subject	Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Probing robustness of cellular automata through variations of asynchronous updating

Asynchronous cellular automata and dynamical properties

Ergodicity of some probabilistic cellular automata with two letters alphabet via random walks

Markovianity of the invariant distribution of probabilistic cellular automata on the line

M-Asynchronous cellular automata: from fairness to quasi-fairness

Stationary measures and phase transition for a class of Probabilistic Cellular Automata

Foreword: asynchronous cellular automata and applications

Synchronous cellular automata-based scheduler initialized by heuristic and modeled by a pseudo-linear neighborhood

Ergodicity of some classes of cellular automata subject to noise

Supercritical probabilistic cellular automata: how effective is the synchronous updating?

Similar Documents

Probing robustness of cellular automata through variations of asynchronous updating

Asynchronous cellular automata and dynamical properties

Ergodicity of some probabilistic cellular automata with two letters alphabet via random walks

Markovianity of the invariant distribution of probabilistic cellular automata on the line

M-Asynchronous cellular automata: from fairness to quasi-fairness

Stationary measures and phase transition for a class of Probabilistic Cellular Automata

Foreword: asynchronous cellular automata and applications

Synchronous cellular automata-based scheduler initialized by heuristic and modeled by a pseudo-linear neighborhood

Ergodicity of some classes of cellular automata subject to noise

Supercritical probabilistic cellular automata: how effective is the synchronous updating?