D. Coupier

activity

20242026

collaborators

5 papers

math.PR2026

Construction of ergodic IDLA forests in $Z^{d}$

Nicolas Chenavier, David Coupier, Keenan Penner +1

We prove the existence of infinite-volume IDLA forests in $Z^{d}$ , with $d \geq 2$ , based on a multi-source IDLA protocol. Unlike IDLA aggregates, the laws of the IDLA fore…

math.PR2026

The $K$ -th nearest neighbor random walk on a Poisson point process gets trapped

Anne-Laure Basdevant, David Coupier, Jean-Baptiste GouÃ©rÃ© +1

The $K$ -th nearest neighbor random walk $(X_{n})_{n \geq 0}$ on a homogeneous Poisson point process $I ¨ $ on $R^{d}$ ( $d \geq 1$ ), starts at the origin and at each step picks its next P…

math.PR2025

IDLA with sources in a hyperplane of $Z^{d}$

Nicolas Chenavier, David Coupier, Keenan Penner +1

We consider a random growth model based on the IDLA protocol with sources in a hyperplane of $Z^{d}$ . We provide a stabilization result and a shape theorem generalizing [7] in any d…

math.PR2025

The bi-dimensional Directed IDLA forest

Nicolas Chenavier, David Coupier, Arnaud Rousselle

We investigate three types of Internal Diffusion Limited Aggregation (IDLA) models. These models are based on simple random walks on $Z^{2}$ with infinitely many sources tha…

math.PR2024

The Planar Lattice Two-Neighbor Graph Percolates

David Coupier, BenoÃ®t Henry, Benedikt Jahnel +1

The k-neighbor graph is a directed percolation model on the hypercubic lattice Z d in which each vertex independently picks exactly k of its 2d nearest neighbors at random, and we…

Construction of ergodic IDLA forests in Zd

The K-th nearest neighbor random walk on a Poisson point process gets trapped

IDLA with sources in a hyperplane of Zd

The bi-dimensional Directed IDLA forest

The Planar Lattice Two-Neighbor Graph Percolates

Construction of ergodic IDLA forests in $Z^{d}$

The $K$ -th nearest neighbor random walk on a Poisson point process gets trapped

IDLA with sources in a hyperplane of $Z^{d}$