A new construction for sublevel set persistence
Algebraic Topology
2021-06-16 v2 Optimization and Control
Abstract
We construct a filtered simplicial complex associated to a subset , a function with compactly supported sublevel sets, and a collection of landmark points . The persistence values are defined as the minimizing values of a family of constrained optimization problems, whose domains are certain higher order Voronoi cells associated to . We prove that provided that is the restriction of a smooth function, the landmarks are sufficiently dense, and are generic, and we show that the construction produces desirable results in some examples.
Keywords
Cite
@article{arxiv.2106.04020,
title = {A new construction for sublevel set persistence},
author = {Erik Carlsson and John Carlsson},
journal= {arXiv preprint arXiv:2106.04020},
year = {2021}
}