Extensions and applications of persistence based algorithms in computational topology
Abstract/Contents
- Abstract
- In this thesis, we discuss various extensions and applications of the seminal idea of persistent homology applied to metric datasets. In the first part, we discuss the computation of certain classes of maps between chains on simplicial complexes. It turns out that the parameterization of appropriately functorial maps may be found by computing the homology of the hom-complex of two chain complexes. We also discuss the selection of geometrically meaningful maps through optimization procedures. In particular, one would be interested in computing maps between chains on the complexes that are bisimplicial - meaning that the images and preimages of simplices contain either zero or one simplices. We also develop a relaxation of this problem that can be framed as a linear program. The theory of zigzag persistence has opened new doors in topological data analysis. Hypothetical applications were discussed in a paper by Carlsson and de Silva. In the second part we discuss in detail algorithms and the implementation of these applications, and demonstrate their use on various datasets. The applications include topological bootstrapping, parameter thresholding, and the comparison of witness complexes. In the third part we discuss some theoretical and algorithmic results on the probabilistic nature of random matroids, random subgraphs and random subcomplexes. First, we discuss some background information regarding sampling matroids, and provide some connections to existing literature on computational complexity and combinatorics. We close with a discussion regarding the randomized computation of the Tutte polynomial of certain dense graphs as well as the extension of these results to sampling the higher skeleta of simplicial complexes.
Description
| Type of resource | text |
|---|---|
| Form | electronic; electronic resource; remote |
| Extent | 1 online resource. |
| Publication date | 2012 |
| Issuance | monographic |
| Language | English |
Creators/Contributors
| Associated with | Tausz, Andrew Paul |
|---|---|
| Associated with | Stanford University, Institute for Computational and Mathematical Engineering. |
| Primary advisor | Carlsson, Gunnar |
| Thesis advisor | Carlsson, Gunnar |
| Thesis advisor | Guibas, Leonidas J |
| Thesis advisor | Müllner, Daniel |
| Advisor | Guibas, Leonidas J |
| Advisor | Müllner, Daniel |
Subjects
| Genre | Theses |
|---|
Bibliographic information
| Statement of responsibility | Andrew Tausz. |
|---|---|
| Note | Submitted to the Institute for Computational and Mathematical Engineering. |
| Thesis | Thesis (Ph.D.)--Stanford University, 2012. |
| Location | electronic resource |
Access conditions
- Copyright
- © 2012 by Andrew Paul Tausz
- License
- This work is licensed under a Creative Commons Attribution Non Commercial 3.0 Unported license (CC BY-NC).
Also listed in
Loading usage metrics...