1,999 research outputs found
Boolean networks synchronism sensitivity and XOR circulant networks convergence time
In this paper are presented first results of a theoretical study on the role
of non-monotone interactions in Boolean automata networks. We propose to
analyse the contribution of non-monotony to the diversity and complexity in
their dynamical behaviours according to two axes. The first one consists in
supporting the idea that non-monotony has a peculiar influence on the
sensitivity to synchronism of such networks. It leads us to the second axis
that presents preliminary results and builds an understanding of the dynamical
behaviours, in particular concerning convergence times, of specific
non-monotone Boolean automata networks called XOR circulant networks.Comment: In Proceedings AUTOMATA&JAC 2012, arXiv:1208.249
Spatio-Temporal Patterns act as Computational Mechanisms governing Emergent behavior in Robotic Swarms
open access articleOur goal is to control a robotic swarm without removing its swarm-like nature. In other words, we aim to intrinsically control a robotic swarm emergent behavior. Past attempts at governing robotic swarms or their selfcoordinating emergent behavior, has proven ineffective, largely due to the swarm’s inherent randomness (making it difficult to predict) and utter simplicity (they lack a leader, any kind of centralized control, long-range communication, global knowledge, complex internal models and only operate on a couple of basic, reactive rules). The main problem is that emergent phenomena itself is not fully understood, despite being at the forefront of current research. Research into 1D and 2D Cellular Automata has uncovered a hidden computational layer which bridges the micromacro gap (i.e., how individual behaviors at the micro-level influence the global behaviors on the macro-level). We hypothesize that there also lie embedded computational mechanisms at the heart of a robotic swarm’s emergent behavior. To test this theory, we proceeded to simulate robotic swarms (represented as both particles and dynamic networks) and then designed local rules to induce various types of intelligent, emergent behaviors (as well as designing genetic algorithms to evolve robotic swarms with emergent behaviors). Finally, we analysed these robotic swarms and successfully confirmed our hypothesis; analyzing their developments and interactions over time revealed various forms of embedded spatiotemporal patterns which store, propagate and parallel process information across the swarm according to some internal, collision-based logic (solving the mystery of how simple robots are able to self-coordinate and allow global behaviors to emerge across the swarm)
Classification of Random Boolean Networks
We provide the first classification of different types of
Random Boolean Networks (RBNs). We study the differences
of RBNs depending on the degree of synchronicity and
determinism of their updating scheme. For doing so, we first
define three new types of RBNs. We note some similarities
and differences between different types of RBNs with the aid
of a public software laboratory we developed. Particularly, we
find that the point attractors are independent of the updating
scheme, and that RBNs are more different depending on their
determinism or non-determinism rather than depending on
their synchronicity or asynchronicity. We also show a way of
mapping non-synchronous deterministic RBNs into
synchronous RBNs. Our results are important for justifying
the use of specific types of RBNs for modelling natural
phenomena
On Spatial Consensus Formation: Is the Sznajd Model Different from a Voter Model?
In this paper, we investigate the so-called ``Sznajd Model'' (SM) in one
dimension, which is a simple cellular automata approach to consensus formation
among two opposite opinions (described by spin up or down). To elucidate the SM
dynamics, we first provide results of computer simulations for the
spatio-temporal evolution of the opinion distribution , the evolution of
magnetization , the distribution of decision times and
relaxation times . In the main part of the paper, it is shown that the
SM can be completely reformulated in terms of a linear VM, where the transition
rates towards a given opinion are directly proportional to frequency of the
respective opinion of the second-nearest neighbors (no matter what the nearest
neighbors are). So, the SM dynamics can be reduced to one rule, ``Just follow
your second-nearest neighbor''. The equivalence is demonstrated by extensive
computer simulations that show the same behavior between SM and VM in terms of
, , , , and the final attractor statistics. The
reformulation of the SM in terms of a VM involves a new parameter , to
bias between anti- and ferromagnetic decisions in the case of frustration. We
show that plays a crucial role in explaining the phase transition
observed in SM. We further explore the role of synchronous versus asynchronous
update rules on the intermediate dynamics and the final attractors. Compared to
the original SM, we find three additional attractors, two of them related to an
asymmetric coexistence between the opposite opinions.Comment: 22 pages, 20 figures. For related publications see
http://www.ais.fraunhofer.de/~fran
Boolean Delay Equations: A simple way of looking at complex systems
Boolean Delay Equations (BDEs) are semi-discrete dynamical models with
Boolean-valued variables that evolve in continuous time. Systems of BDEs can be
classified into conservative or dissipative, in a manner that parallels the
classification of ordinary or partial differential equations. Solutions to
certain conservative BDEs exhibit growth of complexity in time. They represent
therewith metaphors for biological evolution or human history. Dissipative BDEs
are structurally stable and exhibit multiple equilibria and limit cycles, as
well as more complex, fractal solution sets, such as Devil's staircases and
``fractal sunbursts``. All known solutions of dissipative BDEs have stationary
variance. BDE systems of this type, both free and forced, have been used as
highly idealized models of climate change on interannual, interdecadal and
paleoclimatic time scales. BDEs are also being used as flexible, highly
efficient models of colliding cascades in earthquake modeling and prediction,
as well as in genetics. In this paper we review the theory of systems of BDEs
and illustrate their applications to climatic and solid earth problems. The
former have used small systems of BDEs, while the latter have used large
networks of BDEs. We moreover introduce BDEs with an infinite number of
variables distributed in space (``partial BDEs``) and discuss connections with
other types of dynamical systems, including cellular automata and Boolean
networks. This research-and-review paper concludes with a set of open
questions.Comment: Latex, 67 pages with 15 eps figures. Revised version, in particular
the discussion on partial BDEs is updated and enlarge
- …