Related papers: Universality for monotone cellular automata
Probabilistic cellular automata are prototypes of non equilibrium critical phenomena. This class of models includes among others the directed percolation problem (Domany Kinzel model) and the dynamical Ising model. The critical properties…
An automata network (AN) is a finite graph where each node holds a state from a finite alphabet and is equipped with a local map defining the evolution of the state of the node depending on its neighbors. They are studied both from the…
We argue that the synchronization transition of stochastically coupled cellular automata, discovered recently by L.G. Morelli {\it et al.} (Phys. Rev. {\bf 58 E}, R8 (1998)), is generically in the directed percolation universality class. In…
Causal Graph Dynamics generalize Cellular Automata, extending them to bounded degree, time varying graphs. The dynamics rewrite the graph at each time step with respect to two physics-like symmetries: causality (bounded speed of…
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…
Universal dimensionless quantities, such as Binder ratios and wrapping probabilities, play an important role in the study of critical phenomena. We study the finite-size scaling behavior of the wrapping probability for the Potts model in…
We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of permutons. The limit depends on the generating series of the simple permutations in the class. Under a mild…
We consider a family of percolation models in which geometry and connectivity are defined by two independent random processes. Such models merge characteristics of discrete and continuous percolation. We develop an algorithm allowing…
We consider the cardinality of supercritical oriented bond percolation in two dimensions. We show that, whenever the origin is conditioned to percolate, the process appropriately normalized converges asymptotically in distribution to the…
We prove the universality of correlation functions of chiral unitary and unitary ensembles of random matrices in the microscopic limit. The essence of the proof consists in reducing the three-term recursion relation for the relevant…
Majority bootstrap percolation is a model of infection spreading in networks. Starting with a set of initially infected vertices, new vertices become infected once half of their neighbours are infected. Balogh, Bollob\'{a}s and Morris…
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…
We propose a novel density based numerical method for uncertainty propagation under certain partial differential equation dynamics. The main idea is to translate them into objects that we call cellular probabilistic automata and to evolve…
Consider a Boolean model $\Sigma$ in $\R^d$. The centers are given by a homogeneous Poisson point process with intensity $\lambda$ and the radii of distinct balls are i.i.d.\ with common distribution $\nu$. The critical covered volume is…
We analyze in full mathematical rigor the most general quartically perturbed invariant probability measure for a random tensor. Using a version of the Loop Vertex Expansion (which we call the mixed expansion) we show that the cumulants…
Cellular automata are a fundamental computational model with applications in mathematics, computer science, and physics. In this work, we explore the study of cellular automata to cases where the universe is a group, introducing the concept…
We introduce a model for the spreading of epidemics by long-range infections and investigate the critical behaviour at the spreading transition. The model generalizes directed bond percolation and is characterized by a probability…
The authors present evidence for universality in numerical computations with random data. Given a (possibly stochastic) numerical algorithm with random input data, the time (or number of iterations) to convergence (within a given tolerance)…
Majority bootstrap percolation is a monotone cellular automata that can be thought of as a model of infection spreading in networks. Starting with an initially infected set, new vertices become infected once more than half of their…
Kinetically constrained models (KCM) are reversible interacting particle systems on $\mathbb Z^d$ with continuous time Markov dynamics of Glauber type, which represent a natural stochastic (and non-monotone) counterpart of the family of…