Title	Multi starts at one: Efficient computation of Vietorisâ Rips persistence barcodes
Creator	Bauer, Ulrich
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2018-08-08T09:01
Description	I will discuss the efficient computation of the Vietorisâ Rips persistence barcode for a finite metric space. The implementation in the C++ code â Ripserâ focuses on memory and time efficiency, outperforming previous software on typical benchmark examples both in terms of time and memory. The improved computational efficiency is based on a close connection between persistent homology and discrete Morse theory, together with novel algorithmic design principles, avoiding the explicit construction of the filtration boundary matrix.
Extent	55.0
Subject	Mathematics; Algebraic topology; Statistics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Technische Universität München
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2019-03-24
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0377395
URI	http://hdl.handle.net/2429/69153
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos