Related papers: Peierls bounds from random Toom contours
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extension of regular graphs obtained by labelling the terminal arcs…
Stability and stabilization of linear port-Hamiltonian systems on infinite-dimensional spaces are investigated. This class is general enough to include models of beams and waves as well as transport and Schr\"odinger equations with boundary…
We investigate the low-noise regime of a large class of probabilistic cellular automata, including the North-East-Center model of Toom. They are defined as stochastic perturbations of cellular automata belonging to the category of monotonic…
A random boolean cellular automaton is a network of boolean gates where the inputs, the boolean function, and the initial state of each gate are chosen randomly. In this article, each gate has two inputs. Let $a$ (respectively $c$) be the…
We study the discrete dynamical system obtained by repeatedly applying the Pearson correlation operator to a real matrix. Each step centers every row, normalizes each centered row to unit Euclidean norm, and forms the Gram matrix of the…
We prove a homological stability theorem for families of discrete groups (e.g. mapping class groups, automorphism groups of free groups, braid groups) with coefficients in a sequence of irreducible algebraic representations of arithmetic…
In mathematics and engineering, control theory is concerned with the analysis of dynamical systems through the application of suitable control inputs. One of the prominent problems in control theory is controllability which concerns the…
We study the dynamics of (synchronous) one-dimensional cellular automata with cyclical boundary conditions that evolve according to the majority rule with radius $ r $. We introduce a notion that we term cell stability with which we express…
This brief gives a set of unified Lyapunov stability conditions to guarantee the predefined-time/finite-time stability of a dynamical systems. The derived Lyapunov theorem for autonomous systems establishes equivalence with existing…
We consider the problem of solving consensus using deterministic algorithms in a synchronous dynamic network with unreliable, directional point-to-point links, which are under the control of a message adversary. In contrast to a large body…
We study p-adic counterparts of stable distributions, that is limit distributions for sequences of normalized sums of independent identically distributed p-adic-valued random variables. In contrast to the classical case, non-degenerate…
The asymptotic behavior of a cellular automaton iterated on a random configuration is well described by its limit probability measure(s). In this paper, we characterize measures and sets of measures that can be reached as limit points after…
This paper studies the stability of discrete-time polynomial dynamical systems on hypergraphs by utilizing the Perron-Frobenius theorem for nonnegative tensors with respect to the tensors Z-eigenvalues and Z-eigenvectors. Firstly, for a…
The goal of the paper is to develop a systematic approach to the study of (perhaps degenerate) singularities of integrable systems and their structural stability. As the main tool, we use "hidden" system-preserving torus actions near…
There are recent shifts in demand for design controllers from simplified to complex model-based. Although simplification approaches are successful in many areas of engineering control systems, high-fidelity simulation-based control design,…
In this paper, we derive nearly tight probabilistic norm bounds for a class of random matrices we call graph matrices. While the classical case of symmetric matrices with independent random entries (Wigner's matrices) is a special case, in…
We study qualitative properties of two-dimensional freezing cellular automata with a binary state set initialized on a random configuration. If the automaton is also monotone, the setting is equivalent to bootstrap percolation. We explore…
We consider a long-range interacting particle system in which binary particles -- whose initial states are chosen uniformly at random -- are located at the nodes of a flat torus $(\mathbb{Z}/h\mathbb{Z})^2$. Each node of the torus is…
We prove a stability version of a general result that bounds the permanent of a matrix in terms of its operator norm. More specifically, suppose $A$ is an $n \times n$ matrix over $\mathbb{C}$ (resp. $\mathbb{R}$), and let $\mathcal{P}$…
This article introduces new tools to study self-organisation in a family of simple cellular automata which contain some particle-like objects with good collision properties (coalescence) in their time evolution. We draw an initial…