activity
20022017
most citedA local limit theorem for random walks in random scenery and on randomly oriented lattices

30 citations · 70 across the 12 of their papers we have counts for

collaborators

15 papers

math.PR2017★ 19 cited

Random Forests and Networks Analysis

L. Avena, F. Castell, A. Gaudilliere +1

D. Wilson~\cite{[Wi]} in the 1990's described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees…

cs.IT2017

Intertwining wavelets or Multiresolution analysis on graphs through random forests

Luca Avena, Fabienne Castell, Alexandre Gaudillière +1

We propose a new method for performing multiscale analysis of functions defined on the vertices of a finite connected weighted graph. Our approach relies on a random spanning fores…

math.PR2017★ 1 cited

Approximate and exact solutions of intertwining equations through random spanning forests

Luca Avena, Fabienne Castell, Alexandre Gaudillière +1

For different reversible Markov kernels on finite state spaces, we look for families of probability measures for which the time evolution almost remains in their convex hull. Motiv…

math.PR2014

Persistence exponent for random processes in Brownian scenery

Fabienne Castell, Nadine Guillotin-Plantard, Frederique Watbled

In this paper we consider the persistence properties of random processes in Brownian scenery, which are examples of non-Markovian and non-Gaussian processes. More precisely we stud…

math.PR2012

Exponential moments of self-intersection local times of stable random walks in subcritical dimensions

Fabienne Castell, Clément Laurent, Clothilde Mélot

Let be an -stable random walk with values in . Let be its local time. For , not necessarily integer, $I_t = \sum_x l…

math.PR2012

On the local time of random processes in random scenery

Fabienne Castell, Nadine Guillotin--Plantard, Françoise Pène +1

Random walks in random scenery are processes defined by , where basically and are two independent sequences o…