Expand description
Persistent Homology and Topological Data Analysis
Topological methods for analyzing shape and structure in data.
§Key Capabilities
- Persistent Homology: Track topological features (components, loops, voids)
- Betti Numbers: Count topological features at each scale
- Persistence Diagrams: Visualize feature lifetimes
- Bottleneck/Wasserstein Distance: Compare topological signatures
§Integration with Mincut
TDA complements mincut by providing:
- Long-term drift detection (shape changes over time)
- Coherence monitoring (are attention patterns stable?)
- Anomaly detection (topological outliers)
§Mathematical Background
Given a filtration of simplicial complexes K_0 ⊆ K_1 ⊆ … ⊆ K_n, persistent homology tracks when features are born and die.
Birth-death pairs form the persistence diagram.
Structs§
- Alpha
Complex - Alpha complex filtration (more efficient than Rips for low dimensions)
- Betti
Numbers - Betti numbers at a given scale
- Birth
Death Pair - Birth-death pair in persistence diagram
- Bottleneck
Distance - Bottleneck distance between persistence diagrams
- Filtration
- Filtration: sequence of simplicial complexes
- Persistence
Diagram - Persistence diagram: collection of birth-death pairs
- Persistent
Homology - Persistent homology computation
- Point
- Point in Euclidean space
- Point
Cloud - Point cloud for TDA
- Simplex
- A simplex (k-simplex has k+1 vertices)
- Simplicial
Complex - Simplicial complex (collection of simplices)
- Vietoris
Rips - Vietoris-Rips filtration
- Wasserstein
Distance - Wasserstein distance between persistence diagrams