2015
DOI: 10.1142/s0129183116500169
|View full text |Cite
|
Sign up to set email alerts
|

The inactive–active phase transition in the noisy additive (exclusive-or) probabilistic cellular automaton

Abstract: We investigate the inactive-active phase transition in an array of additive (exclusive-or) cellular automata (CA) under noise. The model is closely related with the Domany-Kinzel (DK) probabilistic cellular automaton (PCA), for which there are rigorous as well as numerical estimates on the transition probabilities. Here, we characterize the critical behavior of the noisy additive cellular automaton by mean¯eld analysis and¯nite-size scaling and show that its phase transition belongs to the directed percolation… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 41 publications
0
3
0
Order By: Relevance
“…In the one-site mean field approximation, all correlations are written in terms of one-site correlation. That is, the probability of any cluster of sites is written as the product of the probability of each site (Tomé and De Carvalho 2007;Mendonça 2016). Also, all correlations between sites in the cluster are neglected in one-site mean field approximation (Tomé and De Carvalho 2007).…”
Section: Mean Field Approximationmentioning
confidence: 99%
“…In the one-site mean field approximation, all correlations are written in terms of one-site correlation. That is, the probability of any cluster of sites is written as the product of the probability of each site (Tomé and De Carvalho 2007;Mendonça 2016). Also, all correlations between sites in the cluster are neglected in one-site mean field approximation (Tomé and De Carvalho 2007).…”
Section: Mean Field Approximationmentioning
confidence: 99%
“…The PCA in table 1 is an example of a mixed PCA, also known as 'diploid' cellular automata [28][29][30][31][32][33]. In a mixed PCA, two or more deterministic CA rules are combined such that sometimes one rule is applied, some other times another rule is applied.…”
Section: A Mixed Pca Inspired By Population Dynamicsmentioning
confidence: 99%
“…The one-parameter PCA in Case II are examples of mixed PCA that have appeared in the literature before [54,56,57]. In a mixed PCA, two or more deterministic CA rules are combined probabilistically such that sometimes one rule is applied, some other times another rule is applied to a given cell.…”
Section: B Mixed Ca and Pcamentioning
confidence: 99%