BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Department of Mathematics - ECPv5.16.3.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Department of Mathematics
X-ORIGINAL-URL:https://math.unc.edu
X-WR-CALDESC:Events for Department of Mathematics
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20191029T160000
DTEND;TZID=America/New_York:20191029T170000
DTSTAMP:20220817T071922
CREATED:20191011T171816Z
LAST-MODIFIED:20191011T171816Z
UID:5808-1572364800-1572368400@math.unc.edu
SUMMARY:Wesley Hamilton - Part 2: Optimal Transport and Discrete/Continuum Laplacians - Advanced GMA Seminar
DESCRIPTION:Title: Optimal Transport and Discrete/Continuum Laplacians \nAbstract: In the past 20 years\, spectral methods have shown to be increasingly effective at a wide variety of data analytic problems. These spectral methods usually involve a graph Laplacian constructed from the data points\, which behaves like a discrete version of the familiar (second order differential operator) continuum Laplacian. Since we’re primarily interested in the spectrum of the graph Laplacian\, a natural question is: if we take a denser and denser sampling\, does the spectrum of the graph Laplacian converge to the spectrum of the continuum Laplacian? In this series of lectures\, we’ll see that we do indeed have convergence of the spectrum from the discrete to continuum setting. Moreover\, we’ll see that the graph Laplacian’s eigenvectors also converge (in an appropriate sense) to the continuum Laplacian’s eigenfunctions: the fact that discrete eigenstuff converges to the corresponding continuum eigenstuff is what we call consistency. Lecture 1 will provide an overview of the types of consistency problems that arise and have been studied\, as well as some applications. In lecture 2\, we’ll focus on pointwise convergence results\, including an analysis of the classic Laplacian Eigenmap algorithm and its related constructions. Lecture 3 (and onwards) will take a variational point of view\, using an optimal transport framework to get similar convergence results. This new framework will also let us determine the consistency of other graph operators\, such as the graph cut converging to arclength\, and the graph total variation converging to Dirichlet energy.
URL:https://math.unc.edu/event/wesley-hamilton-part-2-optimal-transport-and-discrete-continuum-laplacians-advanced-gma-seminar/
LOCATION:Phillips 332
CATEGORIES:GMA Seminar
END:VEVENT
END:VCALENDAR