Related papers: Peierls bounds from random Toom contours
The aim of this work is to establish a linear instability criterium of stationary solutions for the Korteweg-de Vries model on a star graph with a structure represented by a finite collections of semi-infinite edges. By considering a…
The stability of long-range order against quenched disorder is a central problem in statistical mechanics. This paper develops a generalized framework extending the Ding-Zhuang method and integrated with the Pirogov-Sinai framework,…
Unitarity of the global evolution is an extremely stringent condition on finite state models in discrete spacetime. Quantum cellular automata, in particular, are tightly constrained. In previous work we proved a simple No-go Theorem which…
We investigate the (generalized) Walsh decomposition of point-to-point effective resistances on countable random electric networks with i.i.d. resistances. We show that it is concentrated on low levels, and thus point-to-point effective…
We construct a parallel stochastic dynamics with invariant measure converging to the Gibbs measure of the low temperature Ising model. The proof of such convergence requires a polymer expansion based on suitably defined Peierls-type…
We give an algorithm to construct a translation-invariant transport kernel between ergodic stationary random measures $\Phi$ and $\Psi$ on $\mathbb R^d$, given that they have equal intensities. As a result, this yields a construction of a…
In this paper, we exploit the theory of dense graph limits to provide a new framework to study the stability of graph partitioning methods, which we call structural consistency. Both stability under perturbation as well as asymptotic…
This paper studies higher index theory for a random sequence of bounded degree, finite graphs with diameter tending to infinity. We show that in a natural model for such random sequences the following hold almost surely: the coarse…
The problem of characterizing which automatic sets of integers are stable is here solved. Given a positive integer $d$ and a subset $A\subseteq \mathbb{Z}$ whose set of representations base $d$ is recognized by a finite automaton, a…
In this dissertation, we study two of the global properties of 1-dimensional cellular automata (CAs) under periodic boundary condition, namely, reversibility and randomness. To address reversibility of finite CAs, we develop a mathematical…
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…
We characterise asymptotic stability of port-Hamiltonian systems by means of matrix conditions using well-known resolvent criteria from $C_0$-semigroup theory. The idea of proof is based on a recent characterisation of exponential stability…
This paper investigates the application of KAM theory to the stochastic nonlinear Schr\"{o}dinger equation on infinite lattices, focusing on the stability of low-dimensional invariant tori in the sense of most probable paths. For…
We study certificates in static data structures. In the cell-probe model, certificates are the cell probes which can uniquely identify the answer to the query. As a natural notion of nondeterministic cell probes, lower bounds for…
Classical Cellular Automata (CCAs) are a powerful computational framework for modeling global spatio-temporal dynamics with local interactions. While CCAs have been applied across numerous scientific fields, identifying the local rule that…
Given a finite subset $F$ of integer points in $\mathbb Z^d$, it is of interest to seek conditions on $F$ that allow it to multi-tile $\mathbb Z^d$ by translations. To this end, we give a discretized version of the Bombieri-Siegel formula,…
This paper studies the graph-theoretic conditions for stability of positive monotone systems. Using concepts from input-to-state stability and network small-gain theory, we first establish necessary and sufficient conditions for the…
This study presents a sampling-based method to guarantee robust stability of general control systems with uncertainty. The method allows the system dynamics and controllers to be represented by various data-driven models, such as Gaussian…
We prove a motivic stabilization result for the cohomology of the local systems on configuration spaces of varieties over $\mathbb{C}$ attached to character polynomials. Our approach interprets the stabilization as a probabilistic…
This work establishes a rigorous connection between stability properties of discrete-time algorithms (DTAs) and corresponding continuous-time dynamical systems derived through $ O(s^r) $-resolution ordinary differential equations (ODEs). We…