Personal tools

The Reeb graph interleaving distance

Elizabeth Munch, U Albany

  • Computer Science Seminar
  • Geometry/ Topology Seminar
When Wed, Oct 12, 2016
from 03:10 PM to 04:00 PM
Where 115 Ritter Hall
Contact Name
Add event to calendar vCal

In order to understand the properties of a real-valued function on a topological space, we can study the Reeb graph of that function.  Since it is efficient to compute and is a useful descriptor for the function, it has found its place in many applications. However, as with many other constructions in computational topology, we are interested in how to deal with this construction in the context of noise.  In this talk, we will define the interleaving distance for Reeb graphs, discuss computational complexity issues arising from this definition and potential directions for approximation.  The interleaving distance also provides other insights such as convergence and approximation results for Mapper, a commonly used tool in TDA, as well as an understanding of these structures in higher dimensional settings.

« April 2018 »
Upcoming Events
Math/CS Club
Wed, Apr 25, 2018
The Mathematical Match Game Brody Johnson, SLU
PhD Oral Defense
Thu, Apr 26, 2018
Finite, fiber-preserving group actions on orientable Seifert manifolds Benjamin Peet, SLU
PhD Oral Exam
Fri, Apr 27, 2018
Leavitt Path Superalgebras Katie Radler, SLU
Annual Awards Ceremony
Fri, Apr 27, 2018
The 2018 Math & Statistics Department Award Ceremony Featuring Sarah Greenwald, Appalachian State University
Geometry/ Topology Seminar
Tue, May 01, 2018
Necessary and Sufficient Conditions for a Triangle Comparison Theorem, II James Hebda, SLU
Previous events…
Upcoming events…