English
Related papers

Related papers: A lower bound for point-to-point connection probab…

200 papers

In site percolation, vertices (sites) of a graph are open with probability p, and there is critical p, for which open vertices form an open path the long way across a graph, so a vertex at the origin is a part of an infinite connected open…

Mathematical Physics · Physics 2013-08-22 Marko Pujic

Consider supercritical long-range percolation on $\Z^d$ where two vertices $x,y \in \Z^d$ are connected with probability asymptotic to $\|x-y\|^{-s}$ for some $s>2d$. Conditioned that the origin is in the infinite cluster, we prove a shape…

Probability · Mathematics 2026-04-29 Johannes Bäumler

We consider the cardinality of supercritical oriented bond percolation in two dimensions. We show that, whenever the origin is conditioned to percolate, the process appropriately normalized converges asymptotically in distribution to the…

Probability · Mathematics 2018-05-23 Achillefs Tzioufas

Let M_n denote the number of sites in the largest cluster in critical site percolation on the triangular lattice inside a box side length n. We give lower and upper bounds on the probability that M_n / E(M_n) > x of the form exp(- C…

Probability · Mathematics 2014-04-09 Demeter Kiss

In this paper, we compute the next-nearest-neighboring site percolation (Connections exist not only between nearest-neighboring sites, but also between next-nearest-neighboring sites.) probabilities Pc on the two-dimensional Sierpinski…

Mathematical Physics · Physics 2007-05-23 H. B. Nie , B. M. Yu , K. L. Yao

We consider percolation on the discrete torus $\mathbb{Z}_n^d$ at $p_c(\mathbb{Z}^d)$, the critical value for percolation on the corresponding infinite lattice $\mathbb{Z}^d$, and within the scaling window around it. We assume that $d$ is a…

Probability · Mathematics 2025-12-23 Arthur Blanc-Renaudie , Asaf Nachmias

We consider the supercritical finite-range random connection model where the points $x,y$ of a homogeneous planar Poisson process are connected with probability $f(|y-x|)$ for a given $f$. Performing percolation on the resulting graph, we…

Probability · Mathematics 2015-05-19 Massimo Franceschetti , Mathew D. Penrose , Tom Rosoman

For independent nearest-neighbour bond percolation on Z^d with d >> 6, we prove that the incipient infinite cluster's two-point function and three-point function converge to those of integrated super-Brownian excursion (ISE) in the scaling…

Probability · Mathematics 2009-09-25 Siva Athreya , Roger Tribe

We investigate the percolative properties of the vacant set left by random interlacements on Z^d, when d is large. A non-negative parameter u controls the density of random interlacements on Z^d. It is known from arXiv:0704.2560, and…

Probability · Mathematics 2011-09-01 Alain-Sol Sznitman

We consider Bernoulli percolation on $\mathbb Z^d$ with $d>6$. We prove an up-to-constant estimate for the critical two-point function restricted to a half-space. This completes previous results of Chatterjee and Hanson (Commun. Pure Appl.…

Probability · Mathematics 2026-03-09 Romain Panis , Bruno Schapira

Fitting percolation into the conformal field theory framework requires showing that connection probabilities have a conformally invariant scaling limit. For critical site percolation on the triangular lattice, we prove that the probability…

Mathematical Physics · Physics 2023-06-27 Federico Camia

Let $G=(V,E)$ be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on $G$. In recent work, we conjectured that if $G$ is nonamenable then the matrix of critical connection probabilities…

Probability · Mathematics 2020-09-24 Tom Hutchcroft

We consider critical site percolation on the triangular lattice in the upper half-plane. Let $u_1, u_2$ be two sites on the boundary and $w$ a site in the interior of the half-plane. It was predicted by Simmons, Kleban and Ziff in a paper…

Probability · Mathematics 2015-05-29 Rene Conijn

This Letter studies the critical point as well as the discontinuity of a class of explosive site percolation in Erd\"{o}s and R\'{e}nyi (ER) random network. The class of the percolation is implemented by introducing a best-of-m rule. Two…

Physics and Society · Physics 2012-12-05 J. H. Qian , D. D. Han , Y. G. Ma

We show that the critical probability for percolation on a d-regular non-amenable graph of large girth is close to the critical probability for percolation on an infinite d-regular tree. This is a special case of a conjecture due to O.…

Probability · Mathematics 2009-01-30 Itai Benjamini , Asaf Nachmias , Yuval Peres

We consider the two dimensional $Q-$ random-cluster Potts model on the torus and at the critical point. We study the probability for two points to be connected by a cluster for general values of $Q\in [1,4]$. Using a Conformal Field Theory…

High Energy Physics - Theory · Physics 2020-02-19 Nina Javerzat , Marco Picco , Raoul Santachiara

In this paper, we study the critical level-set of Gaussian free field (GFF) on the metric graph $\widetilde{\mathbb{Z}}^d,d>6$. We prove that the one-arm probability (i.e. the probability of the event that the origin is connected to the…

Probability · Mathematics 2023-07-11 Zhenhao Cai , Jian Ding

We consider independent and $m$-dependent two-dimensional oriented site percolation with open-site density close to one started from Bernoulli product measures. We show that the probability of an occupied interval in the former process…

Probability · Mathematics 2020-11-24 Achillefs Tzioufas

We provide new upper and lower bounds on the minimum possible ratio of the spectral and Frobenius norms of a (partially) symmetric tensor. In the particular case of general tensors our result recovers a known upper bound. For symmetric…

Functional Analysis · Mathematics 2024-03-05 Khazhgali Kozhasov , Josué Tonelli-Cueto

Percolation in an information-theoretically secure graph is considered where both the legitimate and the eavesdropper nodes are distributed as Poisson point processes. For both the path-loss and the path-loss plus fading model, upper and…

Information Theory · Computer Science 2011-04-07 Rahul Vaze