Critical probabilities and convergence time of Percolation Probabilistic Cellular Automata

In a recent article [arXiv:1108.5127] Park has shown that the four-state predator-prey model studied earlier in [J. Stat. Mech, L05001 (2011)] belongs to Directed Percolation (DP) universality class. It was claimed that predator density is not a reasonable order parameter, as there are many absorbing states; a suitably chosen order parameter shows DP critical behavior. In this article, we argue that the configuration that does not have any predator is the only dynamically acc...

We present a coupled decreasing sequence of random walks on $ \mathbb Z $ that dominates the edge process of oriented-bond percolation in two dimensions. Using the concept of "random walk in a strip ", we construct an algorithm that generates an increasing sequence of lower bounds that converges to the critical probability of oriented-bond percolation. Numerical calculations of the first ten lower bounds thereby generated lead to an improved,i.e. higher, rigorous lower bound ...

We study the cluster-size distribution of supercritical long-range percolation on $\mathbb{Z}^d$, where two vertices $x,y\in\mathbb{Z}^d$ are connected by an edge with probability $\mathrm{p}(\|x-y\|):=p\min\{1,\beta^\alpha\|x-y\|^{-\alpha d}\}$ for parameters $p\in(0, 1)$, $\alpha>1$, and $\beta>0$. We show that when $\alpha>1+1/d$, and either $\beta$ or $p$ is sufficiently large, the probability that the origin is in a finite cluster of size at least $k$ decays as $\exp\big...

The fourfold research proposal regards in particular: critical oriented percolation; random walk limit laws; neural networks with long-range connections; the ant in a labyrinth.

Consider critical site percolation on $\mathbb{Z}^d$ with $d \geq 2$. We prove a lower bound of order $n^{- d^2}$ for point-to-point connection probabilities, where $n$ is the distance between the points. Most of the work in our proof concerns a `construction' which finally reduces the problem to a topological one. This is then solved by applying a topological fact, which follows from Brouwer's fixed point theorem. Our bound improves the lower bound with exponent $2 d (d-1)$,...

We prove that there exist natural generalizations of the classical bootstrap percolation model on $\mathbb{Z}^2$ that have non-trivial critical probabilities, and moreover we characterize all homogeneous, local, monotone models with this property. Van Enter (in the case $d=r=2$) and Schonmann (for all $d \geq r \geq 2$) proved that $r$-neighbour bootstrap percolation models have trivial critical probabilities on $\mathbb{Z}^d$ for every choice of the parameters $d \geq r \g...

We consider a percolation model on square lattices with sites weighted by beta-distributed random variables $S\sim \mathrm{Beta}(a,b)$ with a positive real parameters $a>0$ and $b>0$. Using the Monte Carlo method, we estimate the percolation probability $P_\infty$ as a relative frequency $P^*_\infty$ averaged over the target subset of sites on a square lattice. As a result of the comparative analysis, we formulate two empirical hypotheses: the first on the correspondence of p...

We consider the Bernoulli bond percolation process $\mathbb{P}_{p,p'}$ on the nearest-neighbor edges of $\mathbb{Z}^d$, which are open independently with probability $p<p_c$, except for those lying on the first coordinate axis, for which this probability is $p'$. Define \[\xi_{p,p'}:=-\lim_{n\to\infty}n^{-1}\log \mathbb{P}_{p,p'}(0\leftrightarrow n\mathbf {e}_1)\] and $\xi_p:=\xi_{p,p}$. We show that there exists $p_c'=p_c'(p,d)$ such that $\xi_{p,p'}=\xi_p$ if $p'<p_c'$ and ...

We investigate the low-noise regime of a large class of probabilistic cellular automata, including the North-East-Center model of A. Toom. They are defined as stochastic perturbations of cellular automata with a binary state space and a monotonic transition function and possessing a property of erosion. These models were studied by A. Toom, who gave both a criterion for erosion and a proof of the stability of homogeneous space-time configurations. Basing ourselves on these ma...

Let $G_{n,p}^1$ be a superposition of the random graph $G_{n,p}$ and a one-dimensional lattice: the $n$ vertices are set to be on a ring with fixed edges between the consecutive vertices, and with random independent edges given with probability $p$ between any pair of vertices. Bootstrap percolation on a random graph is a process of spread of "activation" on a given realisation of the graph with a given number of initially active nodes. At each step those vertices which have ...