中文
相关论文

相关论文: On the effect of adding epsilon-Bernoulli percolat…

200 篇论文

We prove quasi-multiplicativity for critical level-sets of Gaussian free fields (GFF) on the metric graphs $\widetilde{\mathbb{Z}}^d$ ($d\ge 3$). Specifically, we study the probability of connecting two general sets located on opposite…

概率论 · 数学 2025-01-28 Zhenhao Cai , Jian Ding

There are various notions of dimension in fractal geometry to characterise (random and non-random) subsets of $\mathbb R^d$. In this expository text, we discuss their analogues for infinite subsets of $\mathbb Z^d$ and, more generally, for…

概率论 · 数学 2019-12-12 Markus Heydenreich

The main goal of this paper is to answer question 1.10 and settle conjecture 1.11 of Benjamini-Lyons-Schramm [BLS99] relating harmonic Dirichlet functions on a graph to those of the infinite clusters in the uniqueness phase of Bernoulli…

概率论 · 数学 2007-05-23 Damien Gaboriau

We consider Bernoulli percolation on transitive graphs of polynomial growth. In the subcritical regime ($p<p_c$), it is well known that the connection probabilities decay exponentially fast. In the present paper, we study the supercritical…

概率论 · 数学 2023-05-17 Daniel Contreras , Sébastien Martineau , Vincent Tassion

We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…

统计力学 · 物理学 2015-12-16 Antoine Allard , Laurent Hébert-Dufresne , Jean-Gabriel Young , Louis J. Dubé

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…

概率论 · 数学 2016-08-14 Adám Timár

The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…

统计力学 · 物理学 2015-09-30 Avik P. Chatterjee , Claudio Grimaldi

In an investigation of percolation on isoradial graphs, we prove the criticality of canonical bond percolation on isoradial embeddings of planar graphs, thus extending celebrated earlier results for homogeneous and inhomogeneous square,…

概率论 · 数学 2021-12-17 Geoffrey Grimmett , Ioan Manolescu

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…

概率论 · 数学 2022-07-08 Tom Hutchcroft

We consider the discrete Boolean model of percolation on graphs satisfying a doubling metric condition. We study sufficient conditions on the distribution of the radii of balls placed at the points of a Bernoulli point process for the…

概率论 · 数学 2018-09-27 Cristian F. Coletti , Sebastian P. Grynberg , Daniel Miranda

We show that there exists a connected graph G with subexponential volume growth such that critical percolation on the product of G with the line has infinitely many infinite clusters. We also give some conditions under which this cannot…

概率论 · 数学 2012-07-31 Itai Benjamini , Gady Kozma

We provide sufficient conditions for a regular graph $G$ of growing degree $d$, guaranteeing a phase transition in its random subgraph $G_p$ similar to that of $G(n,p)$ when $p\cdot d\approx 1$. These conditions capture several well-studied…

组合数学 · 数学 2025-11-17 Sahar Diskin , Michael Krivelevich

We prove that if $(G_n)_{n\geq1}=((V_n,E_n))_{n\geq 1}$ is a sequence of finite, vertex-transitive graphs with bounded degrees and $|V_n|\to\infty$ that is at least $(1+\epsilon)$-dimensional for some $\epsilon>0$ in the sense that…

概率论 · 数学 2024-01-17 Tom Hutchcroft , Matthew Tointon

We consider percolation on high-dimensional product graphs, where the base graphs are regular and of bounded order. In the subcritical regime, we show that typically the largest component is of order logarithmic in the number of vertices.…

组合数学 · 数学 2024-04-11 Sahar Diskin , Joshua Erde , Mihyun Kang , Michael Krivelevich

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…

概率论 · 数学 2019-08-27 Pengfei Tang

We study inhomogeneous Bernoulli bond percolation on the graph $G \times \mathbb{Z}$, where $G$ is a connected quasi-transitive graph. The inhomogeneity is introduced through a random region $R$ around the origin axis…

概率论 · 数学 2026-02-02 A. Nascimento , R. Sanchis , D. Ungaretti

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.

概率论 · 数学 2009-10-13 Massimo Campanino , Dmitry Ioffe , Oren Louidor

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…

群论 · 数学 2015-09-02 Damien Gaboriau , Robin Tucker-Drob

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…

概率论 · 数学 2021-07-14 Agelos Georgakopoulos , Christoforos Panagiotis

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…