Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one cluster of size at least c|G_n|, with probability going to one, uniformly in p. The method from Ajtai, Komlos and Szemeredi [Combinatorica 2 (1982) 1-7] is applied to obtain some new results about the critical probability for the emergence of a giant component in random subgraphs of finite regular expanding graphs of high girth, as well as a simple proof of a result of Kesten about the critical probability for bond percolation in high dimensions. Several problems and conjectures regarding percolation on finite transitive graphs are presented.
We use isoperimetric inequalities combined with a new technique to prove upper bounds for the site percolation threshold of plane graphs with given minimum degree conditions. In the process we prove tight new isoperimetric bounds for certain classes of hyperbolic graphs. This establishes the vertex isoperimetric constant for all triangular and square hyperbolic lattices, answering a question of Lyons and Peres. We prove that plane graphs of minimum degree at least $7$ have site percolation threshold bounded away from $1/2$, which was conjectured by Benjamini and Schramm, and make progress on a…
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 result which implies that, if the limit defining the anchored isoperimetric profile at $p\_c$ exists, it has to vanish.
We establish several equivalent characterisations of the anchored isoperimetric dimension of supercritical clusters in Bernoulli bond percolation on transitive graphs. We deduce from these characterisations together with a theorem of Duminil-Copin, Goswami, Raoufi, Severo, and Yadin that if $G$ is a transient transitive graph then the infinite clusters of Bernoulli percolation on $G$ are transient for $p$ sufficiently close to $1$. It remains open to extend this result down to the critical probability. Along the way we establish two new cluster repulsion inequalities that are of independent in…
We consider two different objects on super-critical Bernoulli percolation on $\mathbb{Z}^d$ : the time constant for i.i.d. first-passage percolation (for $d\geq 2$) and the isoperimetric constant (for $d=2$). We prove that both objects are continuous with respect to the law of the environment. More precisely we prove that the isoperimetric constant of supercritical percolation in $\mathbb{Z}^2$ is continuous in the percolation parameter. As a corollary we prove that normalized sets achieving the isoperimetric constant are continuous with respect to the Hausdroff metric. Concerning first-passag…
We consider an i.i.d. supercritical bond percolation on $\mathbb{Z}^d$, every edge is open with a probability $p > p_c (d)$, where $p_c (d)$ denotes the critical parameter for this percolation. We know that there exists almost surely a unique infinite open cluster $C_p$ [7]. We are interested in the regularity properties in p of the anchored isoperimetric profile of the infinite cluster $C_p$. For $d\ge2$, we prove that the anchored isoperimetric profile defined in [4] is Lipschitz continuous on all intervals $[p_0 , p_1 ] \subset (p_c (d), 1)$.
We consider the Cheeger constant $ϕ(n)$ of the giant component of supercritical bond percolation on $\mathbb{Z}^d/n\mathbb{Z}^d$. We show that the variance of $ϕ(n)$ is bounded by $\fracξ{n^d}$, where $ξ$ is a positive constant that depends only on the dimension $d$ and the percolation parameter.
We show that for all p>p_c(\Z^d) percolation parameters, the probability that the cluster of the origin is finite but has at least t vertices at distance one from the infinite cluster is exponentially small in t. We use this to give a short proof of the strongest version of the important fact that the isoperimetric profile of the infinite cluster basically coincides with the profile of the original lattice. This implies, e.g., that simple random walk on the largest cluster of a finite box [-n,n]^d with high probability has L^\infty-mixing time Θ(n^2), and that the heat kernel (return probabili…
In this paper we establish some relations between percolation on a given graph G and its geometry. Our main result shows that, if G has polynomial growth and satisfies what we call the local isoperimetric inequality of dimension d > 1, then p_c(G) < 1. This gives a partial answer to a question of Benjamini and Schramm. As a consequence of this result we derive, under the additional condition of bounded degree, that these graphs also undergo a non-trivial phase transition for the Ising-Model, the Widom-Rowlinson model and the beach model. Our techniques are also applied to dependent percolation…
Let $d\geq 2$. We consider an i.i.d. supercritical bond percolation on $\mathbb{Z}^d$, every edge is open with a probability $p>p_c(d)$, where $p_c(d)$ denotes the critical point. We condition on the event that $0$ belongs to the infinite cluster $\mathcal{C}_\infty$ and we consider connected subgraphs of $\mathcal{C}_\infty$ having at most $n^d$ vertices and containing $0$. Among these subgraphs, we are interested in the ones that minimize the open edge boundary size to volume ratio. These minimizers properly rescaled converge towards a translate of a deterministic shape and their open edge b…
In this paper necessary and sufficient conditions are presented for heat kernel upper bounds for random walks on weighted graphs. Several equivalent conditions are given in the form of isoperimetric inequalities.
We study the isoperimetric subgraphs of the giant component $\textbf{C}_n$ of supercritical bond percolation on the square lattice. These are subgraphs of $\textbf{C}_n$ having minimal edge boundary to volume ratio. In contrast to the work of Biskup, Louidor, Procaccia and Rosenthal, the edge boundary is taken only within $\textbf{C}_n$ instead of the full infinite cluster. The isoperimetric subgraphs are shown to converge almost surely, after rescaling, to the collection of optimizers of a continuum isoperimetric problem emerging naturally from the model. We also show that the Cheeger constan…
We extend generalized isoperimetric-type inequalities to iterated Brownian motion over several domains in $\RR{R}^{n}$. These kinds of inequalities imply in particular that for domains of finite volume, the exit distribution and moments of the first exit time for iterated Brownian motion are maximized with the ball $D^{*}$ centered at the origin, which has the same volume as $D$
In a recent paper A. Cianchi, N. Fusco, F. Maggi, and A. Pratelli have shown that, in the Gauss space, a set of given measure and almost minimal Gauss boundary measure is necessarily close to be a half-space. Using only geometric tools, we extend their result to all symmetric log-concave measures μon the real line. We give sharp quantitative isoperimetric inequalities and prove that among sets of given measure and given asymmetry (distance to half line, i.e. distance to sets of minimal perimeter), the intervals or complements of intervals have minimal perimeter.
In recent years, it has been shown that some classical inequalities follow from a local stochastic dominance for naturally associated random polytopes. We strengthen planar isoperimetric inequalities by attaching a stochastic model to some classical inequalities, such as Mahler's Theorem, and a reverse Lutwak-Zhang inequality, the polar for $L_p$ centroid bodies. In particular, we obtain the dual counterpart to a result of Bisztriczky-Böröczky.
Let $(E,\F,μ)$ be a $\si$-finite measure space. For a non-negative symmetric measure $J(\d x, \d y):=J(x,y) \,μ(\d x)\,μ(\d y)$ on $E\times E,$ consider the quadratic form $$\E(f,f):= \frac{1}{2}\int_{E\times E} (f(x)-f(y))^2 \, J(\d x,\d y)$$ in $L^2(μ)$. We characterize the relationship between the isoperimetric inequality and the super Poincaré inequality associated with $\E$. In particular, sharp Orlicz-Sobolev type and Poincaré type isoperimetric inequalities are derived for stable-like Dirichlet forms on $\R^n$, which include the existing fractional isoperimetric inequality as a special …
This is a continuation of our previous work 0712.4092. It is well known that various isoperimetric inequalities imply their functional ``counterparts'', but in general this is not an equivalence. We show that under certain convexity assumptions (e.g. for log-concave probability measures in Euclidean space), the latter implication can in fact be reversed for very general inequalities, generalizing a reverse form of Cheeger's inequality due to Buser and Ledoux. We develop a coherent single framework for passing between isoperimetric inequalities, Orlicz-Sobolev functional inequalities and capaci…
The purpose of this paper is to analyze the isoperimetric inequality for symmetric log-convex probability measures on the line. Using geometric arguments we first re-prove that extremal sets in the isoperimetric inequality are intervals or complement of intervals (a result due to Bobkov and Houdré). Then we give a quantitative form of the isoperimetric inequality, leading to a somehow anomalous behavior. Indeed, it could be that a set is very close to be optimal, in the sense that the isoperimetric inequality is almost an equality, but at the same time is very far (in the sense of the symmetri…
We prove upper and lower bounds of the heat kernel for the operator $Δ-\nabla (\frac{1}{|x|^α})\cdot \nabla $ in $\mathbb{R}^{n}\setminus\{0} $ where $α>0$. We obtain these bounds from an isoperimetric inequality for a measure $\mathrm{e}^{-\frac{1}{|x|^α}}dx$ on $\mathbb{R}^{n}\setminus \{0\}$. The latter amounts to a certain functional isoperimetric inequality for the radial part of this measure.
We consider the unique infinite connected component of supercritical bond percolation on the square lattice and study the geometric properties of isoperimetric sets, i.e., sets with minimal boundary for a given volume. For almost every realization of the infinite connected component we prove that, as the volume of the isoperimetric set tends to infinity, its asymptotic shape can be characterized by an isoperimetric problem in the plane with respect to a particular norm. As an application we then show that the anchored isoperimetric profile with respect to a given point as well as the Cheeger c…
In this paper we adapt the well-estabilished $Γ$-calculus techniques to the context of $RCD(K,\infty)$ spaces, proving Bobkov's local isoperimetric inequality and, when $K$ is positive, the Gaussian isoperimetric inequality in this class of spaces. The proof relies on the measure-valued $Γ_2$ operator introduced by Savaré.
Firstly, we derive in dimension one a new covariance inequality of $L_{1}-L_{\infty}$ type that characterizes the isoperimetric constant as the best constant achieving the inequality. Secondly, we generalize our result to $L_{p}-L_{q}$ bounds for the covariance. Consequently, we recover Cheeger's inequality without using the co-area formula. We also prove a generalized weighted Hardy type inequality that is needed to derive our covariance inequalities and that is of independent interest. Finally, we explore some consequences of our covariance inequalities for $L_{p}$-Poincaré inequalities and …
We study functional inequalities for Markov chains on discrete spaces with entropic Ricci curvature bounded from below. Our main results are that when curvature is non-negative, but not necessarily positive, the spectral gap, the Cheeger isoperimetric constant and the modified logarithmic Sobolev constant of the chain can be bounded from below by a constant that only depends on the diameter of the space, with respect to a suitable metric. These estimates are discrete analogues of classical results of Riemannian geometry obtained by Li and Yau, Buser and Wang.
We prove an isoperimetric inequality for the uniform measure on a uniformly convex body and for a class of uniformly log-concave measures (that we introduce). These inequalities imply (up to universal constants) the log-Sobolev inequalities proved by Bobkov--Ledoux as well as the isoperimetric inequalities due to Bakry-Ledoux and Bobkov--Zegarlinski. We also recover a concentration inequality for uniformly convex bodies, similar to that proved by Gromov--Milman.
By adapting some ideas of M. Ledoux \cite{ledoux2}, \cite{ledoux-stflour} and \cite{Led} to a sub-Riemannian framework we study Sobolev, Poincaré and isoperimetric inequalities associated to subelliptic diffusion operators that satisfy the generalized curvature dimension inequality that was introduced by F. Baudoin and N. Garofalo in \cite{Bau2}. Our results apply in particular on all CR Sasakian manifolds whose horizontal Webster-Tanaka-Ricci curvature is non negative, all Carnot groups with step two, and wide subclasses of principal bundles over Riemannian manifolds whose Ricci curvature is …
Various properties of isoperimetric, functional, Transport-Entropy and concentration inequalities are studied on a Riemannian manifold equipped with a measure, whose generalized Ricci curvature is bounded from below. First, stability of these inequalities with respect to perturbation of the measure is obtained. The extent of the perturbation is measured using several different distances between perturbed and original measure, such as a one-sided $L^\infty$ bound on the ratio between their densities, Wasserstein distances, and Kullback--Leibler divergence. In particular, an extension of the Hol…
The concentration of measure prenomenon roughly states that, if a set $A$ in a product $Ω^N$ of probability spaces has measure at least one half, ``most'' of the points of $Ω^N$ are ``close'' to $A$. We proceed to a systematic exploration of this phenomenon. The meaning of the word ``most'' is made rigorous by isoperimetric-type inequalities that bound the measure of the exceptional sets. The meaning of the work ``close'' is defined in three main ways, each of them giving rise to related, but different inequalities. The inequalities are all proved through a common scheme of proof. Remarkably, …
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a given star-shaped body. The complexity of the algorithm grows polynomially in the dimension and inverse polynomially in the fraction of the volume taken up by the kernel of the star-shaped body. The analysis is based on a new isoperimetric inequality. Our main technical contribution is a tool for proving such inequalities when the domain is not convex. As a consequence, we obtain a polynomial algorithm for computing the …
