Raphaël Cerf, Barbara Dembin
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
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 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…
This paper studies anchored expansion, a non-uniform version of the strong isoperimetric inequality. We show that every graph with i-anchored expansion contains a subgraph with isoperimetric (Cheeger) constant at least i. We prove a conjecture by Benjamini, Lyons and Schramm (1999) that in such graphs the random walk escapes with a positive lim inf speed. We also show that anchored expansion implies a heat-kernel decay bound of order exp(-c n^1/3).
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…
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 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.
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…
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 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…
Large deviations for the isoperimetric constant in 2D percolation
本文研究二维超临界渗流巨分支等周常数的精细渐近行为，确定其大偏差概率，并揭示下尾区域中表面阶与体积阶之间的相变。
We study the isoperimetric subgraphs of the infinite cluster $\textbf{C}_\infty$ for supercritical bond percolation on $\mathbb{Z}^d$ with $d\geq 3$. Specifically, we consider the subgraphs of $\textbf{C}_\infty \cap [-n,n]^d$ which have minimal open edge boundary to volume ratio. We prove a shape theorem for these subgraphs, obtaining that when suitably rescaled, these subgraphs converge almost surely to a translate of a deterministic shape. This deterministic shape is itself an isoperimetric set for a norm we construct. As a corollary, we obtain sharp asymptotics on a natural modification of…
Supercritical sharpness of percolation
研究证明超临界渗透中，原点属于大有限簇的概率随等周函数指数衰减。
Quenched Invariance Principle for a Reflecting Diffusion in a Continuum Percolation Cluster
本文研究了平稳遍历点过程上的连续渗流，在占据区域存在唯一无界簇且满足体积正则性和等周条件的假设下，证明了簇上反射扩散的淬火不变性原理。
We prove that the heat kernel on the infinite Bernoulli percolation cluster in Z^d almost surely decays faster than t^{-d/2}. We also derive estimates on the mixing time for the random walk confined to a finite box. Our approach is based on local isoperimetric inequalities.
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…
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…
Benjamini, Lyons and Schramm [Random Walks and Discrete Potential Theory (1999) 56-84] considered properties of an infinite graph G, and the simple random walk on it, that are preserved by random perturbations. In this paper we solve several problems raised by those authors. The anchored expansion constant is a variant of the Cheeger constant; its positivity implies positive lower speed for the simple random walk, as shown by Virag [Geom. Funct. Anal. 10 (2000) 1588-1605]. We prove that if G has a positive anchored expansion constant, then so does every infinite cluster of independent percolat…
On the density of 2D critical percolation gaskets and anchored clusters
本文借助镜像法严格证明了锚定于边界点的二维临界渗流簇重整化密度公式，并建立了体—边界连接概率及任意共形圆盘区域中渗流垫圈密度的标度极限。
Limit of the Wulff crystal when approaching criticality for isoperimetry in 2D percolation
本文研究三角格点超临界点渗流无穷团簇的等周集，通过调整已有证明方法，证明重标度等周集收敛于归一化Wulff晶体的平移，且趋近临界点时Wulff晶体趋近欧氏圆盘，解决了相关点渗流版本猜想。
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…
Hermon and Hutchcroft have recently proved the long-standing conjecture that in Bernoulli(p) bond percolation on any nonamenable transitive graph G, at any p > p_c(G), the probability that the cluster of the origin is finite but has a large volume n decays exponentially in n. A corollary is that all infinite clusters have anchored expansion almost surely. They have asked if these results could hold more generally, for any finite energy ergodic invariant percolation. We give a counterexample, an invariant percolation on the 4-regular tree.
We consider the densities of clusters, at the percolation point of a two-dimensional system, which are anchored in various ways to an edge. These quantities are calculated by use of conformal field theory and computer simulations. We find that they are given by simple functions of the potentials of 2-D electrostatic dipoles, and that a kind of superposition {\it cum} factorization applies. Our results broaden this connection, already known from previous studies, and we present evidence that it is more generally valid. An exact result similar to the Kirkwood superposition approximation emerges.
Isoperimetric Inequalities and Supercritical Percolation on High-dimensional Graphs
本文建立正则高维乘积图的渐近尖锐等周不等式，并据此刻画超临界渗流巨分支的扩张、直径、混合时间与长路径，显著改进超立方体已知界。
Let G be a planar graph with polynomial growth and isoperimetric dimension bigger than 1. Then the critical p for Bernoulli percolation on G satisfies p<1.
The random-cluster model is a dependent percolation model that has applications in the study of Ising and Potts models. In this paper, several new results are obtained for the random-cluster model on nonamenable graphs with cluster parameter $q\geq 1$. Among these, the main ones are the absence of percolation for the free random-cluster measure at the critical value, and examples of planar regular graphs with regular dual where $\pc^\f (q) > \pu^\w (q)$ for $q$ large enough. The latter follows from considerations of isoperimetric constants, and we give the first nontrivial explicit calculation…
Local Central Limit Theorem for Reflecting Diffusions in a Continuum Percolation Cluster
本文研究连续渗流簇上的反射扩散问题，在无界簇唯一且满足若干几何条件的假设下，证明了对应的淬火局部中心极限定理。
In this article, we consider random walk on the infinite cluster of bond percolation on $\Z^d (d \geq 2)$. We show that the Laplace transformation of the number of visited points $N\_n$, has a behaviour as the random walk was on $\Z^d$. More precisely, for all $0<α<1$, we proved that there exist constants $C\_i$ and $C\_s$ such that for all infinite cluster that contains the origin, we have: $$ e^{-C\_i n^{\frac{d}{d+2}}} \leq \E\_0^ω (α^{N\_n}) \leq e^{-C\_sn^{\frac{d}{d+2}}}.$$ Our approach is based on finding an isoperimetric inequalities on the infinite cluster, lifted on a wreath product …
Mixing time and isoperimetry of long-range percolation in the diffusive regime
该研究针对扩散 regime 下的长程渗流，证明超临界长程渗流巨连通分支上随机游走的混合时间量级为 n²，核心是通过巨连通分支内大连通集的 d 维等周不等式建立混合时间上界。
We prove quenched invariance principle for simple random walk on the unique infinite percolation cluster for a general class of percolation models on Z^d, d>=2, with long-range correlations introduced in arXiv:1212.2885, solving one of the open problems from there. This gives new results for random interlacements in dimension d>=3 at every level, as well as for the vacant set of random interlacements and the level sets of the Gaussian free field in the regime of the so-called local uniqueness (which is believed to coincide with the whole supercritical regime). An essential ingredient of our pr…
Isoperimetric lower bounds for critical exponents for long-range percolation
本文研究了 $\mathbb{Z}^d$ 上的独立长程渗流，通过建立临界指数与立方体等周性之间的联系，证明了临界指数 $δ$ 和 $2-η$ 的下界，并指出了其在特定维度和参数下的紧致性。
Mean-field behaviour of the random connection model on hyperbolic space
本文研究了 $d=2,3$ 维双曲空间上的随机连接模型，证明了随强度 $λ$ 变化存在渗滤相变，并通过临界渗滤簇的等周性质推导出与平均场值一致的临界指数。
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 admit bounded harmonic functions. A principal new finding on which these results are based is that such clusters admit invariant random subgraphs with positive isoperimetric constant. We also show that percolation clusters in any amenable Cayley graph almost surely admit no nonconstant harmonic Dirichlet functions. Conversely, on a Cayley graph admitting non…
We study the growth and isoperimetry of infinite clusters in slightly supercritical Bernoulli bond percolation on transitive nonamenable graphs under the $L^2$ boundedness condition ($p_c<p_{2\to 2}$). Surprisingly, we find that the volume growth of infinite clusters is always purely exponential (that is, the subexponential corrections to growth are bounded) in the regime $p_c<p<p_{2\to 2}$, even when the ambient graph has unbounded corrections to exponential growth. For $p$ slightly larger than $p_c$, we establish the precise estimates \begin{align*} \mathbf{E}_p \left[ \# B_\mathrm{int}(v,r)…
From local giants to locality in long-range percolation
研究在特定多项式增长传递图上长程渗流的Schramm局部性猜想类似物，通过构建重整化方案证明相关结果，包括渗流概率联合连续性、超临界锐度等，还得出大数定律，回答了特定问题。
Let $G$ be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on $G$. We prove that if $G$ is nonamenable and $p > p_c(G)$ then there exists a positive constant $c_p$ such that \[\mathbf{P}_p(n \leq |K| < \infty) \leq e^{-c_p n}\] for every $n\geq 1$, where $K$ is the cluster of the origin. We deduce the following two corollaries: 1. Every infinite cluster in supercritical percolation on a transitive nonamenable graph has anchored expansion almost surely. This answers positively a question of Benjamini, Lyons, and Schramm (1997). 2. For transitive nonamenabl…
Weighted isoperimetry implies percolation
本文证明在满足加权等周不等式的图上，当等周常数足够大时，以权重为概率的独立边开放会导致正概率的无穷连通，并应用于解决长程渗流截断和传递图临界概率上界两个猜想。
We consider a stationary and ergodic random field $\{ω(e) : e \in E_d\}$ that is parameterized by the edge set of the Euclidean lattice $\mathbb{Z}^d$, $d \geq 2$. The random variable $ω(e)$, taking values in $[0, \infty)$ and satisfying certain moment bounds, is thought of as the conductance of the edge $e$. Assuming that the set of edges with positive conductances give rise to a unique infinite cluster $\mathcal{C}_{\infty}(ω)$, we prove a quenched invariance principle for the continuous-time random walk among random conductances under relatively mild conditions on the structure of the infin…
Percolation through Isoperimetry
本文给出正则图等周性质的充分条件，证明随机子图在临界概率附近出现唯一线性大小巨型分量，并说明该条件在常数依赖和第二大分量阶方面均不可改进。
Supercritical percolation on finite transitive graphs I: Uniqueness of the giant component
该研究针对有限顶点传递图的伯努利边渗流，证明稀疏图序列的超临界巨片以高概率唯一，验证了Benjamini的相关猜想，并给出稠密图超临界唯一性的充要等周条件。
Non-triviality of the phase transition for percolation on finite transitive graphs
本文证明满足一定直径增长条件的有限顶点传递图列在 Bernoulli 边渗流中具有非平凡相变，验证了 Benjamini 猜想（精确到常数），并将结果推广到拟传递图及 Abel 群 Cayley 图，同时给出无限图唯一性相的等周准则和临界概率在 1 处的间隙性质。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。