activity
20132026
most citedThe random walk on the random connection model

4 citations · 10 across the 10 of their papers we have counts for

collaborators

12 papers

math.PR2026

Peaks over Threshold in Scale-Free Random Graphs

Arnaud Rousselle, Ercan Sönmez

We explore extreme value phenomena in spatial scale-free random graphs in a continuum setting based on a homogeneous Poisson point process in . Vertices carry i.i.d.…

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

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.PR2022

Compound Poisson approximation for simple transient random walks in random sceneries

Nicolas Chenavier, Ahmad Darwiche, Arnaud Rousselle

Given a simple transient random walk in and a stationary sequence of real random variables , we investigate the extremes of…

math.PR2022★ 2 cited

The longest edge of the one-dimensional soft random geometric graph with boundaries

Arnaud Rousselle, Ercan Sönmez

The object of study is a soft random geometric graph with vertices given by a Poisson point process on a line and edges between vertices present with probability that has a polynom…

math.PR2021

The longest edge in discrete and continuous long-range percolation

Arnaud Rousselle, Ercan Sönmez

We consider the random connection model in which an edge between two Poisson points at distance is present with probability . We conduct an extreme value analysis on this…

math.PR2020

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 with infinitely many sources tha…

math.PR2019★ 4 cited

The random walk on the random connection model

Ercan Sönmez, Arnaud Rousselle

We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices and are connected with probability that asympt…

math.PR2017

Recurrence of Multidimensional Persistent Random Walks. Fourier and Series Criteria

Peggy Cénac, Basile De Loynes, Yoann Offret +1

The recurrence features of persistent random walks built from variable length Markov chains are investigated. We observe that these stochastic processes can be seen as L{é}vy walks…

math.PR2015★ 3 cited

Annealed invariance principle for random walks on random graphs generated by point processes in

Arnaud Rousselle

We consider simple random walks on random graphs embedded in and generated by point processes such as Delaunay triangulations, Gabriel graphs and the creek-crossing…

math.PR2014

Quenched invariance principle for random walks on Delaunay triangulations

Arnaud Rousselle

We consider simple random walks on Delaunay triangulations generated by point processes in . Under suitable assumptions on the point processes, we show that the rando…

math.PR2013★ 1 cited

Recurrence or transience of random walks on random graphs generated by point processes in

Arnaud Rousselle

We consider random walks associated with conductances on Delaunay triangulations, Gabriel graphs and skeletons of Voronoi tilings which are generated by point processes in $\mathbb…