English
Related papers

Related papers: Percolation and local isoperimetric inequalities

200 papers

We consider site (vertex) percolation on $d$-regular graphs, for both constant-degree and growing-degree cases. We give sufficient, and relatively tight, conditions for the emergence of the ``Erd\H{o}s-R\'enyi component phenomenon" in the…

Combinatorics · Mathematics 2026-03-20 Sahar Diskin , Michael Krivelevich , Itay Markbreit

Consider the problem of determining the maximal induced subgraph in a random $d$-regular graph such that its components remain bounded as the size of the graph becomes arbitrarily large. We show, for asymptotically large $d$, that any such…

Probability · Mathematics 2019-11-05 Mustazee Rahman

On a locally finite, infinite tree $T$, let $p_c(T)$ denote the critical probability for Bernoulli percolation. We prove that every positively associated, finite-range dependent percolation model on $T$ with marginals $p > p_c(T)$ must…

Probability · Mathematics 2024-05-14 Laurin Köhler-Schindler , Aurelio L. Sulser

We prove a generalized isoperimetric inequality for a domain diffeomorphic to a sphere that replaces filling volume with $k$-dilation. Suppose $U$ is an open set in $\mathbb{R}^n$ diffeomorphic to a Euclidean $n$-ball. We show that in…

Differential Geometry · Mathematics 2022-12-29 Elia Portnoy

We study local modifications of the graph distance in large random triangulations. Our main results show that, in large scales, the modified distance behaves like a deterministic constant $\mathbf{c}~\in~(0,\infty)$ times the usual graph…

Probability · Mathematics 2015-11-16 Nicolas Curien , Jean-François Le Gall

We consider the anchored isoperimetric profile of the infinite open cluster, defined for $p > p\_c$, whose existence has been recently proved in [3]. We extend adequately the definition for $p = p\_c$, in finite boxes. We prove a partial…

Probability · Mathematics 2019-12-20 Raphaël Cerf , Barbara Dembin

We study the random geometry of first passage percolation on the complete graph equipped with independent and identically distributed edge weights, continuing the program initiated by Bhamidi and van der Hofstad [9]. We describe our results…

Probability · Mathematics 2015-12-23 M. Eckhoff , J. Goodman , R. van der Hofstad , F. R. Nardi

We prove an isoperimetric inequality for conjugation-invariant sets of size $k$ in $S_n$, showing that these necessarily have edge-boundary considerably larger than some other sets of size $k$ (provided $k$ is small). Specifically, let…

Combinatorics · Mathematics 2014-10-30 Neta Atzmon , David Ellis , Dmitry Kogan

In an investigation of percolation on isoradial graphs, we prove the criticality of canonical bond percolation on isoradial embeddings of planar graphs, thus extending celebrated earlier results for homogeneous and inhomogeneous square,…

Probability · Mathematics 2021-12-17 Geoffrey Grimmett , Ioan Manolescu

Let $i_t(G)$ be the number of independent sets of size $t$ in a graph $G$. Alavi, Erd\H{o}s, Malde and Schwenk made the conjecture that if $G$ is a tree then the independent set sequence $\{i_t(G)\}_{t\geq 0}$ of $G$ is unimodal; Levit and…

Combinatorics · Mathematics 2012-06-27 David Galvin

For a general class of percolation models with long-range correlations on $\mathbb Z^d$, $d\geq 2$, introduced in arXiv:1212.2885, we establish regularity conditions of Barlow arXiv:math/0302004 that mesoscopic subballs of all large enough…

Probability · Mathematics 2015-12-04 Artem Sapozhnikov

The existence (or not) of infinite clusters is explored for two stochastic models of intersecting line segments in $d \ge 2$ dimensions. Salient features of the phase diagram are established in each case. The models are based on site…

Probability · Mathematics 2021-12-15 Nicholas R. Beaton , Geoffrey R. Grimmett , Mark Holmes

We study the appearance of the giant component in random subgraphs of a given large finite graph G=(V,E) in which each edge is present independently with probability p. We show that if G is an expander with vertices of bounded degree, then…

Probability · Mathematics 2012-09-26 Itai Benjamini , Stéphane Boucheron , Gábor Lugosi , Raphaël Rossignol

We study the asymptotic growth of the diameter of a graph obtained by adding sparse "long" edges to a square box in $\Z^d$. We focus on the cases when an edge between $x$ and $y$ is added with probability decaying with the Euclidean…

Probability · Mathematics 2014-01-31 Marek Biskup

We study percolation on the hierarchical lattice of order $N$ where the probability of connection between two points separated by distance $k$ is of the form $c_k/N^{k(1+\delta)},\; \delta >-1$. Since the distance is an ultrametric, there…

Probability · Mathematics 2012-05-25 Donald Dawson , Luis Gorostiza

Let $(G_n) = \left((V_n,E_n)\right)$ be a sequence of finite connected vertex-transitive graphs with uniformly bounded vertex degrees such that $\lvert V_n \rvert \to \infty$ as $n \to \infty$. We say that percolation on $G_n$ has a sharp…

Probability · Mathematics 2024-08-23 Philip Easo

Given two independent Poisson point processes $\Phi^{(1)},\Phi^{(2)}$ in $R^d$, the continuum AB percolation model is the graph with points of $\Phi^{(1)}$ as vertices and with edges between any pair of points for which the intersection of…

Probability · Mathematics 2010-12-20 Srikanth K. Iyer , D. Yogeshwaran

I consider p-Bernoulli bond percolation on graphs of vertex-transitive tilings of the hyperbolic plane with finite sided faces (or, equivalently, on transitive, nonamenable, planar graphs with one end) and on their duals. It is known…

Probability · Mathematics 2012-12-11 Jan Czajkowski

Let G be a planar graph such that the volume function of G satisfies V(2n)< CV(n) for some constant C > 0. Then for every vertex v of G and integer n, there is a domain \Omega such that B(v,n) \subset \Omega, \Omega \subset B(v, 6n) and the…

Metric Geometry · Mathematics 2015-03-17 Itai Benjamini , Panos Papasoglu

The talk presented at ICMP 97 focused on the scaling limits of critical percolation models, and some other systems whose salient features can be described by collections of random lines. In the scaling limit we keep track of features seen…

Mathematical Physics · Physics 2007-05-23 Michael Aizenman