English
Related papers

Related papers: Percolation on hyperbolic graphs

200 papers

We consider general continuum percolation models obeying sparseness, translation invariance, and spatial decorrelation. In particular, this includes models constructed on general point sets other than the standard Poisson point process or…

Probability · Mathematics 2026-05-13 Emmanuel Jacob , Benedikt Jahnel , Lukas Lüchtrath

We introduce a formalism for computing bond percolation properties of a class of correlated and clustered random graphs. This class of graphs is a generalization of the Configuration Model where nodes of different types are connected via…

Statistical Mechanics · Physics 2017-10-06 Antoine Allard , Laurent Hébert-Dufresne , Pierre-André Noël , Vincent Marceau , Louis J. Dubé

We propose an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact result, valid non-asymptotically for all graph sizes, which…

Statistical Mechanics · Physics 2014-05-12 Michelle Rudolph-Lilith , Lyle E. Muller

We consider the model of random interlacements on transient graphs, which was first introduced by Sznitman [Ann. of Math. (2) (2010) 171 2039-2087] for the special case of ${\mathbb{Z}}^d$ (with $d\geq3$). In Sznitman [Ann. of Math. (2)…

Probability · Mathematics 2013-03-15 Augusto Teixeira , Johan Tykesson

We study a one parameter family of random graph models that spans a continuum between traditional random graphs of the Erd\H{o}s-R\'enyi type, where there is no underlying structure, and percolation models, where the possible edges are…

Probability · Mathematics 2008-04-02 Oskar Sandberg

Let $d\ge 3$ be a fixed integer. Let $y:= y(p)$ be the probability that the root of an infinite $d$-regular tree belongs to an infinite cluster after $p$-bond-percolation. We show that for every constants $b,\alpha>0$ and $1<\lambda< d-1$,…

Combinatorics · Mathematics 2024-09-10 Sahar Diskin , Michael Krivelevich

We prove that in various natural models of a random quotient of a group, depending on a density parameter, for each hyperbolic group there is some critical density under which a random quotient is still hyperbolic with high probability,…

Group Theory · Mathematics 2007-05-23 Yann Ollivier

Majority bootstrap percolation is a model of infection spreading in networks. Starting with a set of initially infected vertices, new vertices become infected once half of their neighbours are infected. Balogh, Bollob\'{a}s and Morris…

Combinatorics · Mathematics 2025-07-10 Maurício Collares , Joshua Erde , Anna Geisler , Mihyun Kang

We present exact solutions for the size of the giant connected component (GCC) of graphs composed of higher-order homogeneous cycles, including weak cycles and cliques, following bond percolation. We use our theoretical result to find the…

Physics and Society · Physics 2021-08-11 Peter Mann , V Anne Smith , John Mitchell , Christopher Jefferson , Simon Dobson

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

We show that for any surface of genus at least 3 equipped with any choice of framing, the graph of non-separating curves with winding number 0 with respect to the framing is hierarchically hyperbolic but not Gromov hyperbolic. We also…

Geometric Topology · Mathematics 2025-04-22 Aaron Calderon , Jacob Russell

We consider the Bernoulli bond percolation process $\mathbb{P}_{p,p'}$ on the nearest-neighbor edges of $\mathbb{Z}^d$, which are open independently with probability $p<p_c$, except for those lying on the first coordinate axis, for which…

Probability · Mathematics 2015-01-13 S. Friedli , D. Ioffe , Y. Velenik

Given an infinite connected graph, a way to randomly perturb its metric is to assign random i.i.d. lengths to the edges. An open question attributed to Furstenberg is whether there exists a two-sided infinite geodesic in first passage…

Probability · Mathematics 2025-12-29 Itai Benjamini , Romain Tessera

We study bond percolation of $N$ non-interacting Gaussian polymers of $\ell$ segments on a 2D square lattice of size $L$ with reflecting boundaries. Through simulations, we find the fraction of configurations displaying {\em no} connected…

Statistical Mechanics · Physics 2007-05-23 Manoj Gopalakrishnan , Beate Schmittmann , R. K. P. Zia

We consider an i.i.d. supercritical bond percolation on Z^d , every edge is open with a probability p > p\_c (d), where p\_c (d) denotes the critical parameter for this percolation. We know that there exists almost surely a unique infinite…

Probability · Mathematics 2019-01-01 Barbara Dembin

We consider first-passage percolation on the edges of $\mathbb{Z}^2 \times \{1, \cdots, k\},$ namely the slab $\mathbb{S}_k$ of width $k$. Each edge is assigned independently a passage time of either 0 (with probability $p_c(\mathbb{S}_k)$)…

Probability · Mathematics 2018-11-28 Serena Sian Yuan

We consider the Constrained-degree percolation model on the hypercubic lattice, $\mathbb L^d=(\mathbb Z^d,\mathbb E^d)$ for $d\geq 3$. It is a continuous time percolation model defined by a sequence, $(U_e)_{e\in\mathbb E^d}$, of i.i.d.…

Probability · Mathematics 2023-01-03 Ivailo Hartarsky , Bernardo N. B. de Lima

We show that a relatively hyperbolic graph with uniformly hyperbolic peripheral subgraphs is hyperbolic. As an application, we show that the disc graph and the electrified disc graph of a handlebody H of genus g>1 are hyperbolic, and we…

Geometric Topology · Mathematics 2014-05-20 Ursula Hamenstaedt

Let H_n be the hypercube {0,1}^n, and let H_{n,p} denote the same graph with Bernoulli bond percolation with parameter p=n^-\alpha. It is shown that at \alpha=1/2 there is a phase transition for the metric distortion between H_n and…

Probability · Mathematics 2007-05-23 Omer Angel , Itai Benjamini

We study random walks on supercritical percolation clusters on wedges in $\Z^3$, and show that the infinite percolation cluster is (a.s.) transient whenever the wedge is transient. This solves a question raised by O. Haggstrom and E.…

Probability · Mathematics 2007-05-23 Omer Angel , Itai Benjamini , Noam Berger , Yuval Peres
‹ Prev 1 8 9 10 Next ›