Renormalization of cellular automata and self-similarity

Details Renormalization of cellular automata and self-similarity Renormalization of cellular automata and self-similarity

2011-08-19

arxiv.org/abs/1108.3982v1

Journal of Statistical Physics Volume 139, Number 6, 972-984 (2010)

Physics

Condensed Matter

Statistical Mechanics

14 pages, 4 figures

Scientific paper

10.1007/s10955-010-9974-z

We study self-similarity in one-dimensional probabilistic cellular automata (PCA) using the renormalization technique. We introduce a general framework for algebraic construction of renormalization groups (RG) on cellular automata and apply it to exhaustively search the rule space for automata displaying dynamic criticality. Previous studies have shown that there exists several exactly renormalizable deterministic automata. We show that the RG fixed points for such self-similar CA are unstable in all directions under renormalization. This implies that the large scale structure of self-similar deterministic elementary cellular automata is destroyed by any finite error probability. As a second result we show that the only non-trivial critical PCA are the different versions of the well-studied phenomenon of directed percolation. We discuss how the second result supports a conjecture regarding the universality class for dynamic criticality defined by directed percolation.

Affiliated with

Also associated with

No associations

Rating

Renormalization of cellular automata and self-similarity 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 Renormalization of cellular automata and self-similarity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Renormalization of cellular automata and self-similarity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-108597