Event Type:

Mathematical Biology Seminar

Date/Time:

Wednesday, January 31, 2018 - 16:00 to 17:00

Location:

GILK 100

Guest Speaker:

Institution:

George Mason University

Abstract:

This talk is a recording made by the MBI at Ohio State University: https://mbi.osu.edu/video/player/?id=4080&title=Persistent+vs.+Consisten...

Persistent homology has become a standard tool in modern data analysis, identifying homology generators at various scales as a parameter representing distances between points is increased. We show that for general sampling from a Riemannian manifold, there is a graph construction that captures all topological features in a single graph, which we call `consistent' homology. More precisely, the graph converges spectrally to the Laplace-De Rham operator of the manifold in the limit of large data. The graph construction, called continuous k-nearest neighbors (CkNN), neutralizes nonuniform sampling, and in practice reduces data requirements as well. We examine under which circumstances persistent or consistent approaches are preferred, and illustrate with data from neural cultures and physical experiments.