首页/论文/math/0206130

arXiv math/02061302002-06-12math.PR

Transience of percolation clusters on wedges

Omer Angel, Itai Benjamini, Noam Berger, Yuval Peres

备注：: 17 pages

英文摘要：

We study random walks on supercritical percolation clusters on wedges in $\Z^3$, and show that the infinite percolation cluster is (a.s.) transient whenever the wedge is transient. This solves a question raised by O. Haggstrom and E. Mossel. We also show that for convex gauge functions satisfying a mild regularity condition, the existence of a finite energy flow on $Z^2$ is equivalent to the (a.s.) existence of a finite energy flow on the supercritical percolation cluster. This solves a question of C. Hoffman.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Transience and anchored isoperimetric dimension of supercritical percolation clusters

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…

2022-07-11math.PR

Transience, Recurrence and Critical Behavior for Long-Range Percolation

We study the behavior of the random walk on the infinite cluster of independent long range percolation in dimensions $d=1,2$, where $x$ and $y$ a re connected with probability $\simβ/\|x-y\|^{-s}$. We show that when $d<s<2d$ the walk is transient, and when $s\geq 2d$, the walk is recurrent. The proof of transience is based on a renormalization argument. As a corollary of this renormalization argument, we get that for every dimension $d$, if $d<s<2d$, then critical percolation has no infinite clusters. This result is extended to the free random cluster model. A second corollary is that when $d\…

2014-03-03math.PR

Transience and recurrence of random walks on percolation clusters in an ultrametric space

We study existence of percolation in the hierarchical group of order $N$, which is an ultrametric space, and transience and recurrence of random walks on the percolation clusters. The connection probability on the hierarchical group for two points separated by distance $k$ is of the form $c_k/N^{k(1+δ)}, δ>-1$, with $c_k=C_0+C_1\log k+C_2k^α$, non-negative constants $C_0, C_1, C_2$, and $α>0$. Percolation was proved in Dawson and Gorostiza (2013) for $δ<1$, and for the critical case, $δ=1,C_2>0$, with $α>2$. In this paper we improve the result for the critical case by showing percolation for $…

2016-02-08math.PR

A study of random walks on wedges

In this paper we develop the idea of Lyons and gives a simple criterion for the recurrence and the transience. We also show that a wedge has the infinite collision property if and only if it is a recurrent graph.

2012-09-14math.PR

Inhomogeneous long-range percolation in the weak decay regime

We study a general class of percolation models in Euclidean space including long-range percolation, scale-free percolation, the weight-dependent random connection model and several other previously investigated models. Our focus is on the weak decay regime, in which inter-cluster long-range connection probabilities fall off polynomially with small exponent, and for which we establish several structural properties. Chief among them are the continuity of the bond percolation function and the transience of infinite clusters.

2023-03-06math.PR

Structures in supercritical scale-free percolation

Scale-free percolation is a percolation model on $\mathbb{Z}^d$ which can be used to model real-world networks. We prove bounds for the graph distance in the regime where vertices have infinite degrees. We fully characterize transience vs. recurrence for dimension 1 and 2 and give sufficient conditions for transience in dimension 3 and higher. Finally, we show the existence of a hierarchical structure for parameters where vertices have degrees with infinite variance and obtain bounds on the cluster density.

2016-11-09math.COmath.PR

更多相关论文收起更多论文

Slightly supercritical percolation on nonamenable graphs II: Growth and isoperimetry of infinite clusters

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)…

2022-07-07math.PR

从局部巨集到长程渗流中的局部性

From local giants to locality in long-range percolation

Delft University of Technology（代尔夫特理工大学）

研究在特定多项式增长传递图上长程渗流的Schramm局部性猜想类似物，通过构建重整化方案证明相关结果，包括渗流概率联合连续性、超临界锐度等，还得出大数定律，回答了特定问题。

2026-07-21math.GRmath.PR

A note on percolation on Z^d: isoperimetric profile via exponential cluster repulsion

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…

2016-08-12math.COmath.PR

Heat Kernel Upper Bounds on Long Range Percolation Clusters

In this paper, we derive upper bounds for the heat kernel of the simple random walk on the infinite cluster of a supercritical long range percolation process. For any $d \geq 1$ and for any exponent $s \in (d, (d+2) \wedge 2d)$ giving the rate of decay of the percolation process, we show that the return probability decays like $t^{-\ffrac{d}{s-d}}$ up to logarithmic corrections, where $t$ denotes the time the walk is run. Moreover, our methods also yield generalized bounds on the spectral gap of the dynamics and on the diameter of the largest component in a box. Besides its intrinsic interest,…

2009-11-30math-phmath.MPmath.PR

长程渗流临界指数的等周下界

Isoperimetric lower bounds for critical exponents for long-range percolation

本文研究了 $\mathbb{Z}^d$ 上的独立长程渗流，通过建立临界指数与立方体等周性之间的联系，证明了临界指数 $δ$ 和 $2-η$ 的下界，并指出了其在特定维度和参数下的紧致性。

2023-10-28math-phmath.MPmath.PR

Quantitative noise sensitivity and exceptional times for percolation

One goal of this paper is to prove that dynamical critical site percolation on the planar triangular lattice has exceptional times at which percolation occurs. In doing so, new quantitative noise sensitivity results for percolation are obtained. The latter is based on a novel method for controlling the "level k" Fourier coefficients via the construction of a randomized algorithm which looks at random bits, outputs the value of a particular function but looks at any fixed input bit with low probability. We also obtain upper and lower bounds on the Hausdorff dimension of the set of percolating t…

2007-03-30math-phmath.FAmath.MP