Colloquia: Difference between revisions

Revision as of 18:54, 24 February 2023

UW Madison mathematics Colloquium is on Fridays at 4:00 pm.

February 3, 2023, Friday at 4pm Facundo Mémoli (Ohio State University)

(host: Lyu)

The Gromov-Hausdorff distance between spheres.

The Gromov-Hausdorff distance is a fundamental tool in Riemanian geometry (through the topology it generates) and is also utilized in applied geometry and topological data analysis as a metric for expressing the stability of methods which process geometric data (e.g. hierarchical clustering and persistent homology barcodes via the Vietoris-Rips filtration). In fact, distances such as the Gromov-Hausdorff distance or its Optimal Transport variants (i.e. the so-called Gromov-Wasserstein distances) are nowadays often invoked in applications related to data classification.

Whereas it is often easy to estimate the value of the Gromov-Hausdorff distance between two given metric spaces, its precise value is rarely easy to determine. Some of the best estimates follow from considerations related to both the stability of persistent homology and to Gromov's filling radius. However, these turn out to be non-sharp.

In this talk, I will describe these estimates and also results which permit calculating the precise value of the Gromov-Hausdorff between pairs of spheres (endowed with their usual geodesic distance). These results involve lower bounds which arise from a certain version of the Borsuk-Ulam theorem that is applicable to discontinuous maps, and also matching upper bounds which are induced from specialized constructions of (a posteriori optimal) ``correspondences" between spheres.

February 24, 2023, Cancelled/available

March 3, 2023, Friday at 4pm Stefan Steinerberger (University of Washington)

Title: How curved is a combinatorial graph?

Abstract: Curvature is one of the fundamental ingredients in differential geometry. People are increasingly interested in whether it is possible to think of combinatorial graphs as behaving like manifolds and a number of different notions of curvature have been proposed. I will introduce some of the existing ideas and then propose a new notion based on a simple and explicit linear system of equations that is easy to compute. This notion satisfies a surprisingly large number of desirable properties -- connections to game theory (especially the von Neumann Minimax Theorem) and potential theory will be sketched; simultaneously, there is a certain "magic" element to all of this that is poorly understood and many open problems remain. I will also sketch some curious related problems that remain mostly open. No prior knowledge of differential geometry (or graphs) is required.

(hosts: Shaoming Guo, Andreas Seeger)