Dynamical Behavior of Cellular Automata

نویسندگان

  • Miles Kenyon
  • Matthew Driscoll
چکیده

Cellular Automata are simple computational models which can be leveraged to model a wide variety of dynamical systems. Composed of a lattice of discrete cells that take finite number of states based on previous iterations these models differ greatly from dynamic systems that vary continuously in space or time. However given their ability to model many of continuous systems, it could be postulated that certain cellular automata exhibit chaotic dynamics. This paper examines the the chaotic analysis of a specific class of Cellular Automata, Elementary Cellular Automata (ECA), using the Lyapunov Exponent as our primary measure of chaos. The Lyapunov Exponent for these cellular automata does not have a standardized definition, given the unique nature of this model and its relative youth as an area of study. We focused on two methods used to calculate the Lyapunov Exponent, both of which generally define the Lyapunov Exponent to be the rate of error propagation in time, yet differ in specific method. Given these two theoretical frameworks we stove to create an efficient numerical application to calculate the Lyapunov Exponent of ECA of arbitrary rule number.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Ant-Colony Optimization Clustering Model for Cellular Automata Routing in Wireless Sensor Networks

High efficient routing is an important issue for the design of wireless sensor network (WSN) protocols to meet the severe hardware and resource constraints. This paper presents an inclusive evolutionary reinforcement method. The proposed approach is a combination of Cellular Automata (CA) and Ant Colony Optimization (ACO) techniques in order to create collision-free trajectories for every agent...

متن کامل

Stable Dynamics of Sand Automata

In this paper, we study different notions of stability of sand automata, dynamical systems inspired by sandpile models and cellular automata. First, we study the topological stability properties of equicontinuity and ultimate periodicity, proving that they are equivalent. Then, we deal with nilpotency. The classical definition for cellular automata being meaningless in that setting, we define a...

متن کامل

Additive One-Dimensional Cellular Automata are Chaotic According to Devaney's Definition of Chaos

We study the chaotic behavior of a particular class of dynamical systems: cellular automata. We specialize the definition of chaos given by Devaney for general dynamical systems to the case of cellular automata. A dynamical system (X,F) is chaotic according to Devaney’s definition of chaos if its ~sition map F is sensitive to the initial conditions, topolo~cally transitive, and has dense period...

متن کامل

Novel Defect Terminolgy Beside Evaluation And Design Fault Tolerant Logic Gates In Quantum-Dot Cellular Automata

Quantum dot Cellular Automata (QCA) is one of the important nano-level technologies for implementation of both combinational and sequential systems. QCA have the potential to achieve low power dissipation and operate high speed at THZ frequencies. However large probability of occurrence fabrication defects in QCA, is a fundamental challenge to use this emerging technology. Because of these vari...

متن کامل

Nondeterministic and Stochastic Cellular Automata and Virus Dynamics

We discuss topological dynamical properties of stochastic cellular automata and nondeterministic cellular automata in the context of virus dynamics models. We consider surjectivity and topological transitivity, and we apply our definitions and results to existing models of dynamics that exhibit different behavior and capture properties of HIV and Ebola virus, labelling the behavior as H-dynamic...

متن کامل

A Cellular Automaton Based Algorithm for Mobile Sensor Gathering

In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009