Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2111.02125

Expected Complexity of Persistence Barcode Computation via Matrix Reduction

Barbara Giunti·Guillaume Houry·Michael Kerber·Matthias Söls
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the algorithmic complexity of computing the persistence barcode of a randomly generated filtration. We provide a general technique to bound the expected complexity of reducing the boundary matrix in terms of the density of its reduced form. We apply this technique finding upper bounds for the average fill-in (number of non-zero entries) of the boundary matrix on \v{C}ech, Vietoris--Rips and Erd\H{o}s--R\'enyi filtrations after matrix reduction, thus obtaining bounds on the expected complexity of the barcode computation. Our method is based on previous results on the expected Betti numbers of the corresponding complexes. Our fill-in bounds for \v{C}ech and Vietoris--Rips complexes are asymptotically tight up to a logarithmic factor. In particular, both our fill-in and computation bounds are better than the worst-case estimates. We also provide an Erd\H{o}s--R\'enyi filtration realising the worst-case fill-in and computation.

Explore related subjects

math.ATcs.CC

Keep this discovery

BibTeXRIS

Barbara Giunti, Guillaume Houry, Michael Kerber, Matthias Söls. 2021-11-03. Expected Complexity of Persistence Barcode Computation via Matrix Reduction. https://arxiv.org/abs/2111.02125

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Homogeneous Milnor fibers and Kato--Matsumoto bounds via simplicial multiwedges

For every $n\geq 3$ and $s\geq 2$, we construct a homogeneous polynomial of degree $n(n+1)/2$ whose Milnor fiber is exactly $2s$-connected and whose rational cohomology contains a strictly defined nontrivial $n$-fold Massey product on classes of degree $2s+1$, implying that the Milnor fiber is non-formal, while attaining the Kato--Matsumoto connectivity bound. Our construction is based on the simplicial multiwedges of the nerve complexes of simple polytopes introduced by Limonchenko, combined with Suciu's realization of weighted homogeneous Milnor fibers. We thereby answer two problems posed by Suciu.

math.AT↗
arXiv2026

The homotopy types of directed path and trace spaces

We construct a saturated directed space with a Hausdorff $\Delta$-generated underlying space and two distinct points such that the trace space between them is homeomorphic to a square, whereas the directed path space has a nontrivial fundamental group. In particular, the canonical quotient map is not a weak homotopy equivalence. The same conclusion holds for regular directed paths modulo increasing homeomorphisms.

math.AT↗
arXiv2026

Moduli spaces of geometric functorial field theories

We develop tools to compute moduli spaces of geometric functorial field theories as mapping spaces of equivariant simplicial presheaves. Given a d-dimensional geometric structure F, presented as a presheaf on the site of smooth families of d-manifolds, we define its Cartesian realization, which is an O(d)-equivariant simplicial presheaf on the site of Cartesian spaces. We use Cartesian realizations to present the moduli space of functorial field theories with geometric structure F as a mapping space between O(d)-equivariant simplicial presheaves. In a companion paper, we use this result to compute the moduli space of smooth one-dimensional oriented Riemannian functorial field theories valued in an arbitrary smooth symmetric monoidal infinity-category.

math.AT↗