Magnus Bakke Botnan

Jun
21
On the bottleneck stability of rank decompositions of multi-parameter persistence modules

On the bottleneck stability of rank decompositions of multi-parameter persistence modules

Magnus Bakke Botnan, Steffen Oppermann, Steve Oudot, Luis Scoccola A significant part of modern topological data analysis is concerned with
1 min read
Mar
11
Computing p-presentation distances is hard

Computing p-presentation distances is hard

Håvard Bakke Bjerkevik, Magnus Bakke Botnan Recently, p-presentation distances for p∈[1,∞] were introduced for merge trees and multiparameter persistence
1 min read