The one-dimensional Domany-Kinzel cellular automaton is investigated by two numerical approaches: (i) the spontaneous-search method, which is a method appropriated for a search of criticality; (ii) short-time dynamics. Both critical frontiers of the system are investigated, namely, the one separating the frozen and active phases, as well as the critical line determined by damage spreading between two cellular automata, that splits the active phase into the nonchaotic and chaotic phases. The efficiency of the spontaneous-search method is established herein through a precise estimate of both critical frontiers, and in addition to that, it is shown that this method may also be used in the determination of the critical exponent ν ⊥ . Using the ...
Cellular automata are a model of parallel computing. It is well known that simple cellular automata ...
I study the Chaté-Manneville cellular-automata rules on randomly connected lattices. The periodic an...
AbstractThe classification of cellular automata rules by Wolfram into four universality classes is b...
The one-dimensional Domany-Kinzel cellular automaton is investigated by two numerical approaches: (i...
Spontaneous-search method and short-time dynamics: applications to the Domany-Kinzel cellular automa...
We consider a generalized version (including anisotropy) of the stochastic one-dimensional cellular ...
New analytic and numerical results for the one-dimensional Domany-Kinzel cellular automaton are pres...
We propose a method to detect phase transitions in discrete lattice models based on the roughness ex...
We study Domany-Kinzel cellular automata on small-world network. Every link on a one dimensional cha...
In a roughening process, the growth exponent β describes how the roughness w grows with the time t: ...
Stavskaya's model is a one-dimensional probabilistic cellular automaton (PCA) introduced in the end ...
Abstract. Series expansions have been derived for the percolation probability of a generalized Doman...
. We present new tools allowing a formal classification of cellular automata, i.e. transfinite attr...
Dynamic properties of a one-dimensional probabilistic cellular automaton are studied by Monte Carlo ...
This volume of the Encyclopedia of Complexity and Systems Science, Second Edition, provides an autho...
Cellular automata are a model of parallel computing. It is well known that simple cellular automata ...
I study the Chaté-Manneville cellular-automata rules on randomly connected lattices. The periodic an...
AbstractThe classification of cellular automata rules by Wolfram into four universality classes is b...
The one-dimensional Domany-Kinzel cellular automaton is investigated by two numerical approaches: (i...
Spontaneous-search method and short-time dynamics: applications to the Domany-Kinzel cellular automa...
We consider a generalized version (including anisotropy) of the stochastic one-dimensional cellular ...
New analytic and numerical results for the one-dimensional Domany-Kinzel cellular automaton are pres...
We propose a method to detect phase transitions in discrete lattice models based on the roughness ex...
We study Domany-Kinzel cellular automata on small-world network. Every link on a one dimensional cha...
In a roughening process, the growth exponent β describes how the roughness w grows with the time t: ...
Stavskaya's model is a one-dimensional probabilistic cellular automaton (PCA) introduced in the end ...
Abstract. Series expansions have been derived for the percolation probability of a generalized Doman...
. We present new tools allowing a formal classification of cellular automata, i.e. transfinite attr...
Dynamic properties of a one-dimensional probabilistic cellular automaton are studied by Monte Carlo ...
This volume of the Encyclopedia of Complexity and Systems Science, Second Edition, provides an autho...
Cellular automata are a model of parallel computing. It is well known that simple cellular automata ...
I study the Chaté-Manneville cellular-automata rules on randomly connected lattices. The periodic an...
AbstractThe classification of cellular automata rules by Wolfram into four universality classes is b...