Module tda_ext 

Extended Topological Data Analysis utilities

This module provides additional TDA constructs and free functions that complement the core tda module:

• VietorisRipsComplex: explicit simplex-list representation with Euler characteristic and simplex counting.
• compute_persistence: distance-matrix-based persistent homology.
• persistence_landscape_fn: evaluate persistence landscapes over a grid.
• persistence_image_fn: Gaussian-kernel persistence image from a diagram.
• wasserstein_distance_p: p-Wasserstein distance between diagrams.
• bottleneck_distance_fn: bottleneck distance as a free function.

References

• Edelsbrunner & Harer (2010). Computational Topology: An Introduction.
• Adams et al. (2017). Persistence Images: A Stable Vector Representation.
• Munch (2017). A User’s Guide to Topological Data Analysis.

Structs

VietorisRipsComplex

A Vietoris-Rips simplicial complex at a fixed scale epsilon.

Functions

compute_persistence

Compute persistent homology from a precomputed distance matrix.

persistence_image_fn

Compute a persistence image from a persistence diagram.

persistence_landscape_fn

Compute the persistence landscape of a diagram, evaluated at points x.