Parallel Computation of Persistent Homology using the Blowup Complex
Abstract
We describe a parallel algorithm that computes persistent homology, an algebraic descriptor of a filtered topological space. Our algorithm is distinguished by operating on a spatial decomposition of the domain, as opposed to a decomposition with respect to the filtration. We rely on a classical construction, called the Mayer--Vietoris blowup complex, to glue global topological information about a space from its disjoint subsets. We introduce an efficient algorithm to perform this gluing operation, which may be of independent interest, and describe how to process the domain hierarchically. We report on a set of experiments that help assess the strengths and identify the limitations of our method.
- Authors:
-
- Stanford Univ., CA (United States)
- Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
- Publication Date:
- Research Org.:
- Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States), Computational Research Division
- Sponsoring Org.:
- USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
- OSTI Identifier:
- 1235080
- Report Number(s):
- LBNL-177165
ir:177165
- DOE Contract Number:
- AC02-05CH11231
- Resource Type:
- Conference
- Resource Relation:
- Conference: 27. ACM symposium on parallelism in algorithms and architectures (SPAA15), Portland, OR (United States), 13-15 Jun 2015
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 97 MATHEMATICS AND COMPUTING
Citation Formats
Lewis, Ryan, and Morozov, Dmitriy. Parallel Computation of Persistent Homology using the Blowup Complex. United States: N. p., 2015.
Web. doi:10.1145/2755573.2755587.
Lewis, Ryan, & Morozov, Dmitriy. Parallel Computation of Persistent Homology using the Blowup Complex. United States. https://doi.org/10.1145/2755573.2755587
Lewis, Ryan, and Morozov, Dmitriy. 2015.
"Parallel Computation of Persistent Homology using the Blowup Complex". United States. https://doi.org/10.1145/2755573.2755587. https://www.osti.gov/servlets/purl/1235080.
@article{osti_1235080,
title = {Parallel Computation of Persistent Homology using the Blowup Complex},
author = {Lewis, Ryan and Morozov, Dmitriy},
abstractNote = {We describe a parallel algorithm that computes persistent homology, an algebraic descriptor of a filtered topological space. Our algorithm is distinguished by operating on a spatial decomposition of the domain, as opposed to a decomposition with respect to the filtration. We rely on a classical construction, called the Mayer--Vietoris blowup complex, to glue global topological information about a space from its disjoint subsets. We introduce an efficient algorithm to perform this gluing operation, which may be of independent interest, and describe how to process the domain hierarchically. We report on a set of experiments that help assess the strengths and identify the limitations of our method.},
doi = {10.1145/2755573.2755587},
url = {https://www.osti.gov/biblio/1235080},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Mon Apr 27 00:00:00 EDT 2015},
month = {Mon Apr 27 00:00:00 EDT 2015}
}
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.