214 citations · 626 across the 16 of their papers we have counts for
18 papers
Fast Queries of Fibered Barcodes
Michael Lesnick, Matthew Wright
The fibered barcode of a bipersistence module is the map sending each non-negatively sloped affine line to the barcode of the restr…
Efficient two-parameter persistence computation via cohomology
Ulrich Bauer, Fabian Lenzen, Michael Lesnick
Clearing is a simple but effective optimization for the standard algorithm of persistent homology (PH), which dramatically improves the speed and scalability of PH computations for…
An Introduction to Multiparameter Persistence
Magnus Bakke Botnan, Michael Lesnick
In topological data analysis (TDA), one often studies the shape of data by constructing a filtered topological space, whose structure is then examined using persistent homology. Ho…
The Universal -Metric on Merge Trees
Robert Cardona, Justin Curry, Tung Lam +1
Adapting a definition given by Bjerkevik and Lesnick for multiparameter persistence modules, we introduce an -type extension of the interleaving distance on merge trees. We…
-Distances on Multiparameter Persistence Modules
Håvard Bakke Bjerkevik, Michael Lesnick
Motivated both by theoretical and practical considerations in topological data analysis, we generalize the -Wasserstein distance on barcodes to multiparameter persistence module…
Computing the Multicover Bifiltration
René Corbet, Michael Kerber, Michael Lesnick +1
Given a finite set , let Cov denote the set of all points within distance to at least points of . Allowing and to vary, we obtain a…