July 29, 2015
In this paper a random graph model $G_{\mathbb{Z}^2_N,p_d}$ is introduced, which is a combination of fixed torus grid edges in $(\mathbb{Z}/N \mathbb{Z})^2$ and some additional random ones. The random edges are called long, and the probability of having a long edge between vertices $u,v\in(\mathbb{Z}/N \mathbb{Z})^2$ with graph distance $d$ on the torus grid is $p_d=c/Nd$, where $c$ is some constant. We show that, {\em whp}, the diameter $D(G_{\mathbb{Z}^2_N,p_d})=\Theta (\log N)$. Moreover, we consider non-monotonous bootstrap percolation on $G_{\mathbb{Z}^2_N,p_d}$. We prove the presence of phase transitions in mean-field approximation and provide fairly sharp bounds on the error of the critical parameters. Our model addresses interesting mathematical questions of non-monotonous bootstrap percolation, and it is motivated by recent results of brain research.
Similar papers 1
February 5, 2015
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 ...
November 6, 2014
Bootstrap percolation provides an emblematic instance of phase behavior characterised by an abrupt transition with diverging critical fluctuations. This unusual hybrid situation generally occurs in particle systems in which the occupation probability of a site depends on the state of its neighbours through a certain threshold parameter. In this paper we investigate the phase behavior of the bootstrap percolation on the regular random graph in the limit in which the threshold ...
September 26, 2018
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.
April 18, 2012
In this paper we study in complete generality the family of two-state, deterministic, monotone, local, homogeneous cellular automata in $\mathbb{Z}^d$ with random initial configurations. Formally, we are given a set $\mathcal{U}=\{X_1,\dots,X_m\}$ of finite subsets of $\mathbb{Z}^d\setminus\{\mathbf{0}\}$, and an initial set $A_0\subset\mathbb{Z}^d$ of `infected' sites, which we take to be random according to the product measure with density $p$. At time $t\in\mathbb{N}$, the...
December 22, 2005
We investigate the scaling of the largest critical percolation cluster on a large d-dimensional torus, for nearest-neighbor percolation in high dimensions, or when d>6 for sufficient spread-out percolation. We use a relatively simple coupling argument to show that this largest critical cluster is, with high probability, bounded above by a large constant times $V^{2/3}$ and below by a small constant times $V^{2/3}(log V)^{-4/3}$, where V is the volume of the torus. We also giv...
November 22, 2013
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...
February 19, 2009
We examine bootstrap percolation in d-dimensional, directed metric graphs in the context of recent measurements of firing dynamics in 2D neuronal cultures. There are two regimes, depending on the graph size N. Large metric graphs are ignited by the occurrence of critical nuclei, which initially occupy an infinitesimal fraction, f_* -> 0, of the graph and then explode throughout a finite fraction. Smaller metric graphs are effectively random in the sense that their ignition re...
May 17, 2012
In r-neighbour bootstrap percolation on the vertex set of a graph G, vertices are initially infected independently with some probability p. At each time step, the infected set expands by infecting all uninfected vertices that have at least r infected neighbours. We study the distribution of the time t at which all vertices become infected. Given t = t(n) = o(log n/log log n), we prove a sharp threshold result for the probability that percolation occurs by time t in d-neighbou...
February 13, 2007
In majority bootstrap percolation on a graph G, an infection spreads according to the following deterministic rule: if at least half of the neighbours of a vertex v are already infected, then v is also infected, and infected vertices remain infected forever. Percolation occurs if eventually every vertex is infected. The elements of the set of initially infected vertices, A \subset V(G), are normally chosen independently at random, each with probability p, say. This process ...
September 19, 2012
We study the percolation time of the $r$-neighbour bootstrap percolation model on the discrete torus $(\Z/n\Z)^d$. For $t$ at most a polylog function of $n$ and initial infection probabilities within certain ranges depending on $t$, we prove that the percolation time of a random subset of the torus is exactly equal to $t$ with high probability as $n$ tends to infinity. Our proof rests crucially on three new extremal theorems that together establish an almost complete understa...