Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Algorithmic Reconstruction of the Fiber of Persistent Homology on Cell Complexes (2110.14676v1)

Published 27 Oct 2021 in cs.CG and math.AT

Abstract: Let $K$ be a finite simplicial, cubical, delta or CW complex. The persistence map $\mathrm{PH}$ takes a filter $f:K \rightarrow \mathbb{R}$ as input and returns the barcodes $\mathrm{PH}(f)$ of the associated sublevel set persistent homology modules. We address the inverse problem: given a target barcode $D$, computing the fiber $\mathrm{PH}{-1}(D)$. For this, we use the fact that $\mathrm{PH}{-1}(D)$ decomposes as complex of polyhedra when $K$ is a simplicial complex, and we generalise this result to arbitrary based chain complexes. We then design and implement a depth first search algorithm that recovers the polyhedra forming the fiber $\mathrm{PH}{-1}(D)$. As an application, we solve a corpus of 120 sample problems, providing a first insight into the statistical structure of these fibers, for general CW complexes.

Citations (5)

Summary

We haven't generated a summary for this paper yet.