Algorithmic Mapping Criticality into Self Organized Criticality

Abstract

Probabilistic cellular automata are prototypes of non equilibrium critical phenomena. This class of models includes among others the directed percolation problem (Domany Kinzel model) and the dynamical Ising model. The critical properties of these models are usually obtained by fine-tuning one or more control parameters, as for instance the temperature. We present a method for the parallel evolution of the model for all the values of the control parameter, although its implementation is in general limited to a fixed number of values. This algorithm facilitates the sketching of phase diagrams and can be useful in deriving the critical properties of the model. Since the criticality here emerges from the asymptotic distribution of some quantities, without tuning of parameters, our method is a mapping from a probabilistic cellular automaton with critical behavior to a self organized critical model with the same critical properties.

13 pages RevTeX + 6 Postscript figures. (re)submitted to PRE. This is a completely new version

References in corpus (4)

• Avalanche Dynamics in Evolution, Growth, and Depinning Models
• Mapping Self-Organized Criticality onto Criticality
• Boolean derivatives and computation of cellular automata
• On Damage Spreading Transitions

Cited by in corpus (7)

• Self-organization without conservation: true or just apparent scale-invariance?
• Epidemic spreading and risk perception in multiplex networks: a self-organized percolation method
• Synchronization and Maximum Lyapunov Exponents of Cellular Automata
• Nature of phase transitions in a probabilistic cellular automaton with two absorbing states
• Cyber Resilience in IoT network: Methodology and example of assessment through epidemic spreading
• A Self-Organized Method for Computing the Epidemic Threshold in Computer Networks
• Phase transitions of extended-range probabilistic cellular automata with two absorbing states