Celulární automat a CML systémy

The main aim of this thesis is the study of cellular automata and discrete dynamical systems on a lattice. Both tools, cellular automata as well as dynamical systems on a lattice are introduced and elementary properties described. The relation between cellular automata and dynamical system on lattice is derived. The main goal of the thesis is also the use of the cellular automata as that mathematical tool of evolution visualization of discrete dynamical systems. The theory of cellular automata is applied to the discrete dynamical systems on a lattice Laplacian type and implemented in Java language.Hlavním cílem práce je studium vztahu celulárních automatů a diskrétních dynamických systémů na mřížce. Oba nástroje, jak celulární automat tak dynamický systém na mřížce, jsou zavedeny a jejich základní vlastnosti popsány. Vztah mezi celulárními automaty a dynamickými systémy na mřížce je podrobně popsán. Hlavním cílem práce je dále použití nástroje celulárního automatu jako matematického vizualizačního prostředku evoluce diskrétních dynamických systémů. Teorie celulárních automatů je použita na dynamické systémy na mřížce Lamplaceova typu a implementována v prostředí Java.470 - Katedra aplikované matematikyvelmi dobř

Chaotic Scattering Theory, Thermodynamic Formalism, and Transport Coefficients

The foundations of the chaotic scattering theory for transport and reaction-rate coefficients for classical many-body systems are considered here in some detail. The thermodynamic formalism of Sinai, Bowen, and Ruelle is employed to obtain an expression for the escape-rate for a phase space trajectory to leave a finite open region of phase space for the first time. This expression relates the escape rate to the difference between the sum of the positive Lyapunov exponents and the K-S entropy for the fractal set of trajectories which are trapped forever in the open region. This result is well known for systems of a few degrees of freedom and is here extended to systems of many degrees of freedom. The formalism is applied to smooth hyperbolic systems, to cellular-automata lattice gases, and to hard sphere sytems. In the latter case, the goemetric constructions of Sinai {\it et al} for billiard systems are used to describe the relevant chaotic scattering phenomena. Some applications of this formalism to non-hyperbolic systems are also discussed.Comment: 35 pages, compressed file, follow directions in header for ps file. Figures are available on request from [email protected]

What Is a Macrostate? Subjective Observations and Objective Dynamics

We consider the question of whether thermodynamic macrostates are objective consequences of dynamics, or subjective reflections of our ignorance of a physical system. We argue that they are both; more specifically, that the set of macrostates forms the unique maximal partition of phase space which 1) is consistent with our observations (a subjective fact about our ability to observe the system) and 2) obeys a Markov process (an objective fact about the system's dynamics). We review the ideas of computational mechanics, an information-theoretic method for finding optimal causal models of stochastic processes, and argue that macrostates coincide with the ``causal states'' of computational mechanics. Defining a set of macrostates thus consists of an inductive process where we start with a given set of observables, and then refine our partition of phase space until we reach a set of states which predict their own future, i.e. which are Markovian. Macrostates arrived at in this way are provably optimal statistical predictors of the future values of our observables.Comment: 15 pages, no figure

Revisiting the Edge of Chaos: Evolving Cellular Automata to Perform Computations

We present results from an experiment similar to one performed by Packard (1988), in which a genetic algorithm is used to evolve cellular automata (CA) to perform a particular computational task. Packard examined the frequency of evolved CA rules as a function of Langton's lambda parameter (Langton, 1990), and interpreted the results of his experiment as giving evidence for the following two hypotheses: (1) CA rules able to perform complex computations are most likely to be found near ``critical'' lambda values, which have been claimed to correlate with a phase transition between ordered and chaotic behavioral regimes for CA; (2) When CA rules are evolved to perform a complex computation, evolution will tend to select rules with lambda values close to the critical values. Our experiment produced very different results, and we suggest that the interpretation of the original results is not correct. We also review and discuss issues related to lambda, dynamical-behavior classes, and computation in CA. The main constructive results of our study are identifying the emergence and competition of computational strategies and analyzing the central role of symmetries in an evolutionary system. In particular, we demonstrate how symmetry breaking can impede the evolution toward higher computational capability.Comment: 38 pages, compressed .ps files (780Kb) available ONLY thru anonymous ftp. (Instructions available via `get 9303003' .

Statistical Mechanics of Surjective Cellular Automata

Reversible cellular automata are seen as microscopic physical models, and their states of macroscopic equilibrium are described using invariant probability measures. We establish a connection between the invariance of Gibbs measures and the conservation of additive quantities in surjective cellular automata. Namely, we show that the simplex of shift-invariant Gibbs measures associated to a Hamiltonian is invariant under a surjective cellular automaton if and only if the cellular automaton conserves the Hamiltonian. A special case is the (well-known) invariance of the uniform Bernoulli measure under surjective cellular automata, which corresponds to the conservation of the trivial Hamiltonian. As an application, we obtain results indicating the lack of (non-trivial) Gibbs or Markov invariant measures for "sufficiently chaotic" cellular automata. We discuss the relevance of the randomization property of algebraic cellular automata to the problem of approach to macroscopic equilibrium, and pose several open questions. As an aside, a shift-invariant pre-image of a Gibbs measure under a pre-injective factor map between shifts of finite type turns out to be always a Gibbs measure. We provide a sufficient condition under which the image of a Gibbs measure under a pre-injective factor map is not a Gibbs measure. We point out a potential application of pre-injective factor maps as a tool in the study of phase transitions in statistical mechanical models.Comment: 50 pages, 7 figure

Regular binary thermal lattice-gases

We analyze the power spectrum of a regular binary thermal lattice gas in two dimensions and derive a Landau-Placzek formula, describing the power spectrum in the low-wavelength, low frequency domain, for both the full mixture and a single component in the binary mixture. The theoretical results are compared with simulations performed on this model and show a perfect agreement. The power spectrums are found to be similar in structure as the ones obtained for the continuous theory, in which the central peak is a complicated superposition of entropy and concentration contributions, due to the coupling of the fluctuations in these quantities. Spectra based on the relative difference between both components have in general additional Brillouin peaks as a consequence of the equipartition failure.Comment: 20 pages including 9 figures in RevTex