22 citations · 103 across the 32 of their papers we have counts for
3 papers · 1 filter
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…
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…
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…