English
Related papers

Related papers: A remark on monotonicity in Bernoulli bond Percola…

200 papers

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…

Probability · Mathematics 2021-07-14 Agelos Georgakopoulos , Christoforos Panagiotis

We consider a dilute lattice obtained from the usual $\mathbb{Z}^3$ lattice by removing independently each of its columns with probability $1-\rho$. In the remaining dilute lattice independent Bernoulli bond percolation with parameter $p$…

Probability · Mathematics 2020-05-01 Marcelo R. Hilário , Marcos Sá , Rémy Sanchis

Consider an independent site percolation model with parameter $p \in (0,1)$ on $\Z^d,\ d\geq 2$ where there are only nearest neighbor bonds and long range bonds of length $k$ parallel to each coordinate axis. We show that the percolation…

Probability · Mathematics 2011-05-24 Bernardo N. B. de Lima , Rémy Sanchis , Roger W. C. Silva

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…

Probability · Mathematics 2023-05-17 Daniel Contreras , Sébastien Martineau , Vincent Tassion

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

Let $\mathbb{G}=\left(\mathbb{V},\mathbb{E}\right)$ be the graph obtained by taking the cartesian product of an infinite and connected graph $G=(V,E)$ and the set of integers $\mathbb{Z}$. We choose a collection $\mathcal{C}$ of finite…

Probability · Mathematics 2019-10-29 Bernardo N. B. de Lima , Humberto C. Sanna

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…

Probability · Mathematics 2007-05-23 Yevgeniy Kovchegov

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…

Probability · Mathematics 2021-04-01 Tom Hutchcroft

We propose local versions of monotonicity for Boolean and pseudo-Boolean functions: say that a pseudo-Boolean (Boolean) function is p-locally monotone if none of its partial derivatives changes in sign on tuples which differ in less than p…

Discrete Mathematics · Computer Science 2012-05-17 Miguel Couceiro , Jean-Luc Marichal , Tamás Waldhauser

Let $G$ be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on $G$. We prove that if $G$ is nonamenable and $p > p_c(G)$ then there exists a positive constant $c_p$ such that \[\mathbf{P}_p(n \leq |K| <…

Probability · Mathematics 2020-10-06 Jonathan Hermon , Tom Hutchcroft

We study bond percolation on the simple cubic (SC) lattice with various combinations of first, second, third, and fourth nearest-neighbors by Monte Carlo simulation. Using a single-cluster growth algorithm, we find precise values of the…

Disordered Systems and Neural Networks · Physics 2020-07-08 Zhipeng Xun , Robert M. Ziff

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…

Probability · Mathematics 2015-09-22 Marcelo R. Hilário , Vladas Sidoravicius

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…

Probability · Mathematics 2012-10-25 Massimo Campanino , Michele Gianfelice

We investigate the effect of structural distortion on bond percolation in simple cubic and body-centered cubic lattices using extensive Monte Carlo simulations. Distortion is introduced through controlled random displacements of lattice…

Statistical Mechanics · Physics 2026-02-18 Bishnu Bhowmik , Sayantan Mitra , Robert M. Ziff , Ankur Sensharma

Let $n\ge2$ and let $\Phi\colon\mathbb{R}^n\to[0,\infty)$ be a positively $1$-homogeneous and convex function. Given two convex bodies $A\subset B$ in $\mathbb{R}^n$, the monotonicity of anisotropic $\Phi$-perimeters holds, i.e.…

Metric Geometry · Mathematics 2023-09-07 Giorgio Stefani

In this article, we study some special cases of the problem of classifying polynomials $p:\mathbb{R}^2_+\to (0,\infty)$ for which the net $\{\frac{1}{p(m,n)}\}_{m,n\in \mathbb{Z}_+}$ is a completely monotone net, where $p(x,y)=b(x)+a(x)y$,…

Functional Analysis · Mathematics 2025-10-20 Mandar Khasnis , V. M. Sholapurkar

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…

Probability · Mathematics 2026-05-28 Matthew Dickson , Yucheng Liu

On a locally finite, infinite tree $T$, let $p_c(T)$ denote the critical probability for Bernoulli percolation. We prove that every positively associated, finite-range dependent percolation model on $T$ with marginals $p > p_c(T)$ must…

Probability · Mathematics 2024-05-14 Laurin Köhler-Schindler , Aurelio L. Sulser

We discuss the problem of classifying polynomials $p : \mathbb R^2_+ \rightarrow (0, \infty)$ for which $\frac{1}{p}=\{\frac{1}{p(m, n)}\}_{m, n \geq 0}$ is joint completely monotone, where $p$ is a linear polynomial in $y.$ We show that if…

Functional Analysis · Mathematics 2024-11-20 Akash Anand , Sameer Chavan , Rajkamal Nailwal

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.

Probability · Mathematics 2009-10-13 Massimo Campanino , Dmitry Ioffe , Oren Louidor