ID: 1204.3980

Monotone cellular automata in a random environment

April 18, 2012

View on ArXiv

Similar papers 5

Universality results for kinetically constrained spin models in two dimensions

January 5, 2018

84% Match
Fabio Martinelli, Robert Morris, Cristina Toninelli
Probability

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 cellular automata known as $\mathcal U$-bootstrap percolation. KCM also display some of the peculiar features of the so-called "glassy dynamics", and as such they are extensively used in the physics literature to model the liquid-glass transit...

Find SimilarView on arXiv

Asynchronism Induces Second Order Phase Transitions in Elementary Cellular Automata

March 23, 2007

84% Match
Nazim A. INRIA Lorraine - Loria Fatès
Cellular Automata and Lattic...

Cellular automata are widely used to model natural or artificial systems. Classically they are run with perfect synchrony, i.e., the local rule is applied to each cell at each time step. A possible modification of the updating scheme consists in applying the rule with a fixed probability, called the synchrony rate. For some particular rules, varying the synchrony rate continuously produces a qualitative change in the behaviour of the cellular automaton. We investigate the nat...

Find SimilarView on arXiv

The scaling limit of the incipient infinite cluster in high-dimensional percolation. I. Critical exponents

March 25, 1999

84% Match
Takashi Hara, Gordon Slade
Mathematical Physics

This is the first of two papers on the critical behaviour of bond percolation models in high dimensions. In this paper, we obtain strong joint control of the critical exponents eta and delta, for the nearest-neighbour model in very high dimensions d>>6 and for sufficiently spread-out models in all dimensions d>6. The exponent eta describes the low frequency behaviour of the Fourier transform of the critical two-point connectivity function, while delta describes the behaviour ...

Find SimilarView on arXiv

A survey on dynamical percolation

January 29, 2009

84% Match
Jeffrey E. Steif
Probability

Percolation is one of the simplest and nicest models in probability theory/statistical mechanics which exhibits critical phenomena. Dynamical percolation is a model where a simple time dynamics is added to the (ordinary) percolation model. This dynamical model exhibits very interesting behavior. Our goal in thissurvey is to give an overview of the work in dynamical percolation that has been done (and some of which is in the process of being written up).

Find SimilarView on arXiv

Percolation on Homology Generators in Codimension One

September 20, 2018

84% Match
Yasuaki Hiraoka, Tatsuya Mikami
Probability
Algebraic Topology

This paper introduces a new percolation model motivated from polymer materials. The mathematical model is defined over a random cubical set in the $d$-dimensional space $\mathbb{R}^d$ and focuses on generations and percolations of $(d-1)$-dimensional holes as higher dimensional topological objects. Here, the random cubical set is constructed by the union of unit faces in dimension $d-1$ which appear randomly and independently with probability $p$, and holes are formulated by ...

Find SimilarView on arXiv

Fully-connected bond percolation on $\mathbb{Z}^d$

February 12, 2021

84% Match
David Dereudre
Probability

We consider the bond percolation model on the lattice $\mathbb{Z}^d$ ($d\ge 2$) with the constraint to be fully connected. Each edge is open with probability $p\in(0,1)$, closed with probability $1-p$ and then the process is conditioned to have a unique open connected component (bounded or unbounded). The model is defined on $\mathbb{Z}^d$ by passing to the limit for a sequence of finite volume models with general boundary conditions. Several questions and problems are invest...

Find SimilarView on arXiv

Finite size scaling in three-dimensional bootstrap percolation

December 4, 1998

84% Match
Raphael Cerf, Emilio N. M. Cirillo
Statistical Mechanics

We consider the problem of bootstrap percolation on a three dimensional lattice and we study its finite size scaling behavior. Bootstrap percolation is an example of Cellular Automata defined on the $d$-dimensional lattice $\{1,2,...,L\}^d$ in which each site can be empty or occupied by a single particle; in the starting configuration each site is occupied with probability $p$, occupied sites remain occupied for ever, while empty sites are occupied by a particle if at least $...

Find SimilarView on arXiv

Two Phase Transitions in Two-way Bootstrap Percolation

September 26, 2018

84% Match
Ahad N. Zehmakan
Probability
Discrete Mathematics

Consider a graph $G$ and an initial random configuration, where each node is black with probability $p$ and white otherwise, independently. In discrete-time rounds, each node becomes black if it has at least $r$ black neighbors and white otherwise. We prove that this basic process exhibits a threshold behavior with two phase transitions when the underlying graph is a $d$-dimensional torus and identify the threshold values.

Find SimilarView on arXiv

Phase Transitions in a Probabilistic Cellular Automaton with Two Absorbing States

May 17, 1997

84% Match
F. Bagnoli, N. Boccara, P. Palmerini
Statistical Mechanics
Cellular Automata and Lattic...

We study the phase diagram and the critical behavior of a one-dimensional radius-1 two-state totalistic probabilistic cellular automaton having two absorbing states. This system exhibits a first-order phase transition between the fully occupied state and the empty state, two second-order phase transitions between a partially occupied state and either the fully occupied state or the empty state, and a second-order damage-spreading phase transition. It is found that all the sec...

Find SimilarView on arXiv

The sharp threshold for bootstrap percolation in all dimensions

October 16, 2010

84% Match
József Balogh, Béla Bollobás, ... , Morris Robert
Probability
Combinatorics
Dynamical Systems
Mathematical Physics

In r-neighbour bootstrap percolation on a graph G, a (typically random) set A of initially 'infected' vertices spreads by infecting (at each time step) vertices with at least r already-infected neighbours. This process may be viewed as a monotone version of the Glauber dynamics of the Ising model, and has been extensively studied on the d-dimensional grid $[n]^d$. The elements of the set A are usually chosen independently, with some density p, and the main question is to dete...

Find SimilarView on arXiv