Persistence and filtered complexes
These treatments share a subject; their labels distinguish the questions they answer.
- A hole appears and disappears — Mathematical lesson. When does a hole appear and disappear, and how can I read its interval?
- Finite encodings: recovering a module from finite data — Mathematical lesson. How can finite data recover a module over an infinite parameter domain?
- Persistence modules over posets — Mathematical lesson. How do vector spaces and compatible maps describe persistence?
- Why two parameters change the problem — Mathematical lesson. Why do two parameters require spaces and maps beyond a barcode?
- Choosing views and inspecting intervals — Library guide. Which view lets me investigate the mathematical object I have computed?
- Exploring slices, intervals and signed contributions — Library guide. How do I interpret slice intervals, matching witnesses and signed contributions of an encoding?
- From inputs to computed objects — Library guide. Which construction route should I choose, and what object will it return?
- From source cells to representative classes — Library guide. Which source cells explain a selected class, and how is that correspondence checked?
- Ordinary persistent homology — Library guide. Which ordinary persistence construction and retained output answer my question?
- Working with complexes and spectral pages — Library guide. How do I build a compatible complex and inspect its homology, connecting maps or successive pages?
- Compute persistence relative to a boundary — Task recipe. How do I construct a checked filtered pair and read its relative interval?
- Explain a distance through its matching — Task recipe. Which matched and unmatched intervals account for a computed diagram distance?
- From a point cloud to comparisons and features — Task recipe. How do I compare two ordinary diagrams, make finite features and save the result with retained data?
- Filtered pairs and relative persistence — API reference. What input, basis and map conventions define relative persistence?
- Source representatives — API reference. What is retained and verified when a chain or cocycle is traced to source cells?
- Exact rhomboid multicover construction — Implementation account. Which representations and algorithms underlie exact rhomboid multicover construction, and why?
- Relative persistence of filtered pairs — Implementation account. How are quotient persistence and its connecting maps computed for a filtered pair?
- Retaining representatives and tracing them to source cells — Implementation account. Which representations and algorithms underlie retaining representatives and tracing them to source cells, and why?
- C++ Ripser: ordinary Rips barcodes — Benchmark report. How does TamerOp compare with original C++ Ripser on larger complete-barcode requests?
- CubicalRipser: cubical barcodes — Benchmark report. How do TamerOp and CubicalRipser compare on large image and volume barcodes?
- PHAT: ordinary persistence — Benchmark report. What does the scoped comparison with PHAT establish?
- Ripser.py: Vietoris–Rips persistence — Benchmark report. What does the fixed comparison with Ripser.py establish for ordinary Rips barcodes, cocycles and landmark workflows?