7 citations · 15 across the 4 of their papers we have counts for
4 papers · 1 filter
Efficient Computation of Image Persistence
Ulrich Bauer, Maximilian Schmahl
We present an algorithm for computing the barcode of the image of a morphisms in persistent homology induced by an inclusion of filtered finite-dimensional chain complexes. These a…
Parametrized Complexity of Expansion Height
Ulrich Bauer, Abhishek Rathod, Jonathan Spreer
Deciding whether two simplicial complexes are homotopy equivalent is a fundamental problem in topology, which is famously undecidable. There exists a combinatorial refinement of th…
Persistent Betti numbers of random Čech complexes
Ulrich Bauer, Florian Pausinger
We study the persistent homology of random Čech complexes. Generalizing a method of Penrose for studying random geometric graphs, we first describe an appropriate theoretical frame…
Clear and Compress: Computing Persistent Homology in Chunks
Ulrich Bauer, Michael Kerber, Jan Reininghaus
We present a parallelizable algorithm for computing the persistent homology of a filtered chain complex. Our approach differs from the commonly used reduction algorithm by first co…