Discrete level set persistence for finite discrete functions
From MaRDI portal
Cites work
- A set of independent postulates for cyclic order.
- A user's guide to discrete Morse theory
- An Algorithm for the Machine Calculation of Complex Fourier Series
- ANAPT: additive noise analysis for persistence thresholding
- Categorification of persistent homology
- Computational topology for data analysis
- Computational topology. An introduction
- Computer arithmetic and validity. Theory, implementation, and applications
- Computing contour trees in all dimensions
- Convergence between categorical representations of Reeb space and mapper
- Cuts in cyclically ordered sets
- Cyclic ordering through partial orders
- Decorated merge trees for persistent topology
- Discrete Morse theoretic algorithms for computing homology of complexes and maps
- Dynamically maintaining the persistent homology of time series
- Efficient computation of a hierarchy of discrete 3D gradient vector fields
- Extending persistence using Poincaré and Lefschetz duality
- Extremal event graphs: a (stable) tool for analyzing noisy time series data
- From trees to barcodes and back again. II: Combinatorial and probabilistic aspects of a topological inverse problem
- Geometric characterization of the persistence of 1D maps
- Homology and robustness of level and interlevel sets
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 1461253 (Why is no real title available?)
- scientific article; zbMATH DE number 3450200 (Why is no real title available?)
- scientific article; zbMATH DE number 2200453 (Why is no real title available?)
- scientific article; zbMATH DE number 3304698 (Why is no real title available?)
- Inter-relations among the four principal types of order.
- Introduction to graph signal processing
- Lectures on Morse theory, old and new
- Measuring the distance between merge trees
- Model rejection and parameter reduction via time series
- Morse theory for filtrations and efficient computation of persistent homology
- Morse Theory. (AM-51)
- Nondegenerate critical manifolds
- On the definition of the homological critical value
- Reconstructing embedded graphs from persistence diagrams
- Sets of completely independent postulates for cyclic order.
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Stability of critical points with interval persistence
- Stability of persistence diagrams
- The calculus of snakes and the combinatorics of Bernoulli, Euler and Springer numbers of Coxeter groups
- The calculus of variations in the large.
- The extended persistent homology transform of manifolds with boundary
- The fiber of the persistence map for functions on the interval
- The nature and meaning of perturbations in geometric computing
- The persistent homology of dual digital image constructions
- Topological signal processing
- Topology and data
- Triplet merge trees
- Universal distances for extended persistence
- Using extremal events to characterize noisy time series
- Zigzag persistent homology and real-valued functions
This page was built for publication: Discrete level set persistence for finite discrete functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7231021)
