English
Related papers

Related papers: Sharpness of phase transition for Voronoi percolat…

200 papers

Chaotic mixing in a closed vessel is studied experimentally and numerically in different 2-D flow configurations. For a purely hyperbolic phase space, it is well-known that concentration fluctuations converge to an eigenmode of the…

We consider the model of i.i.d. first passage percolation on $\mathbb{Z}^d$ : we associate with each edge $e$ of the graph a passage time $t(e)$ taking values in $[0,+\infty]$, such that $\mathbb{P}[t(e)<+\infty] >p_c(d)$. Equivalently, we…

Probability · Mathematics 2014-11-21 Raphaël Cerf , Marie Théret

A Voronoi diagram is a basic geometric structure that partitions the space into regions associated with a given set of sites, such that all points in a region are closer to the corresponding site than to all other sites. While being…

Computational Geometry · Computer Science 2023-01-27 Tobias Friedrich , Maximilian Katzmann , Leon Schiller

We introduce a continuum percolation model defined on the points of a d-dimensional homogeneous Poisson process. Each Poisson point is connected to all points within its connection range, which depends on the distances to the other Poisson…

Probability · Mathematics 2007-05-23 A. Gillett , M. Nuyens

Let $ \mathbb{L}^{d} = ( \mathbb{Z}^{d},\mathbb{E}^{d} ) $ be the $ d $-dimensional hypercubic lattice. We consider a model of inhomogeneous Bernoulli percolation on $ \mathbb{L}^{d} $ in which every edge inside the $ s $-dimensional…

Probability · Mathematics 2021-07-22 Bernardo N. B. de Lima , Sébastien Martineau , Humberto C. Sanna , Daniel Valesin

We study phase transition and percolation at criticality for three random graph models on the plane, viz., the homogeneous and inhomogeneous enhanced random connection models (RCM) and the Poisson stick model. These models are built on a…

Probability · Mathematics 2020-04-03 Srikanth K. Iyer , Sanjoy Kr. Jhawar

We consider the Voronoi tessellation associated to a stationary simple point process on $\mathbb{R}^d$ with finite and positive intensity. We introduce the Delaunay triangulation as its dual graph, i.e.~the graph with vertex set given by…

Probability · Mathematics 2026-03-25 A. Faggionato , C. Tagliaferri

Given $\alpha \in (0, \infty)$ and $r \in (0, \infty)$, let ${\cal D}_{r, \alpha}$ be the disc of radius $r$ in the hyperbolic plane having curvature $-\alpha^2$. Consider the Poisson point process having uniform intensity density on ${\cal…

Probability · Mathematics 2021-01-01 Nikolaos Fountoulakis , Joseph Yukich

In the corrupted compass model on a vertex-transitive graph, a neighbouring edge of every vertex is chosen uniformly at random and opened. Additionally, with probability $p$, independently for every vertex, every neighbouring edge is…

Probability · Mathematics 2020-09-09 Thomas Beekenkamp

We consider a multiscale Boolean percolation on $\mathbb R^d$ with radius distribution $\mu$ on $[1,+\infty)$, $d\ge 2$. The model is defined by superposing the original Boolean percolation model with radius distribution $\mu$ with a…

Probability · Mathematics 2023-01-05 Barbara Dembin

In this work we consider the two-dimensional percolation model arising from the majority dynamics process at a given time $t\in\mathbb{R}_+$. We show the emergence of a sharp threshold phenomenon for the box crossing event at the critical…

Probability · Mathematics 2022-10-11 Caio Alves , Rangel Baldasso

We consider Bernoulli percolation on $\mathbb Z^d$ with $d>6$. We prove an up-to-constant estimate for the critical two-point function restricted to a half-space. This completes previous results of Chatterjee and Hanson (Commun. Pure Appl.…

Probability · Mathematics 2026-03-09 Romain Panis , Bruno Schapira

We study a partially hyperbolic and topologically transitive local diffeomorphism $F$ that is a skew-product over a horseshoe map. This system is derived from a homoclinic class and contains infinitely many hyperbolic periodic points of…

Dynamical Systems · Mathematics 2011-09-13 L. J. Díaz , K. Gelfert

Porous materials made up of impermeable polyhedral grains constrain fluid flow to voids around the impenetrable constituent barrier particles. A percolation transition marks the boundary between assemblies of grains which contain system…

Statistical Mechanics · Physics 2018-12-05 Donald Priour , Nicholas McGuigan

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 that Bernoulli bond percolation on any nonamenable, Gromov hyperbolic, quasi-transitive graph has a phase in which there are infinitely many infinite clusters, verifying a well-known conjecture of Benjamini and Schramm (1996) under…

Probability · Mathematics 2019-03-27 Tom Hutchcroft

We consider a continuum percolation model on $\R^d$, $d\geq 1$.For $t,\lambda\in (0,\infty)$ and $d\in\{1,2,3\}$, the occupied set is given by the union of independent Brownian paths running up to time $t$ whoseinitial points form a Poisson…

Probability · Mathematics 2015-12-31 Dirk Erhard , Julián Martínez , Julien Poisat

The Hamming graph $H(d,n)$ is the Cartesian product of $d$ complete graphs on $n$ vertices. Let $m=d(n-1)$ be the degree and $V = n^d$ be the number of vertices of $H(d,n)$. Let $p_c^{(d)}$ be the critical point for bond percolation on…

Probability · Mathematics 2020-02-19 Lorenzo Federico , Remco van der Hofstad , Frank den Hollander , Tim Hulshof

In r-neighbour bootstrap percolation on a graph G, a (typically random) set A of initially 'infected' vertices spreads by infecting (at each time step) vertices with at least r already-infected neighbours. This process may be viewed as a…

Probability · Mathematics 2011-02-25 József Balogh , Béla Bollobás , Hugo Duminil-Copin , Robert Morris

We study Mandelbrot's percolation process in dimension $d \geq 2$. The process generates random fractal sets by an iterative procedure which starts by dividing the unit cube $[0,1]^d$ in $N^d$ subcubes, and independently retaining or…

Probability · Mathematics 2008-02-22 Erik I. Broman , Federico Camia