Monoidal Rips: stable multiparameter filtrations of directed networks
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.Abstract
We introduce the monoidal Rips filtration, a filtered simplicial set for weighted directed graphs and other lattice-valued networks. Our construction generalizes the Vietoris-Rips filtration for metric spaces by replacing the maximum operator, determining the filtration values, with a more general monoidal product. We establish interleaving guarantees for the monoidal Rips persistent homology, capturing existing stability results for real-valued networks. When the lattice is a product of totally ordered sets, we are in the setting of multiparameter persistence. Here, the interleaving distance is bounded in terms of a generalized network distance. We use this to prove a novel stability result for the sublevel Rips bifiltration. Our experimental results show that our method performs better than Flagser in a graph regression task, and that combining different monoidal products in point cloud classification can improve performance.
Fields of Study & Subjects
Topological and Geometric Data Analysis
Homotopy and Cohomology in Algebraic Topology
Geometric and Algebraic Topology
Publication details
- Journal / source
- Journal of Applied and Computational Topology
- Volume
- 10
- Issue
- 2
- Pages
- 6
- Publication date
- 31 March 2026
- Language
- EN