2010
DOI: 10.1007/s10955-010-9974-z
|View full text |Cite
|
Sign up to set email alerts
|

Renormalization of Cellular Automata and Self-Similarity

Abstract: 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… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
17
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(17 citation statements)
references
References 8 publications
0
17
0
Order By: Relevance
“…By reducing the complexity and focusing on the key ingredient underlying the forecast skill, namely the time to the bubble, the method of ghosts of singularities seems to be less sensitive to idiosyncratic noise realisations, thus providing more robust forecasts. This can be interpreted as a kind of effective coarse-graining of the dynamical equations, a process that, when done intelligently, has been shown in the past to improve predictability [46][47][48][49]. …”
Section: Application Of Ghosts Of Finite-time Singularitiesmentioning
confidence: 99%
“…By reducing the complexity and focusing on the key ingredient underlying the forecast skill, namely the time to the bubble, the method of ghosts of singularities seems to be less sensitive to idiosyncratic noise realisations, thus providing more robust forecasts. This can be interpreted as a kind of effective coarse-graining of the dynamical equations, a process that, when done intelligently, has been shown in the past to improve predictability [46][47][48][49]. …”
Section: Application Of Ghosts Of Finite-time Singularitiesmentioning
confidence: 99%
“…Right panel: the same run, coarse-grained in both time and space. The system is now simplified by a factor of nine; we preserve approximate relationships, and rough, probabilistic logics of evolution.phenomenon, for the case of cellular automata, have been investigated in elegant detail by Edlund and Jacobi [15].Spatial coarse-graining is not the only way to simplify a system, and in many cases may not be appropriate. When we move from the physical to the biological or social sciences we find systems that are fundamentally long-range in nature, or have mechanisms that tie together distant locations.…”
mentioning
confidence: 99%
“…phenomenon, for the case of cellular automata, have been investigated in elegant detail by Edlund and Jacobi [15].…”
mentioning
confidence: 99%
“…1. This is a natural progression from the work of Edlund and Nilsson Jacobi (2010) who present a concise and systematic approach to renormalisation of such one-dimensional CA, which itself builds on previous work labelled as application of a dynamically driven renormalisation group (Toméand et al 1997;De Oliveira and Satulovsky 1997). It is known that in applying some scale transformation to a CA, we do not guarantee the existence of an exact coarse grained dynamics, one which exactly incorporates all possible microscopic transitions.…”
mentioning
confidence: 99%
“…In such instances it is natural to choose the best fit by way of least-squares. The important contribution of Edlund and Nilsson Jacobi (2010) has been to show that what previously was referred to as the dynamically driven renormalisation group amounts to weighting this least-squares fit by the steady-state probability distribution such that error is concentrated on the transitions between relatively uncommon states.…”
mentioning
confidence: 99%