Related papers: The critical percolation probability is local

To each edge (i,j), i<j of the complete directed graph on the integers we assign unit weight with probability p or weight x with probability 1-p, independently from edge to edge, and give to each path weight equal to the sum of its edge…

False-vacuum eternal inflation can be described as a random walk on the network of vacua of the string landscape. In this paper we show that the problem can be mapped naturally to a problem of directed percolation. The mapping relies on two…

We prove central limit theorems (CLTs) for topological functionals of Bernoulli bond percolation on infinite graphs beyond the Euclidean lattice $\mathbb{Z}^{d}$. For quasi-transitive graphs of subexponential growth, we show that the number…

We consider the bond percolation problem on a transient weighted graph induced by the excursion sets of the Gaussian free field on the corresponding cable system. Owing to the continuity of this setup and the strong Markov property of the…

We prove that the heavy clusters are indistinguishable for Bernoulli percolation on quasi-transitive nonunimodular graphs. As an application, we show that the uniqueness threshold of any quasi-transitive graph is also the threshold for…

In this paper we prove that the limiting distribution of the Chromatic number of a random graph $\mathcal{G}_{n,p}$, with fixed edge-probability $p$, after appropriate centering and scaling is Normal, when the number of vertices $n$, goes…

Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed…

In this article, local limit theorems for sequences of simple random walks on graphs are established. The results formulated are motivated by a variety of random graph models, and explanations are provided as to how they apply to…

We extend Smirnov's proof of the existence and conformal invariance of the scaling limit of critical site-percolation on the triangular lattice to particular sequences of periodic graphs with more arbitrary large-scale structure, obtained…

We provide sufficient conditions for a regular graph $G$ of growing degree $d$, guaranteeing a phase transition in its random subgraph $G_p$ similar to that of $G(n,p)$ when $p\cdot d\approx 1$. These conditions capture several well-studied…

In dynamical percolation, the status of every bond is refreshed according to an independent Poisson clock. For graphs which do not percolate at criticality, the dynamical sensitivity of this property was analyzed extensively in the last…

We prove that the probability the cluster of the origin in a subcritical Poisson random connection model (RCM) has size at least $n$ decays exponentially as $n$ increases, under minimal assumptions. We extend a recent method of Vanneuville…

It is shown that for any fixed $c \geq 3$ and $r$, the maximum possible chromatic number of a graph on $n$ vertices in which every subgraph of radius at most $r$ is $c$ colorable is $\tilde{\Theta}\left(n ^ {\frac{1}{r+1}} \right)$ (that…

We prove that critical percolation on any quasi-transitive graph of exponential volume growth does not have a unique infinite cluster. This allows us to deduce from earlier results that critical percolation on any graph in this class does…

Let $G$ be a nonamenable transitive unimodular graph. In dynamical percolation, every edge in $G$ refreshes its status at rate $\mu>0$, and following the refresh, each edge is open independently with probability $p$. The random walk…

We prove that every locally finite vertex-transitive graph $G$ admits a non-constant Lipschitz harmonic function.

We study oriented percolation on random causal triangulations, those are random planar graphs obtained roughly speaking by adding horizontal connections between vertices of an infinite tree. When the underlying tree is a geometric…

By bootstrap percolation we mean the following deterministic process on a graph $G$. Given a set $A$ of vertices "infected" at time 0, new vertices are subsequently infected, at each time step, if they have at least $r\in\mathbb{N}$…

We consider the Erdos-Renyi random graph G(n,p) inside the critical window, where p = 1/n + lambda * n^{-4/3} for some lambda in R. We proved in a previous paper (arXiv:0903.4730) that considering the connected components of G(n,p) as a…

We prove a local limit theorem for the probability of a site to be connected by disjoint paths to three points in subcritical Bernoulli percolation on $\mathbb{Z}^{d},\,d\geq2$ in the limit where their distances tend to infinity.