English
Related papers

Related papers: Bernoulli hyper-edge percolation on Zd

200 papers

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 investigate the formation of an infinite cluster of entangled threads in a (2+1)-dimensional system. We demonstrate that topological percolation belongs to the universality class of the standard 2D bond percolation. We compute the…

Statistical Mechanics · Physics 2007-05-23 S. K. Nechaev , O. A. Vasilyev

A popular question in Bernoulli percolation models is if the probability of connection between two vertices in a transitive graph decays monotonically with the distance between these two vertices. For example, on the square lattice is an…

Probability · Mathematics 2026-01-05 Alberto M. Campos , Bernardo N. B. de Lima

This paper is an up-to-date introduction to the problem of uniqueness versus non-uniqueness of infinite clusters for percolation on ${\mathbb{Z}}^d$ and, more generally, on transitive graphs. For iid percolation on ${\mathbb{Z}}^d$,…

Probability · Mathematics 2016-08-16 Olle Häggström , Johan Jonasson

In this paper, we alternately obtain the almost sure uniqueness of the infinite open cluster in bond percolation in $\mathbb{Z}^d, d \geq 2,$ without requiring the use of ergodicity of translation action. If $N$ denotes the number of…

Probability · Mathematics 2016-06-28 Ghurumuruhan Ganesan

We consider site (vertex) percolation on $d$-regular graphs, for both constant-degree and growing-degree cases. We give sufficient, and relatively tight, conditions for the emergence of the ``Erd\H{o}s-R\'enyi component phenomenon" in the…

Combinatorics · Mathematics 2026-03-20 Sahar Diskin , Michael Krivelevich , Itay Markbreit

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…

Probability · Mathematics 2019-08-27 Pengfei Tang

We consider changes in properties of a subgraph of an infinite graph resulting from the addition of open edges of Bernoulli percolation on the infinite graph to the subgraph. We give the triplet of an infinite graph, one of its subgraphs,…

Probability · Mathematics 2026-04-21 Kazuki Okamura

We consider the constrained-degree percolation (CDP) model on the hypercubic lattice. This is a continuous-time percolation model defined by a sequence $(U_e)_{e\in\mathcal{E}^d}$ of i.i.d. uniform random variables and a positive integer…

We study percolation on self-dual hypergraphs that contain hyperedges with four bounding vertices, or "four-edges", using three different generators, each containing bonds or sites with three distinct probabilities $p$, $r$, and $t$…

Disordered Systems and Neural Networks · Physics 2015-09-18 Ojan Khatib Damavandi , Robert M. Ziff

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 investigate a limit theorem on traversable length inside semi-cylinder in the 2-dimensional supercritical Bernoulli bond percolation, which gives an extension of Theorem 2 in Grimmett(1981). This type of limit theorems was originally…

Probability · Mathematics 2007-05-23 Nobuaki Sugimine , Masato Takei

We consider the following oriented percolation model of $\mathbb {N} \times \mathbb{Z}^d$: we equip $\mathbb {N}\times \mathbb{Z}^d$ with the edge set $\{[(n,x),(n+1,y)] | n\in \mathbb {N}, x,y\in \mathbb{Z}^d\}$, and we say that each edge…

Probability · Mathematics 2012-02-08 Hubert Lacoin

We perform Monte-Carlo simulations to study the Bernoulli ($p$) bond percolation on the enhanced binary tree which belongs to the class of nonamenable graphs with one end. Our numerical results show that the system has two different…

Statistical Mechanics · Physics 2009-03-19 Tomoaki Nogawa , Takehisa Hasegawa

In this paper we consider Bernoulli percolation on an infinite connected bounded degrees graph $G$. Assuming the uniqueness of the infinite open cluster and a quasi-multiplicativity of crossing probabilities, we prove the existence of…

Probability · Mathematics 2016-11-15 Deepan Basu , Artem Sapozhnikov

The aim of this paper is to generalize the well-known asymptotic shape result for first-passage percolation on $\Zd$ to first-passage percolation on a random environment given by the infinite cluster of a supercritical Bernoulli percolation…

Probability · Mathematics 2007-05-23 Olivier Garet , Regine Marchand

In this paper, we consider accessibility percolation on hypercubes, i.e., we place i.i.d. uniform [0,1] random variables on vertices of a hypercube, and study whether there is a path connecting two vertices such that the values of these…

Probability · Mathematics 2017-06-05 Li Li

We study FK-percolation where the edge parameters are chosen as independent random variables in the near-critical regime. We show that if these parameters satisfy a natural centering condition around the critical point, then the quenched…

Probability · Mathematics 2025-09-12 Emile Avérous , Rémy Mahfouf

In this paper, we prove that Bernoulli percolation on bounded degree graphs with isoperimetric dimension $d>4$ undergoes a non-trivial phase transition (in the sense that $p_c<1$). As a corollary, we obtain that the critical point of…

Probability · Mathematics 2020-12-23 Hugo Duminil-Copin , Subhajit Goswami , Aran Raoufi , Franco Severo , Ariel Yadin

We study the distribution of finite clusters in slightly supercritical ($p \downarrow p_c$) Bernoulli bond percolation on transitive nonamenable graphs, proving in particular that if $G$ is a transitive nonamenable graph satisfying the…

Probability · Mathematics 2022-07-28 Tom Hutchcroft