Marco Aymone, Marcelo R. Hilário, Bernardo N. B. de Lima, Vladas Sidoravicius
We study a dependent site percolation model on the $n$-dimensional Euclidean lattice where, instead of single sites, entire hyperplanes are removed independently at random. We extend the results about Bernoulli line percolation showing that the model undergoes a non-trivial phase transition and proving the existence of a transition from exponential to power-law decay within some regions of the subcritical phase.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We prove that the heavy clusters are indistinguishable for Bernoulli percolation on quasi-transitive nonunimodular graphs. As an application, we show that the uniqueness threshold of any quasi-transitive graph is also the threshold for connectivity decay. This resolves a question of Lyons and Schramm (1999) in the Bernoulli percolation case and confirms a conjecture of Schonmann (2001). We also prove that every infinite cluster of Bernoulli percolation on a nonamenable quasi-transitive graph is transient almost surely.
We consider Bernoulli hyper-edge percolation on $\mathbb{Z}^d$. This model is a generalization of Bernoulli bond percolation. An edge connects exactly two vertices and a hyper-edge connects more than two vertices. As in the classical Bernoulli bond percolation, we open hyper-edges independently in a homogeneous manner with certain probabilities parameterized by a parameter $u\in[0,1]$. We discuss conditions for non-trivial phase transitions when $u$ varies. We discuss the conditions for the uniqueness of the infinite cluster. Also, we provide conditions under which the Grimmett-Marstrand type …
We consider the Bernoulli Boolean discrete percolation model on the d-dimensional integer lattice. We study sufficient conditions on the distribution of the radii of balls placed at the points of a Bernoulli point process for the absence of percolation, provided that the intensity of the underlying point process is small enough. We also study a Harris graphical procedure to construct, forward in time, particle systems with interactions of infinite range under the assumption that the corresponding generator admits a Kalikow-type decomposition. We do so by using the subcriticality of the boolean…
We study a competition model on $\mathbb{Z}^d$ where the two infections are driven by supercritical Bernoulli percolations with distinct parameters $p$ and $q$. We prove that, for any $q$, there exist at most countably many values of $p<\min(q, \overrightarrow{p\_c})$ such that coexistence can occur.
Upper bounds for critical probabilities in Bernoulli Percolation models
本文研究了有向和无向伯努利渗流模型中临界概率的上界，针对d≥3的所有维度给出了严格的结果。
Locality of Bernoulli Site Percolation on Transitive Graphs
本文在顶点传递图上证明了伯努利点渗流临界概率的局部性，通过发展点渗流形式的双鬼不等式、锐阈值、滚雪球估计及非单模高度方法，并建立多尺度论证所需的丰富管几何。
For directed Bernoulli last passage percolation with i.i.d.~weights on vertices over a $n\times n$ grid and for $n$ large enough, the geodesics are shown to be concentrated in a cylinder, centered on the main diagonal and of width of order $n^{(2κ+2)/(2κ+3)}\sqrt{\ln n}$, where $1\leκ<\infty$ is the curvature power of the shape function at $(1,1)$. The methodology of proof is robust enough to also apply to directed Bernoulli first passage site percolation, and further to longest common subsequences in random words.
We consider Bernoulli percolation on a locally finite quasi-transitive unimodular graph and prove that two infinite clusters cannot have infinitely many pairs of vertices at distance 1 from one another or, in other words, that such graphs exhibit ``cluster repulsion.'' This partially answers a question of Häggström, Peres and Schonmann.
We consider the standard site percolation model on the three dimensional cubic lattice. Starting solely with the hypothesis that $θ(p)>0$, we prove that, for any $α>0$, there exists $κ>0$ such that, with probability larger than $1-1/n^α$, every pair of vertices inside the box $Λ(n)$ are joined by a path having at most $κ(\ln n)^2$ closed sites.
Benjamini and Kesten introduced in 1995 the problem of embedding infinite binary sequences into a Bernoulli percolation configuration, known as "percolation of words". We give a positive answer to their Open Problem 2: almost surely, all words are seen for site percolation on Z^3 with parameter p = 1/2. We also extend this result in various directions, proving the same result for any dimension d at least three and for any value p in the interval (p_c(Z^d), 1 - p_c(Z^d)), and for restrictions to slabs. Finally, we provide an explicit estimate on the probability to find all words starting from a…
For the d-dimensional model of a subcritical bond percolation (p<p_c) and a point \vec{a} in Z^d, we prove that a cluster conditioned on connecting points (0,...,0) and n\vec{a} if scaled by 1/(n|vec{a}|) along \vec{a} and by 1/sqrt{n} in the orthogonal direction converges asymptotically to Time x (d-1)-dimensional Brownian Bridge.
Consider Bernoulli bond percolation on a locally finite, connected graph $G$ and let $p_{\mathrm{cut}}$ be the threshold corresponding to a "first-moment method" lower bound. Kahn (\textit{Electron.\ Comm.\ Probab.\ Volume 8, 184-187.} (2003)) constructed a counter-example to Lyons' conjecture of $p_{\mathrm{cut}}=p_c$ and proposed a modification. Here we give a positive answer to Kahn's modified question. The key observation is that in Kahn's modification, the new expectation quantity also appears in the differential inequality of one-arm events. This links the question to a lemma of Duminil-…
Critical Poisson hyperplane percolation in hyperbolic space has no unbounded cells
该研究证明在双曲空间中，临界强度下泊松超平面渗流不存在无界单元，揭示了该模型的基本相变特性。
Exponential decay of the volume for Bernoulli percolation: a proof via stochastic comparison
针对连通传递等特性的无限局部有限图上的次临界伯努利渗流，提出不依赖微分不等式、受Russo相关论文启发的基于随机比较技术的团簇体积指数衰减性质新短证明。
In this note we study some properties of infinite percolation clusters on non-amenable graphs. In particular, we study the percolative properties of the complement of infinite percolation clusters. An approach based on mass-transport is adapted to show that for a large class of non-amenable graphs, the graph obtained by removing each site contained in an infinite percolation cluster has critical percolation threshold which can be arbitrarily close to the critical threshold for the original graph, almost surely, as p approaches p_c. Closely related is the self-destructive percolation process, i…
In this paper, we establish moderate deviations for the chemical distance in Bernoulli percolation. The chemical distance between two points is the length of the shortest open path between these two points. Thus, we study the size of random fluctuations around the mean value, and also the asymptotic behavior of this mean value. The estimates we obtain improve our knowledge of the convergence to the asymptotic shape. Our proofs rely on concentration inequalities proved by Boucheron, Lugosi and Massart, and also on the approximation theory of subadditive functions initiated by Alexander.
We investigate the problem of embedding infinite binary sequences into Bernoulli site percolation on $\mathbb{Z}^d$ with parameter $p$, known also as percolation of words.\ In 1995, I.\ Benjamini and H.\ Kesten proved that, for $d \geq 10$ and $p=1/2$, all sequences can be embedded, almost surely. They conjectured that the same should hold for $d \geq 3$. In this paper we consider $d \geq 3$ and $p \in (p_c(d), 1-p_c(d))$, where $p_c(d)<1/2$ is the critical threshold for site percolation on $\mathbb{Z}^d$. We show that there exists an integer $M = M (p)$, such that, a.s., every binary sequence…
We explore the survival function for percolation on Galton-Watson trees. Letting $g(T,p)$ represent the probability a tree $T$ survives Bernoulli percolation with parameter $p$, we establish several results about the behavior of the random function $g(\mathbf{T} , \cdot)$, where $\mathbf{T}$ is drawn from the Galton-Watson distribution. These include almost sure smoothness in the supercritical region; an expression for the $k\text{th}$-order Taylor expansion of $g(\mathbf{T} , \cdot)$ at criticality in terms of limits of martingales defined from $\mathbf{T}$ (this requires a moment condition d…
We show quenched large deviations for the simple random walk on a certain class of percolations with long-range correlations. This class contains the supercritical Bernoulli percolations, the model considered by Drewitz, R'ath and Sapozhnikov and the random-cluster model up to the slab critical point. Our result is an extension of Kubota's result for the supercritical Bernoulli percolations. We also state a shape theorem for the chemical distance, which is an extension of Garet and Marchand's result for the supercritical Bernoulli percolations.
Consider an anisotropic independent bond percolation model on the $d$-dimensional hypercubic lattice, $d\geq 2$, with parameter $p$. We show that the two point connectivity function $P_{p}(\{(0,\dots,0)\leftrightarrow (n,0,\dots,0)\})$ is a monotone function in $n$ when the parameter $p$ is close enough to 0. Analogously, we show that truncated connectivity function $P_{p}(\{(0,\dots,0)\leftrightarrow (n,0,\dots,0), (0,\dots,0)\nleftrightarrow\infty\})$ is also a monotone function in $n$ when $p$ is close to 1.
The chemical distance D(x,y) is the length of the shortest open path between two points x and y in an infinite Bernoulli percolation cluster. In this work, we study the asymptotic behaviour of this random metric, and we prove that, for an appropriate norm $μ$ depending on the dimension and the percolation parameter, the probability of the event \[\biggl\{0\leftrightarrow x,\frac{D(0,x)}{μ(x)}\notin (1-ε, 1+ε) \biggr\}\] exponentially decreases when $\|x\|_1$ tends to infinity. From this bound we also derive a large deviation inequality for the corresponding asymptotic shape result.
We consider an i.i.d. supercritical bond percolation on 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 [11]. We are interested in the regularity properties of the chemical distance for supercritical Bernoulli percolation. The chemical distance between two points x, y $\in$ C\_p corresponds to the length of the shortest path in C\_p joining the two points. The chemical distance between 0 and nx grows asymptotically like n$μ$\_p (x). We aim to…
We generalize the standard site percolation model on the $d$-dimensional lattice to a model on random tessellations of $\mathbb R^d$. We prove the uniqueness of the infinite cluster by adapting the Burton-Keane argument \cite{burton1989density}, develop two frameworks that imply the non-triviality of the phase transition and show that large classes of random tessellations fit into one of these frameworks. Our focus is on a very general approach that goes well beyond the typical Poisson driven models. The most interesting examples might be Voronoi tessellations induced by determinantal processe…
Fluctuations around the diagonal in Bernoulli-Exponential first passage percolation
本文研究 Bernoulli-Exponential 首通渗流中团簇边界在对角线附近的涨落，证明其重标度单点涨落收敛于以渗流水平 s 为索引的新分布族，该族在 s=0 时为高斯分布，并随 s 增大趋于 Tracy--Widom 分布。
The probability of connection between two vertices cannot be monotone with the distance for Bernoulli Percolation on transitive graphs
本文研究了伯努利渗流中两个顶点连接概率与距离的关系，发现其不必然随距离单调递减，并定义了临界点现象。
The goal of this note is to announce certain results in orbit equivalence theory, especially concerning the approximation of p.m.p. standard equivalence relations by increasing sequence of sub-relations, with applications to the behavior of the Bernoulli percolation on graphs at the threshold pu. Résumé en Français. Approximations de relations d'équivalence standards et percolation de Bernoulli à p\_u.
A finite-graph conjecture related to $θ(p_c)=0$ for Bernoulli bond percolation on $\mathbb Z^d$
该研究提出有限图伯努利键渗流的一个猜想，可推出d≥2时Z^d上θ(p_c)=0，证明有限平面图情形成立，反例显示连通性结构不可或缺。
We consider the standard model of i.i.d. first passage percolation on $\mathbb{Z}^d$ given a distribution $G$ on $[0,+\infty]$ ($+\infty$ is allowed). When $G([0,+\infty]) < p_c(d)$, it is known that the time constant $μ_G$ exists. We are interested in the regularity properties of the map $G\mapstoμ_G$. We first study the specific case of distributions of the form $G_p=pδ_1+(1-p)δ_\infty$ for $p>p_c(d)$. In this case, the travel time between two points is equal to the length of the shortest path between the two points in a bond percolation of parameter $p$. We show that the function $p\mapsto …
We consider Bernoulli first-passage percolation on the $d$-dimensional hypercubic lattice with $d \geq 2$. The passage time of edge $e$ is $0$ with probability $p$ and $1$ with probability $1-p$, independently of each other. Let $p_c$ be the critical probability for percolation of edges with passage time $0$. When $0\leq p<p_c$, there exists a nonrandom, nonempty compact convex set $\mathcal{B}_p$ such that the set of vertices to which the first-passage time from the origin is within $t$ is well-approximated by $t\mathcal{B}_p$ for all large $t$, with probability one. The aim of this paper is …
We prove that for Bernoulli percolation on a graph $\mathbb{Z}^2\times\{0,\dots,k\}$ ($k\ge 0$), there is no infinite cluster at criticality, almost surely. The proof extends to finite range Bernoulli percolation models on $\mathbb{Z}^2$ which are invariant under $π/2$-rotation and reflection.
Two vertices are said to be finitely connected if they belong to the same cluster and this cluster is finite. We derive sharp asymptotics for finite connection probabilities for supercritical Bernoulli bond percolation on Z^2.
We consider the standard model of first-passage percolation on $\mathbb{Z}^d$ ($d\geq 2$), with i.i.d. passage times associated with either the edges or the vertices of the graph. We focus on the particular case where the distribution of the passage times is the Bernoulli distribution with parameter $1-ε$. These passage times induce a random pseudo-metric $T_ε$ on $\mathbb{R}^d$. By subadditive arguments, it is well known that for any $z\in\mathbb{R}^d\setminus \{0\}$, the sequence $T_ε(0,\lfloor nz \rfloor) / n$ converges a.s. towards a constant $μ_ε(z)$ called the time constant. We investiga…
We prove that in the critical Bernoulli percolation on two dimensional lattice slabs the probabilities of open left-right crossings of rectangles with any given aspect ratio are uniformly positive.
We show that adding epsilon-Bernoulli percolation to an everywhere percolating subgraph of Z^2 results in a graph which has large scale geometry similar to that of supercritical Bernoulli percolation, in various specific senses. We conjecture similar behavior in higher dimensions.
Enlargement of subgraphs of infinite graphs by Bernoulli percolation
本文研究无限图子图在加入伯努利渗流开放边后性质的变化，定义两类临界概率并与哈马米临界概率比较，探讨子图的瞬态性、割点数量、复发性及连通性等属性。
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 introduce a percolation model on $\mathbb{Z}^d$, $d \geq 3$, in which the discrete lines of vertices that are parallel to the coordinate axis are entirely removed at random and independently of each other. In this way a vertex belongs to the vacant set $\mathcal{V}$ if and only if none of the $d$ lines to which it belongs, is removed. We show the existence of a phase transition for $\mathcal{V}$ as the probability of removing the lines is varied. We also establish that, in the certain region of parameters space where $\mathcal{V}$ contains an infinite component, the truncated connectivity f…
We provide a new proof of the sharpness of the phase transition for nearest-neighbour Bernoulli percolation. More precisely, we show that - for $p<p_c$, the probability that the origin is connected by an open path to distance $n$ decays exponentially fast in $n$. - for $p>p_c$, the probability that the origin belongs to an infinite cluster satisfies the mean-field lower bound $θ(p)\ge\tfrac{p-p_c}{p(1-p_c)}$. This note presents the argument of \cite{DumTas15}, which is valid for long-range Bernoulli percolation (and for the Ising model) on arbitrary transitive graphs in the simpler framework o…
We prove a local limit theorem for the probability of a site to be connected by disjoint paths to three points in subcritical Bernoulli percolation on $\mathbb{Z}^{d},\,d\geq2$ in the limit where their distances tend to infinity.
We show that a superposition of an $\varepsilon$-Bernoulli bond percolation and any everywhere percolating subgraph of $\mathbb Z^d$, $d\ge 2$, results in a connected subgraph, which after a renormalization dominates supercritical Bernoulli percolation. This result, which confirms a conjecture of the first author together with Häggström and Schramm (2000), is mainly motivated by obtaining finite volume characterizations of uniqueness for general percolation processes.
We study Bernoulli bond percolation on a random recursive tree of size $n$ with percolation parameter $p(n)$ converging to $1$ as $n$ tends to infinity. The sizes of the percolation clusters are naturally stored in a tree. We prove convergence in distribution of this tree to the genealogical tree of a continuous-state branching process in discrete time. As a corollary we obtain the asymptotic sizes of the largest and next largest percolation clusters, extending thereby a recent work of Bertoin (2014) which deals with cluster sizes in the supercritical regime. In a second part, we show that the…
We prove that for Bernoulli percolation on $\mathbb{Z}^d$, $d\geq 2$, the percolation density is an analytic function of the parameter in the supercritical interval. For this we introduce some techniques that have further implications. In particular, we prove that the susceptibility is analytic in the subcritical interval for all transitive short- or long-range models, and that $p_c^{bond} <1/2$ for certain families of triangulations for which Benjamini \& Schramm conjectured that $p_c^{site} \leq 1/2$.
We prove Ornstein-Zernike behaviour in every direction for finite connection functions of bond percolation on $\mathbb{Z}^{d}$ for $d\geq3$ when $p,$ the probability of occupation of a bond, is sufficiently close to $1.$ Moreover, we prove that equi-decay surfaces are locally analytic, strictly convex, with positive Gaussian curvature.
The Euclidean first-passage percolation model of Howard and Newman is a rotationally invariant percolation model built on a Poisson point process. It is known that the passage time between 0 and $ne_1$ obeys a diffusive upper bound: $\mbox{Var}\, T(0,ne_1) \leq Cn$, and in this paper we improve this inequality to $Cn/\log n$. The methods follow the strategy used for sublinear variance proofs on the lattice, using the Falik-Samorodnitsky inequality and a Bernoulli encoding, but with substantial technical difficulties. To deal with the different setup of the Euclidean model, we represent the pas…
We provide a new proof of the near-critical scaling relation $β=ξ_1ν$ for Bernoulli percolation on the square lattice already proved by Kesten in 1987. We rely on a novel approach that does not invoke Russo's formula, but rather relates differences in crossing probabilities at different scales. The argument is shorter and more robust than previous ones and is more likely to be adapted to other models. The same approach may be used to prove the other scaling relations appearing in Kesten's work.
Under some general assumptions, we construct the scaling limit of open clusters and their associated counting measures in a class of two dimensional percolation models. Our results apply, in particular, to critical Bernoulli site percolation on the triangular lattice and to the critical FK-Ising model on the square lattice. Fundamental properties of the scaling limit, such as conformal covariance, are explored. As an application to Bernoulli percolation, we obtain the scaling limit of the largest cluster in a bounded domain. We also apply our results to the critical, two-dimensional Ising mode…
This is a study of percolation in the hyperbolic plane and on regular tilings in the hyperbolic plane. The processes discussed include Bernoulli site and bond percolation on planar hyperbolic graphs, invariant dependent percolations on such graphs, and Poisson-Voronoi-Bernoulli percolation. We prove the existence of three distinct nonempty phases for the Bernoulli processes. In the first phase, $p\in(0, p_c]$, there are no unbounded clusters, but there is a unique infinite cluster for the dual process. In the second phase, $p\in(p_c,p_u)$, there are infinitely many unbounded clusters for the p…
We consider Bernoulli bond percolation on the product graph of a regular tree and a line. We show that the triangle condition does not hold at the uniqueness threshold.
Phase transition for strongly correlated percolation models on supercritical Bernoulli clusters
本文研究超临界 Bernoulli 团簇上高斯自由场水平集与随机交织空置集的渗流相变，证明其在确定性临界水平发生非平凡相变，并发展了淬火树嵌入控制方法。
Superconcentration and chaos in Bernoulli percolation
本文研究了伯努利渗流中化学距离的超浓度现象，通过动态有效半径和晶格动物理论量化了测地线的混沌行为。
Subdiffusive concentration for the chemical distance in Bernoulli percolation
针对超临界伯努利渗流中图距离的扩散集中性，本文建立次扩散集中不等式改进结果，受首达渗流工作启发并结合有效半径等新工具，以一步重正化处理边重采样影响，方差次线性界为其推论。
Sharp bounds on the half-space two-point function for high-dimensional Bernoulli percolation
该研究在高维伯努利渗流中推导了半空间两点函数的精确界，完善了之前的研究成果并解决了相关问题。
Coupling Invasion and First Passage Percolation
该研究通过构建入侵渗流与对数均匀通过时间首达渗流的耦合，为整数格伯努利键渗流的连续相变提供了新的等价条件，关联了原相变与顶点入侵概率消失的已知等价性。
An alternative approach for the mean-field behaviour of spread-out Bernoulli percolation in dimensions $d>6$
针对 $d>6$ 的充分分散 Bernoulli 渗流，论文提出推导平均场指数的新途径，并证明临界与近临界情形下全空间、半空间两点函数的上界。
We consider Bernoulli (bond) percolation with parameter $p$ on the Cayley tree of order $k$. We introduce the notion of zebra-percolation that is percolation by paths of alternating open and closed edges. In contrast with standard percolation with critical threshold at $p_c= 1/k$, we show that zebra-percolation occurs between two critical values $p_{{\rm c},1}$ and $p_{{\rm c},2}$ (explicitly given). We provide the specific formula of zebra-percolation function.
Eulerian percolation on Z 2 with parameter p is the classical Bernoulli bond percolation with parameter p conditioned on the fact that every site has an even degree. We first explain why Eulerian percolation with parameter p coincides with the contours of the Ising model for a well-chosen parameter $β$(p). Then we study the percolation properties of Eulerian percolation.
We consider critical oriented Bernoulli percolation on the square lattice $\mathbb{Z}^2$. We prove a Russo-Seymour-Welsh type result which allows us to derive several new results concerning the critical behavior: - We establish that the probability that the origin is connected to distance $n$ decays polynomially fast in $n$. - We prove that the critical cluster of the origin conditioned to survive to distance $n$ has a typical width $w_n$ satisfying $εn^{2/5} < w_n < n^{1-ε}$ for some $ε> 0$. The sub-linear polynomial fluctuations contrast with the supercritical regime where $w_n$ is known to …
We consider boundary roughness for the ``droplet'' created when supercritical two-dimensional Bernoulli percolation is conditioned to have an open dual circuit surrounding the origin and enclosing an area at least $l^2$, for large $l$. The maximum local roughness is the maximum inward deviation of the droplet boundary from the boundary of its own convex hull; we show that for large $l$ this maximum is at least of order $l^{1/3}(\log l)^{-2/3}$. This complements the upper bound of order $l^{1/3}(\log l)^{2/3}$ known for the average local roughness. The exponent 1/3 on $l$ here is in keeping wit…
Iterated Graph Systems (II): Bernoulli percolation and critical-exponent universality classes on hierarchical lattices
研究层级晶格上的伯努利渗流，证明有限维数族不能决定普适类，并否证普适性需可公度重整化尺度的猜想。
We provide a new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model. The proof applies to infinite range models on arbitrary locally finite transitive infinite graphs. For Bernoulli percolation, we prove finiteness of the susceptibility in the subcritical regime $β<β_c$, and the mean-field lower bound $\mathbb{P}_β[0\longleftrightarrow\infty]\ge (β-β_c)/β$ for $β>β_c$. For finite-range models, we also prove that for any $β<β_c$, the probability of an open path from the origin to distance $n$ decays exponentially fast in $n$. For the Ising model, we pro…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。