arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~

加权等周不等式蕴含渗流

Weighted isoperimetry implies percolation

Ivailo Hartarsky, Franco Severo, Augusto Teixeira

arXiv 2609.07768首次发表:更新:

发表机构

CNRS, IRL2924 Jean-Christophe Yoccoz, IMPA; CNRS, Sorbonne Université; IMPA(法国国家科学研究中心,让-克里斯托夫·约克兹国际研究联队2924,巴西高等研究所; 法国国家科学研究中心,索邦大学; 巴西高等研究所)

机构由 AI 辅助整理,请以论文原文为准。

AI 中文总结

本文证明在满足加权等周不等式的图上,当等周常数足够大时,以权重为概率的独立边开放会导致正概率的无穷连通,并应用于解决长程渗流截断和传递图临界概率上界两个猜想。

AI 中文摘要

考虑一个满足形如 $\\|\partial A\\|\geq C|A|^\alpha$(其中 $\alpha,C>0$)的等周不等式的无限边加权图,这里 $\\|\partial A\\|$ 表示 $A$ 的边界的加权大小。我们证明,对于依赖于 $\alpha$ 的足够大的 $C$,如果每条边独立地以由其权重给出的概率开放,那么任何顶点以正概率与无穷远相连。该结果在较弱的等周假设下以及在有限图上同样成立。该证明为最近关于同质权重相同问题的 Benjamini--Schramm 猜想的证明提供了新的视角。我们证明的关键新颖之处在于,我们不是简单地计数割集,而是引入了一种新的 Peierls 论证,该论证除了考虑阻塞表面的成本外,还考虑了内部和外部的连通性成本。我们为上述结果提供了两个应用。首先,我们证明在 $\mathbb{Z}^d$($d\geq 2$)上的每个不可求和的长程渗流都允许一个渗流截断,解决了 Sidoravicius、Surgailis 和 Vares 的猜想及其由 Friedli 和 de Lima 推广的版本。其次,我们证明存在一个普适常数 $C<\infty$,使得对于每个超线性增长且顶点度为 $\Delta$ 的传递图,有 $p_{\mathrm{c}} \leq C/\Delta$,从而证明了 Easo 和 Hutchcroft 的一个猜想。

英文摘要

Consider an infinite edge-weighted graph satisfying an isoperimetric inequality of the type $\|\partial A\|\geq C|A|^α$ for some $α,C>0$, where $\|\partial A\|$ denotes the weighted size of the edge boundary of $A$. We prove that, for $C$ large enough depending on $α$, if each edge is open independently with probability given by its weight, then any vertex is connected to infinity with positive probability. The result also holds under weaker isoperimetric assumptions and on finite graphs. The proof brings a new perspective on the recent proof of the Benjamini--Schramm conjecture concerning the same problem with homogeneous weights. The crucial novelty in our proof is that, rather than simply counting cutsets, we introduce a new Peierls argument which takes into account internal and external connectivity costs in addition to the cost of the blocking surface. We provide two applications for the above result. First, we show that every non-summable long-range percolation on $\mathbb{Z}^d$, $d\geq 2$, admits a percolating truncation, solving a conjecture of Sidoravicius, Surgailis and Vares and its generalization by Friedli and de Lima. Secondly, we show that there exists a universal constant $C < \infty$ such that $p_{\mathrm{c}} \leq C/Δ$ for every transitive graph of superlinear growth and vertex degree $Δ$, thus proving a conjecture of Easo and Hutchcroft.

Comments14 pages, 3 figures

论文原文

arXiv 摘要页 · PDF 原文 · HTML 原文

↑