SOME PROPERTIES OF LOCAL AND NONLOCAL SITE EXCHANGE DETERMINISTIC CELLULAR AUTOMATA

1994 ◽  
Vol 05 (03) ◽  
pp. 581-588 ◽  
Author(s):  
N. BOCCARA ◽  
M. ROGER

Stationary densities of nonzero sites of one-dimensional range-one deterministic cellular automata are shown to be functions of a parameter m characterizing the degree of mixing of site values. The mixing results from either a local or a nonlocal exchange of the site values. In particular, the asymptotic behavior of the stationary densities of nonzero sites for very small and very large values of the parameter m have been determined.

1994 ◽  
Vol 05 (03) ◽  
pp. 537-545 ◽  
Author(s):  
N. BOCCARA ◽  
J. NASSER ◽  
M. ROGER

We study the critical behavior of a probabilistic automata network whose local rule consists of two subrules. The first one, applied synchronously, is a probabilistic one-dimensional range-one cellular automaton rule. The second, applied sequentially, exchanges the values of a pair of sites. According to whether the two sites are first-neighbors or not, the exchange is said to be local or nonlocal. The evolution of the system depends upon two parameters, the probability p characterizing the probabilistic cellular automaton, and the degree of mixing m resulting from the exchange process. Depending upon the values of these parameters, the system exhibits a bifurcation similar to a second order phase transition characterized by a nonnegative order parameter, whose role is played by the stationary density of occupied sites. When m is very large, the correlations created by the application of the probabilistic cellular automaton rule are destroyed, and, as expected, the behavior of the system is then correctly predicted by a mean-field-type approximation. According to whether the exchange of the site values is local or nonlocal, the critical behavior is qualitatively different as m varies.


2004 ◽  
Vol 14 (09) ◽  
pp. 3217-3248 ◽  
Author(s):  
RAMÓN ALONSO-SANZ

Standard Cellular Automata (CA) are ahistoric (memoryless): i.e. the new state of a cell depends on the neighborhood configuration only at the preceding time step. This article introduces an extension to the standard framework of CA by considering automata implementing memory capabilities. While the update rules of the CA remains the same, each site remembers a weighted mean of all its past states, with a decreasing weight of states farther in the past. The historic weighting is defined by a geometric series of coefficients based on a memory factor (α). This paper considers the time evolution of one-dimensional range-two CA with memory.


2014 ◽  
Vol 35 (3) ◽  
pp. 568-574 ◽  
Author(s):  
Zhi-zhen Zhu ◽  
Zhi-da Zhang ◽  
Fa-lin Liu ◽  
Bin-bing Li ◽  
Chong-bin Zhou

Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1264
Author(s):  
Vladimir V. Uchaikin ◽  
Renat T. Sibatov ◽  
Dmitry N. Bezbatko

One-dimensional random walks with a constant velocity between scattering are considered. The exact solution is expressed in terms of multiple convolutions of path-distributions assumed to be different for positive and negative directions of the walk axis. Several special cases are considered when the convolutions are expressed in explicit form. As a particular case, the solution of A. S. Monin for a symmetric random walk with exponential path distribution and its generalization to the asymmetric case are obtained. Solution of fractional telegraph equation with the fractional material derivative is presented. Asymptotic behavior of its solution for an asymmetric case is provided.


2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Raffaela Capitanelli ◽  
Maria Agostina Vivaldi

AbstractIn this paper, we study asymptotic behavior of solutions to obstacle problems for p-Laplacians as {p\to\infty}. For the one-dimensional case and for the radial case, we give an explicit expression of the limit. In the n-dimensional case, we provide sufficient conditions to assure the uniform convergence of the whole family of the solutions of obstacle problems either for data f that change sign in Ω or for data f (that do not change sign in Ω) possibly vanishing in a set of positive measure.


2009 ◽  
Vol 29 (2) ◽  
pp. 381-418 ◽  
Author(s):  
V. V. M. S. CHANDRAMOULI ◽  
M. MARTENS ◽  
W. DE MELO ◽  
C. P. TRESSER

AbstractThe period doubling renormalization operator was introduced by Feigenbaum and by Coullet and Tresser in the 1970s to study the asymptotic small-scale geometry of the attractor of one-dimensional systems that are at the transition from simple to chaotic dynamics. This geometry turns out not to depend on the choice of the map under rather mild smoothness conditions. The existence of a unique renormalization fixed point that is also hyperbolic among generic smooth-enough maps plays a crucial role in the corresponding renormalization theory. The uniqueness and hyperbolicity of the renormalization fixed point were first shown in the holomorphic context, by means that generalize to other renormalization operators. It was then proved that, in the space ofC2+αunimodal maps, forα>0, the period doubling renormalization fixed point is hyperbolic as well. In this paper we study what happens when one approaches from below the minimal smoothness thresholds for the uniqueness and for the hyperbolicity of the period doubling renormalization generic fixed point. Indeed, our main result states that in the space ofC2unimodal maps the analytic fixed point is not hyperbolic and that the same remains true when adding enough smoothness to geta prioribounds. In this smoother class, calledC2+∣⋅∣, the failure of hyperbolicity is tamer than inC2. Things get much worse with just a bit less smoothness thanC2, as then even the uniqueness is lost and other asymptotic behavior becomes possible. We show that the period doubling renormalization operator acting on the space ofC1+Lipunimodal maps has infinite topological entropy.


Sign in / Sign up

Export Citation Format

Share Document