A comparison framework for interleaved persistence modules

From MaRDI portal
Publication:2324604




Abstract: We present a generalization of the induced matching theorem and use it to prove a generalization of the algebraic stability theorem for mathbbR-indexed pointwise finite-dimensional persistence modules. Via numerous examples, we show how the generalized algebraic stability theorem enables the computation of rigorous error bounds in the space of persistence diagrams that go beyond the typical formulation in terms of bottleneck (or log bottleneck) distance.











This page was built for publication: A comparison framework for interleaved persistence modules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2324604)