Related papers: Peierls bounds from Toom contours
The properties of two-state nearest-neighbour cellular automata (CA) that are capable of density classification are discussed. It is shown that these CA actually conserve the total density, rather than merely classifying it. This is also…
Consider a graph $G=(V,E)$ and a random initial vertex-coloring, where each vertex is blue independently with probability $p_{b}$, and red with probability $p_r=1-p_b$. In each step, all vertices change their current color synchronously to…
A minimalistic model for chimera states is presented. The model is a cellular automaton (CA) which depends on only one adjustable parameter, the range of the nonlocal coupling, and is built from elementary cellular automata and the majority…
In this paper, we study Reiter's propositional default logic when the treewidth of a certain graph representation (semi-primal graph) of the input theory is bounded. We establish a dynamic programming algorithm on tree decompositions that…
In this work the stability of perturbed linear time-varying systems is studied. The main features of the problem are threefold. Firstly, the time-varying dynamics is not required to be continuous but allowed to have jumps. Also the system…
We systematically study the boundaries of one-dimensional, 2-color cellular automata depending on 4 cells, begun from simple initial conditions. We determine the exact growth rates of the boundaries that appear to be reducible. Morphic…
A common problem to all applications of linear finite dynamical systems is analyzing the dynamics without enumerating every possible state transition. Of particular interest is the long term dynamical behaviour. In this paper, we study the…
The stability of feedback systems consisting of linear time-delay plants and PID controllers has been investigated for many years by means of several methods, of which the Nyquist criterion, a generalization of the Hermite-Biehler Theorem,…
Nonlinear cellular automata are extensively used in simulations, image processing, cryptography, and so on. The determination of their fundamental properties, injectivity and surjectivity, related to information loss during the evolution,…
We propose novel parameter estimation algorithms for a class of dynamical systems with nonlinear parametrization. The class is initially restricted to smooth monotonic functions with respect to a linear functional of the parameters. We show…
We propose a quantitative direct method to prove the local stability of a stationary solution for a rough differential equation and its regular discretization scheme. Using Doss-Sussmann technique and stopping time analysis, we provide…
Most autonomous robotic agents use logic inference to keep themselves to safe and permitted behaviour. Given a set of rules, it is important that the robot is able to establish the consistency between its rules, its perception-based…
The search for symmetry as an unusual yet profoundly appealing phenomenon, and the origin of regular, repeating configuration patterns have long been a central focus of complexity science and physics. To better grasp and understand symmetry…
Cellular automata are capable of developing complex behaviors based on simple local interactions between their elements. Some of these characteristics have been used to propose and improve meta-heuristics for global optimization; however,…
Stability of linear systems with uncertain bounded time-varying delays is studied under assumption that the nominal delay values are not equal to zero. An input-output approach to stability of such systems is known to be based on the bound…
As the main contribution, this document provides a consistent discretization of a class of fixed-time stable systems, namely predefined-time stable systems. In the unperturbed case, the proposed approach allows obtaining not only a…
We study monotone cellular automata (also known as $\mathcal{U}$-bootstrap percolation) in $\mathbb{Z}^d$ with random initial configurations. Confirming a conjecture of Balister, Bollob\'as, Przykucki and Smith, who proved the corresponding…
The purpose of this note is to prove the celebrated Discrete Renewal Theorem in a common special case. We use only very elementary methods from real analysis, rather than markov chain theory, complex analysis, or generating functions.…
This papers shows that nonlinear filter in the case of deterministic dynamics is stable with respect to the initial conditions under the conditions that observations are sufficiently rich, both in the context of continuous and discrete time…
In this work, we provide two complementary perspectives for the (spectral) stability of solitary traveling waves in Hamiltonian nonlinear dynamical lattices, of which the Fermi-Pasta-Ulam and the Toda lattice are prototypical examples. One…