For external attendees, please RSVP HERE.
We will show how Wilson's algorithm for rooted spanning forests in a finite graph provides a way to build a well distributed set of vertices of any given size in any edge weighted graph. We will discuss applications to build multiresolution analysis for graph signal processing through approximate solutions of intertwining equations. This is based on a joint work with Luca Avena, Fabienne Castell and Clothilde Mélot.
I have done my PhD with Enzo Olivieri in Rome and Raphaël Cerf in Orsay. I am a CNRS researcher in Marseille.
Seminar by the NYU-ECNU Institute of Mathematical Sciences at NYU Shanghai