中文
相关论文

相关论文: A lower bound for point-to-point connection probab…

200 篇论文

Consider critical site percolation on $\mathbb{Z}^d$ with $d \geq 2$. Cerf (2015) pointed out that from classical work by Aizenman, Kesten and Newman (1987) and Gandolfi, Grimmett and Russo (1988) one can obtain that the two-arms exponent…

概率论 · 数学 2020-09-29 Jacob van den Berg , Diederik van Engelenburg

We consider the standard site percolation model on the $d$-dimensional lattice. A direct consequence of the proof of the uniqueness of the infinite cluster of Aizenman, Kesten and Newman [Comm. Math. Phys. 111 (1987) 505-531] is that the…

概率论 · 数学 2015-10-30 Raphaël Cerf

We present high statistics data on the distribution of shortest path lengths between two near-by points on the same cluster at the percolation threshold. Our data are based on a new and very efficient algorithm. For $d=2$ they clearly…

统计力学 · 物理学 2009-10-31 P. Grassberger

We prove up-to-constants bounds on the two-point function (i.e., point-to-point connection probabilities) for critical long-range percolation on the $d$-dimensional hierarchical lattice. More precisely, we prove that if we connect each pair…

概率论 · 数学 2021-04-01 Tom Hutchcroft

In long-range percolation on $\mathbb{Z}^d$, we connect each pair of distinct points $x$ and $y$ by an edge independently at random with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $\alpha>0$ is fixed and $\beta\geq 0$ is a…

概率论 · 数学 2024-04-12 Tom Hutchcroft

We consider oriented percolation on Z^d times Z_+ whose bond-occupation probability is pD(...), where p is the percolation parameter and D is a probability distribution on Z^d. Suppose that D(x) decays as |x|^{-d-\alpha} for some \alpha>0.…

概率论 · 数学 2007-08-21 Lung-Chi Chen , Akira Sakai

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.

概率论 · 数学 2011-03-11 Massimo Campanino , Michele Gianfelice

We study a percolation model on $\mathbb R^d$ called the random connection model. For $d$ large, we use the lace expansion to prove that the critical two-point connection probability decays like $|x|^{-(d-2)}$ as $|x| \to \infty$, with…

概率论 · 数学 2026-05-28 Matthew Dickson , Yucheng Liu

We obtain a new lower bound of 0.06576 for the 1-entanglement critical probability (in dimension 3), and prove that the critical point for the existence of a sphere surrounding the origin and intersecting only closed bonds in $\mathbb{Z}^d$…

概率论 · 数学 2021-12-08 Olivier Couronné

We use the connection between bond percolation and SIR epidemics to establish lower bounds for the critical percolation probability in $2$ and $3$ dimensions as the range becomes large. The bound agrees with the conjectured asymptotics for…

概率论 · 数学 2016-03-15 Spencer Frei , Edwin Perkins

We provide the first nontrivial upper bound for the chemical distance exponent in two-dimensional critical percolation. Specifically, we prove that the expected length of the shortest horizontal crossing path of a box of side length $n$ in…

概率论 · 数学 2017-08-15 Michael Damron , Jack Hanson , Philippe Sosoe

We present a coupled decreasing sequence of random walks on $ \mathbb Z $ that dominates the edge process of oriented-bond percolation in two dimensions. Using the concept of "random walk in a strip ", we construct an algorithm that…

概率论 · 数学 2007-05-23 Thomas Logan Ritchie , Vladimir Belitsky

We study the following problem for critical site percolation on the triangular lattice. Let A and B be sites on a horizontal line e separated by distance n. Consider, in the half-plane above e, the lowest occupied crossing R from the…

概率论 · 数学 2011-01-10 J. van den Berg , A. A. Jarai

Despite great progress in the study of critical percolation on $\mathbb{Z}^d$ for $d$ large, properties of critical clusters in high-dimensional fractional spaces and boxes remain poorly understood, unlike the situation in two dimensions.…

概率论 · 数学 2018-10-10 Shirshendu Chatterjee , Jack Hanson

Fractal percolation has been introduced by Mandelbrot in 1974. We study the two-dimensional case, with integer subdivision index M and survival probability p. It is well known that there exists a non-trivial critical value p_c(M) such that…

概率论 · 数学 2016-09-23 Henk Don

Consider long-range Bernoulli percolation on $\mathbb{Z}^d$ in which we connect each pair of distinct points $x$ and $y$ by an edge with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $\alpha>0$ is fixed and $\beta\geq 0$ is a…

概率论 · 数学 2022-11-23 Tom Hutchcroft

An upper bound for the critical probability of long range bond percolation in $d=2$ and $d=3$ is obtained by connecting the bond percolation with the SIR epidemic model, thus complementing the lower bound result in Frei and Perkins…

概率论 · 数学 2021-07-30 Jieliang Hong

We continue our study of the chemical (graph) distance inside large critical percolation clusters in dimension two. We prove new estimates, which involve the three-arm probability, for the point-to-surface and point-to-point distances. We…

概率论 · 数学 2016-01-15 Michael Damron , Jack Hanson , Philippe Sosoe

We consider bond and site Bernoulli Percolation in both the oriented and the non-oriented cases on $\mathbb{Z}^d$ and obtain rigorous upper bounds for the critical points in those models for every dimension $d \geq 3$.

概率论 · 数学 2026-03-17 Pablo A. Gomes , Alan Pereira , Remy Sanchis

Percolation theory has become a useful tool for the analysis of large-scale wireless networks. We investigate the fundamental problem of characterizing the critical density $\lambda_c^{(d)}$ for $d$-dimensional Poisson random geometric…

概率论 · 数学 2007-05-23 Zhenning Kong , Edmund M. Yeh
‹ 上一页 1 2 3 10 下一页 ›