Algorithmic Mapping Criticality into Self Organized Criticality

Details Algorithmic Mapping Criticality into Self Organized Criticality Algorithmic Mapping Criticality into Self Organized Criticality

1996-05-10

arxiv.org/abs/cond-mat/9605066v3

Phys. Rev. E 55, 3970 (1997)

Physics

Condensed Matter

Statistical Mechanics

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

Scientific paper

10.1103/PhysRevE.55.3970

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.

Affiliated with

Also associated with

No associations

Rating

Algorithmic Mapping Criticality into Self Organized Criticality does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithmic Mapping Criticality into Self Organized Criticality, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithmic Mapping Criticality into Self Organized Criticality will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-521438