相关论文: Percolation, Perimetry, Planarity

We consider a dilute lattice obtained from the usual $\mathbb{Z}^3$ lattice by removing independently each of its columns with probability $1-\rho$. In the remaining dilute lattice independent Bernoulli bond percolation with parameter $p$…

Consider independent long range percolation on $\mathbf{Z}^2$, where horizontal and vertical edges of length $n$ are open with probability $p_n$. We show that if $\limsup_{n\to\infty}p_n>0,$ then there exists an integer $N$ such that…

We investigate the bond percolation model on transient weighted graphs ${G}$ induced by the excursion sets of the Gaussian free field on the corresponding metric graph. Under the sole assumption that its sign clusters do not percolate, we…

Consider subcritical Bernoulli bond percolation with fixed parameter p<p_c. We define a dependent site percolation model by the following procedure: for each bond cluster, we colour all vertices in the cluster black with probability r and…

For Bernoulli percolation on a given graph $G = (V,E)$ we consider the cluster of some fixed vertex $o \in V$. We aim at comparing the number of vertices of this cluster in the set $V_+$ and in the set $V_-$, where $V_+,V_- \subset V$ have…

We study Bernoulli bond percolation on a random recursive tree of size $n$ with percolation parameter $p(n)$ converging to $1$ as $n$ tends to infinity. The sizes of the percolation clusters are naturally stored in a tree. We prove…

The Hamming torus of dimension $d$ is the graph with vertices $\{1,\dots,n\}^d$ and an edge between any two vertices that differ in a single coordinate. Bootstrap percolation with threshold $\theta$ starts with a random set of open…

Consider a bipartite random geometric graph on the union of two independent homogeneous Poisson point processes in $d$-space, with distance parameter $r$ and intensities $\lambda,\mu$. We show for $d \geq 2$ that if $\lambda$ is…

We consider Bernoulli bond percolation on a large scale-free tree in the supercritical regime, meaning informally that there exists a giant cluster with high probability. We obtain a weak limit theorem for the sizes of the next largest…

It is known that many different types of finite random subgraph models undergo quantitatively similar phase transitions around their percolation thresholds, and the proofs of these results rely on isoperimetric properties of the underlying…

We show that on a Cayley graph of a nonamenable group, almost surely the infinite clusters of Bernoulli percolation are transient for simple random walk, that simple random walk on these clusters has positive speed, and that these clusters…

Exact or precise thresholds have been intensively studied since the introduction of the percolation model. Recently the critical polynomial $P_{\rm B}(p,L)$ was introduced for planar-lattice percolation models, where $p$ is the occupation…

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…

An isoperimetric upper bound on the resistance is given. As a corollary we resolve two problems, regarding mean commute time on finite graphs and resistance on percolation clusters. Further conjectures are presented.

We consider i.i.d. last-passage percolation on $\mathbb{Z}^2$ with weights having distribution $F$ and time-constant $g_F$. We provide an explicit condition on the large deviation rate function for independent sums of $F$ that determines…

We show that for all $d\in \{3,\ldots,n-1\}$ the size of the largest component of a random $d$-regular graph on $n$ vertices around the percolation threshold $p=1/(d-1)$ is $\Theta(n^{2/3})$, with high probability. This extends known…

We study bond percolation on the hypercube $\{0,1\}^m$ in the slightly subcritical regime where $p = p_c (1-\varepsilon_m)$ and $\varepsilon_m = o(1)$ but $\varepsilon_m \gg 2^{-m/3}$ and study the clusters of largest volume and diameter.…

Considering supercritical Bernoulli percolation on $\mathbb{Z}^d$, Garet and Marchand [GM09] proved a diffusive concentration for the graph distance. In this paper, we sharpen this result by establishing the subdiffusive concentration…

We make use of the recent proof that the critical probability for percolation on random Voronoi tessellations is 1/2 to prove the corresponding result for random Johnson-Mehl tessellations, as well as for two-dimensional slices of higher…

We study long-range Bernoulli percolation on $\mathbb{Z}^d$ in which each two vertices $x$ and $y$ are connected by an edge with probability $1-\exp(-\beta \|x-y\|^{-d-\alpha})$. It is a theorem of Noam Berger (CMP, 2002) that if…