A new construction for sublevel set persistence

Abstract

We construct a filtered simplicial complex (XL,fL) associated to a subset X⊂ Rd, a function f:X→ R with compactly supported sublevel sets, and a collection of landmark points L⊂ Rd. The persistence values fL() are defined as the minimizing values of a family of constrained optimization problems, whose domains are certain higher order Voronoi cells associated to L. We prove that Hka,b(XL) Ha,bk(X) provided that f is the restriction of a smooth function, the landmarks are sufficiently dense, and a<b are generic, and we show that the construction produces desirable results in some examples.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…