Explore optimal transport for graphs in this 55-minute conference talk by Nicolas Courty, recorded during the "Machine Learning and Signal Processing on Graphs" thematic meeting at the Centre International de Rencontres Mathématiques in Marseille, France. Delve into definitions and applications to graph-signal processing, gaining insights from a leading mathematician in the field. Access this video and other talks by worldwide mathematicians through CIRM's Audiovisual Mathematics Library, featuring chapter markers, keywords, enriched content with abstracts and bibliographies, and a multi-criteria search function for easy navigation.
Optimal Transport for Graphs: Definitions and Applications to Graph-Signal Processing
Centre International de Rencontres Mathématiques via YouTube
Overview
Syllabus
Nicolas Courty: Optimal transport for graphs: definitions, applications to graph-signal processing
Taught by
Centre International de Rencontres Mathématiques
Related Courses
-
Weak Limits for Entropic Optimal Transport - Part II
-
Merging Rate of Opinions via Optimal Transport on Random Measures
-
Crossing the Line: From Graphs to Curves
-
Boundary States of the Magnetic Robin Laplacian
-
Optimal Revealed Utilities and Convex Pricing Kernels: A Forward Point of View
-
On the Concave One-Dimensional Random Assignment Problem: Kantorovich Meets Young
