English
Related papers

Related papers: Truncation of long-range percolation model with sq…

200 papers

For some m \ge 4, let us color each column of the integer lattice L = Z^2 independently and uniformly into one of m colors. We do the same for the rows, independently from the columns. A point of L will be called blocked if its row and…

Probability · Mathematics 2007-05-23 Peter Gacs

We study bond percolation for a family of infinite hyperbolic graphs. We relate percolation to the appearance of homology in finite versions of these graphs. As a consequence, we derive an upper bound on the critical probabilities of the…

Probability · Mathematics 2016-11-29 Nicolas Delfosse , Gilles Zémor

Consider ordinary bond percolation on a finite or countably infinite graph. Let s, t, a and b be vertices. An earlier paper proved the (nonintuitive) result that, conditioned on the event that there is no open path from s to t, the two…

Probability · Mathematics 2007-05-23 Jacob van den Berg , Olle Haggstrom , Jeff Kahn

We provide a sufficient criterion for the recurrence of spatial random graphs on the real line based on the scarceness of long-edges. In particular, this complements earlier recurrence results obtained by Gracar et al. (Electron. J. Probab.…

Probability · Mathematics 2024-08-14 Christian Mönch

We describe a percolation problem on lattices (graphs, networks), with edge weights drawn from disorder distributions that allow for weights (or distances) of either sign, i.e. including negative weights. We are interested whether there are…

Disordered Systems and Neural Networks · Physics 2009-11-13 O. Melchert , A. K. Hartmann

We consider a version of continuum long-range percolation on finite boxes of $\mathbb{R}^d$ in which the vertex set is given by the points of a Poisson point process and each pair of two vertices at distance $r$ is connected with…

Probability · Mathematics 2023-11-21 Ercan Sönmez

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

Given a graph $G$, we consider a model for a random cover of $G$ by taking two parallel copies of $G$ and crossing every pair of parallel edges randomly with probability $q$ independently of each other. The resulting graph $G_q$, is a…

Probability · Mathematics 2025-06-03 Paul Drouvillé

We study the contact process on the long-range percolation cluster on $\mathbb{Z}$ where each edge $\langle i,j \rangle$ is open with probability $|i-j|^{-s}$ for $s> 2$. Using a renormalization procedure we apply Peierls-type argument to…

Probability · Mathematics 2026-03-17 Pablo A. Gomes , Marcelo R. Hilário , Bernardo N. B. de Lima , Thomas Mountford

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

The random percolation model can be viewed as the dual of a well defined confining gauge theory; since this theory, having no Monte Carlo dynamics at all, is simple to simulate, it is possible to study the properties of the flux tube with…

High Energy Physics - Lattice · Physics 2009-04-14 Pietro Giudice , Ferdinando Gliozzi , Stefano Lottini

Analytical results are derived for the bond percolation threshold and the size of the giant connected component in a class of random networks with non-zero clustering. The network's degree distribution and clustering spectrum may be…

Statistical Mechanics · Physics 2009-09-22 James P. Gleeson

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

We consider the Constrained-degree percolation model in random environment on the square lattice. In this model, each vertex $v$ has an independent random constraint ${\kappa}_v$ which takes the value $j\in \{0,1,2,3\}$ with probability…

Probability · Mathematics 2021-11-02 Rémy Sanchis , Diogo C. dos Santos , Roger W. C. Silva

Recent work in percolation has led to exact solutions for the site and bond critical thresholds of many new lattices. Here we show how these results can be extended to other classes of graphs, significantly increasing the number and variety…

Disordered Systems and Neural Networks · Physics 2009-11-11 Robert M. Ziff , Christian R. Scullard

We present an exact solution of percolation in a generalized class of Watts-Strogatz graphs defined on a 1-dimensional underlying lattice. We find a non-classical critical point in the limit of the number of long-range bonds in the system…

Disordered Systems and Neural Networks · Physics 2009-11-17 Reuven Cohen , Daryush Jonathan Dawid , Mehran Kardar , Yaneer Bar-Yam

We study the probability that a loop is null-homotopic -- that is, bounded by the continuous image of a disk -- in plaquette percolation on $\mathbb{Z}^3.$ Locally, the event that there is a ``horizontal disk crossing'' of a rectangular…

Probability · Mathematics 2025-12-19 Paul Duncan , Benjamin Schweinhart , David Sivakoff

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

Truncation in Generalized Series fields is a robust notion, in the sense that it is preserved under various algebraic and some transcendental extensions. In this paper, we study conditions that ensure that a truncation closed set extends…

Logic · Mathematics 2016-11-01 Santiago Camacho

We formulate and study a model for inhomogeneous long-range percolation on $\Zbold^d$. Each vertex $x\in\Zbold^d$ is assigned a non-negative weight $W_x$, where $(W_x)_{x\in\Zbold^d}$ are i.i.d.\ random variables. Conditionally on the…

Probability · Mathematics 2011-03-02 Maria Deijfen , Remco van der Hofstad , Gerard Hooghiemstra