activity
20062026
most citedThe 2d-Directed Spanning Forest is almost surely a tree

35 citations · 84 across the 24 of their papers we have counts for

collaborators

29 papers

math.PR2026

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

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

The -th nearest neighbor random walk on a homogeneous Poisson point process on (), starts at the origin and at each step picks its next Po…

math.PR2025

Construction of ergodic IDLA forests in

Nicolas Chenavier, David Coupier, Keenan Penner +1

We prove the existence of infinite-volume IDLA forests in , with , based on a multi-source IDLA protocol. Unlike IDLA aggregates, the laws of the IDLA fore…

math.PR2024★ 1 cited

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…

math.PR2024

Absence of percolation for infinite Poissonian systems of stopped paths

David Coupier, David Dereudre, Jean-Baptiste Gouéré

The state space of our model is the Euclidean space in dimension d = 2. Simultaneously, from all points of a homogeneous Poisson point process, we let grow independent and identica…

math.PR2024

IDLA with sources in a hyperplane of

Nicolas Chenavier, David Coupier, Keenan Penner +1

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

math.PR2024

Line-of-sight Cox percolation on Poisson-Delaunay triangulation

David Corlin Marchand, David Coupier, Benoît Henry

In this work, percolation properties of device-to-device (D2D) networks in urban environments are investigated. The street system is modeled by a Poisson-Delaunay triangulation (PD…