Complexity and transition to chaos in coupled Adler-type oscillators.

Coupled nonlinear oscillators are ubiquitous in dynamical studies. A wealth of behaviors have been found mostly for globally coupled systems. From a complexity perspective, less studied have been systems with local coupling, which is the subject of this contribution. The phase approximation is used, as weak coupling is assumed. In particular, the so-called needle region, in parameter space, for Adler-type oscillators with nearest neighbors coupling is carefully characterized. The reason for this emphasis is that, in the border of this region to the surrounding chaotic one, computation enhancement at the edge of chaos has been reported. The present study shows that different behaviors within the needle region can be found and a smooth change of dynamics could be identified. Entropic measures further emphasize the region's heterogeneous nature with interesting features, as seen in the spatiotemporal diagrams. The occurrence of wave-like patterns in the spatiotemporal diagrams points to nontrivial correlations in both dimensions. The wave patterns change as the control parameters change without exiting the needle region. Spatial correlation is only achieved locally at the onset of chaos, with different clusters of oscillators behaving coherently while disordered boundaries appear between them.

Computational capabilities at the edge of chaos for one dimensional systems undergoing continuous transitions.

While there has been a keen interest in studying computation at the edge of chaos for dynamical systems undergoing a phase transition, this has come under question for cellular automata. We show that for continuously deformed cellular automata, there is an enhancement of computation capabilities as the system moves towards cellular automata with chaotic spatiotemporal behavior. The computation capabilities are followed by looking into the Shannon entropy rate and the excess entropy, which allow identifying the balance between unpredictability and complexity. Enhanced computation power shows an increase of excess entropy, while the system entropy density has a sudden jump to values near one. The analysis is extended to a system of non-linear locally coupled oscillators that have been reported to exhibit spatiotemporal diagrams similar to cellular automata.

Phenomenology of coupled nonlinear oscillators.

A recently introduced model of coupled nonlinear oscillators in a ring is revisited in terms of its information processing capabilities. The use of Lempel-Ziv based entropic measures allows to study thoroughly the complex patterns appearing in the system for different values of the control parameters. Such behaviors, resembling cellular automata, have been characterized both spatially and temporally. Information distance is used to study the stability of the system to perturbations in the initial conditions and in the control parameters. The latter is not an issue in cellular automata theory, where the rules form a numerable set, contrary to the continuous nature of the parameter space in the system studied in this contribution. The variation in the density of the digits, as a function of time is also studied. Local transitions in the control parameter space are also discussed.

Lempel-Ziv complexity analysis of one dimensional cellular automata.

Lempel-Ziv complexity measure has been used to estimate the entropy density of a string. It is defined as the number of factors in a production factorization of a string. In this contribution, we show that its use can be extended, by using the normalized information distance, to study the spatiotemporal evolution of random initial configurations under cellular automata rules. In particular, the transfer information from time consecutive configurations is studied, as well as the sensitivity to perturbed initial conditions. The behavior of the cellular automata rules can be grouped in different classes, but no single grouping captures the whole nature of the involved rules. The analysis carried out is particularly appropriate for studying the computational processing capabilities of cellular automata rules.

On the non-randomness of maximum Lempel Ziv complexity sequences of finite size.

Random sequences attain the highest entropy rate. The estimation of entropy rate for an ergodic source can be done using the Lempel Ziv complexity measure yet, the exact entropy rate value is only reached in the infinite limit. We prove that typical random sequences of finite length fall short of the maximum Lempel-Ziv complexity, contrary to common belief. We discuss that, for a finite length, maximum Lempel-Ziv sequences can be built from a well defined generating algorithm, which makes them of low Kolmogorov-Chaitin complexity, quite the opposite to randomness. It will be discussed that Lempel-Ziv measure is, in this sense, less general than Kolmogorov-Chaitin complexity, as it can be fooled by an intelligent enough agent. The latter will be shown to be the case for the binary expansion of certain irrational numbers. Maximum Lempel-Ziv sequences induce a normalization that gives good estimates of entropy rate for several sources, while keeping bounded values for all sequence length, making it an alternative to other normalization schemes in use.

Stacking and twin faults in close-packed crystal structures: exact description of random faulting statistics for the full range of faulting probabilities.

The classical model of independent random single deformation faults and twin faulting in face-centered-cubic and hexagonal close packing is revisited. The model is extended to account for the whole range of faulting probabilities. The faulting process resulting in the final stacking sequences is described by several equivalent computational models. The probability sequence tree is established. Random faulting is described as a finite-state automaton machine. An expression giving the percent of hexagonality from the faulting probabilities is derived. The average sizes of the cubic and hexagonal domains are given as a function of single deformation and twinning fault probabilities. An expression for the probability of finding a given sequence within the complete stacking arrangement is also derived. The probability P(0)(Delta) of finding two layers of the same type Delta layers apart is derived. It is shown that previous generalizations did not account for all terms in the final probability expressions. The different behaviors of the P(0)(Delta) functions are discussed.