Well Distributed Points and Approximate Solutions of Intertwining Equations

Topic: 
Well Distributed Points and Approximate Solutions of Intertwining Equations
Date & Time: 
Tuesday, December 10, 2019 - 11:00 to 12:00
Speaker: 
Alexandre Gaudilliere, The French National Centre for Scientific Research(CNRS)
Location: 
Room 310, Pudong Campus, 1555 Century Avenue

For external attendees, please RSVP HERE

Abstract:

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.

Biography:

I have done my PhD with Enzo Olivieri in Rome and Raphaël Cerf in Orsay. I am a CNRS researcher in Marseille.

- Download the Flyer - 

Seminar by the NYU-ECNU Institute of Mathematical Sciences at NYU Shanghai