2000 character limit reached
Bipath Persistence
Published 3 Apr 2024 in math.AT and math.RT | (2404.02536v1)
Abstract: In persistent homology analysis, interval modules play a central role in describing the birth and death of topological features across a filtration. In this work, we extend this setting, and propose the use of bipath persistent homology, which can be used to study the persistence of topological features across a pair of filtrations connected at their ends, to compare the two filtrations. In this setting, interval-decomposability is guaranteed, and we provide an algorithm for computing persistence diagrams for bipath persistent homology and discuss the interpretation of bipath persistence diagrams.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.