English
Related papers

Related papers: High-intensity Voronoi percolation on manifolds

200 papers

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

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

Let $X$ be a compact Riemann surface of genus $g \geq 3$ and $S$ a finite subset of $X$. Let $\xi$ be fixed a holomorphic line bundle over $X$ of degree $d$. Let $\mathcal{M}_{pc}(r, d, \alpha)$ (respectively, $\mathcal{M}_{pc}(r, \alpha,…

Algebraic Geometry · Mathematics 2022-03-15 Anoop Singh

We investigate the problem of embedding infinite binary sequences into Bernoulli site percolation on $\mathbb{Z}^d$ with parameter $p$, known also as percolation of words.\ In 1995, I.\ Benjamini and H.\ Kesten proved that, for $d \geq 10$…

Probability · Mathematics 2013-10-22 Marcelo R. Hilário , Bernardo N. B. de Lima , Pierre Nolin , Vladas Sidoravicius

Let $X$ be a Poisson point process and $K\subset\mathbb{R}^d$ a measurable set. Construct the Voronoi cells of all points $x\in X$ with respect to $X$, and denote by $v_X(K)$ the union of all Voronoi cells with nucleus in $K$. For $K$ a…

Probability · Mathematics 2009-06-24 Matthias Heveling , Matthias Reitzner

We study Bernoulli bond percolation on nonunimodular quasi-transitive graphs, and more generally graphs whose automorphism group has a nonunimodular quasi-transitive subgroup. We prove that percolation on any such graph has a non-empty…

Probability · Mathematics 2020-02-26 Tom Hutchcroft

In graph bootstrap percolation, edges of an Erd\H{o}s-R\'enyi random graph ${\mathcal G}_{n,p}$ are initially active. Activation spreads to other edges of the complete graph $K_n$ by an iterative process governed by a fixed graph $H$,…

We study the topological stability of Voronoi percolation in higher dimensions. We show that slightly increasing p allows a discretization that preserves increasing topological properties with high probability. This strengthens a theorem of…

Probability · Mathematics 2026-01-05 Benjamin Schweinhart , Morgan Shuman

Given a hypergraph $\mathcal{H}$, the $\mathcal{H}$-bootstrap process starts with an initial set of infected vertices of $\mathcal{H}$ and, at each step, a healthy vertex $v$ becomes infected if there exists a hyperedge of $\mathcal{H}$ in…

Combinatorics · Mathematics 2020-10-08 Natasha Morrison , Jonathan A. Noel

We prove that for Bernoulli bond percolation on $\mathbb{Z}^d$, $d\geq 2$ the percolation density is an analytic function of the parameter in the supercritical interval $(p_c,1]$. This answers a question of Kesten from 1981.

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

We study the percolation phase transition on preferential attachment models, in which vertices enter with $m$ edges and attach proportionally to their degree plus $\delta$. We identify the critical percolation threshold as…

Probability · Mathematics 2023-12-22 Rajat Subhra Hazra , Remco van der Hofstad , Rounak Ray

Motivated by an application in wireless telecommunication networks, we consider a two-type continuum-percolation problem involving a homogeneous Poisson point process of users and a stationary and ergodic point process of base stations.…

Probability · Mathematics 2015-02-19 Christian Hirsch

We prove two results concerning percolation on general graphs. - We establish the converse of the classical Peierls argument: if the critical parameter for (uniform) percolation satisfies $p_c<1$, then the number of minimal cutsets of size…

Probability · Mathematics 2025-10-15 Philip Easo , Franco Severo , Vincent Tassion

We consider certain correspondences on a Riemann surface, and show that they admit a weak form of hyperbolicity: sufficiently long loops get shorter under lifting at a fixed point and closing. In terms of their algebraic encoding by bisets,…

Dynamical Systems · Mathematics 2025-10-16 Laurent Bartholdi , Dzmitry Dudko , Kevin M. Pilgrim

We study the phase transition of random radii Poisson Boolean percolation: Around each point of a planar Poisson point process, we draw a disc of random radius, independently for each point. The behavior of this process is well understood…

Probability · Mathematics 2016-05-20 Daniel Ahlberg , Vincent Tassion , Augusto Teixeira

We study a new geometric bootstrap percolation model, line percolation, on the $d$-dimensional integer grid $[n]^d$. In line percolation with infection parameter $r$, infection spreads from a subset $A\subset [n]^d$ of initially infected…

Probability · Mathematics 2017-06-06 Paul Balister , Béla Bollobás , Jonathan Lee , Bhargav Narayanan

The $r$-neighbour bootstrap process on a graph $G$ begins with a set of infected vertices; subsequently, healthy vertices become infected once they have at least $r$ infected neighbours. The central extremal problem in bootstrap percolation…

Combinatorics · Mathematics 2026-04-20 Jonathan A. Noel

Let $G$ be a higher rank semisimple real Lie group or the product of at least two automorphism groups of regular trees. We prove all probability measure preserving actions of lattices in such groups have cost one, answering Gaboriau's fixed…

Geometric Topology · Mathematics 2023-07-04 Mikolaj Fraczyk , Sam Mellick , Amanda Wilkens

We present an extension of Voronoi diagrams where when considering which site a client is going to use, in addition to the site distances, other site attributes are also considered (for example, prices or weights). A cell in this diagram is…

Computational Geometry · Computer Science 2016-08-24 Hsien-Chih Chang , Sariel Har-Peled , Benjamin Raichel

We answer a question of Benjamini and Schramm by proving that under reasonable conditions, quotienting a graph strictly increases the value of its percolation critical parameter $p_c$. More precisely, let $\mathcal{G}=(V,E)$ be a…

Probability · Mathematics 2018-09-17 Sébastien Martineau , Franco Severo