Polynomial-Sized Topological Approximations Using the Permutahedron
dc.contributor.author | Choudhary, Aruni | en |
dc.contributor.author | Kerber, Michael | en |
dc.contributor.author | Raghvendra, Sharath | en |
dc.contributor.department | Computer Science | en |
dc.date.accessioned | 2019-08-30T17:00:07Z | en |
dc.date.available | 2019-08-30T17:00:07Z | en |
dc.date.issued | 2019-01 | en |
dc.description.abstract | Classical methods to model topological properties of point clouds, such as the Vietoris-Rips complex, suffer from the combinatorial explosion of complex sizes. We propose a novel technique to approximate a multi-scale filtration of the Rips complex with improved bounds for size: precisely, for n points in Rd, we obtain a O(d)-approximation whose k-skeleton has size n2O(dlogk) per scale and n2O(dlogd) in total over all scales. In conjunction with dimension reduction techniques, our approach yields a O(polylog(n))-approximation of size nO(1) for Rips filtrations on arbitrary metric spaces. This result stems from high-dimensional lattice geometry and exploits properties of the permutahedral lattice, a well-studied structure in discrete geometry. Building on the same geometric concept, we also present a lower bound result on the size of an approximation: we construct a point set for which every (1+epsilon)-approximation of the ech filtration has to contain n(loglogn) features, provided that epsilon < 1log1+cn for c(0,1). | en |
dc.description.notes | Open access funding provided by the Max Planck Society. Sharath Raghvendra acknowledges support of NSF CRII Grant CCF-1464276. Michael Kerber is supported by the Austrian Science Fund (FWF) grant number P 29984-N35. | en |
dc.description.sponsorship | Max Planck Society; NSF CRII [CCF-1464276]; Austrian Science Fund (FWF) [P 29984-N35] | en |
dc.format.mimetype | application/pdf | en |
dc.identifier.doi | https://doi.org/10.1007/s00454-017-9951-2 | en |
dc.identifier.eissn | 1432-0444 | en |
dc.identifier.issn | 0179-5376 | en |
dc.identifier.issue | 1 | en |
dc.identifier.uri | http://hdl.handle.net/10919/93322 | en |
dc.identifier.volume | 61 | en |
dc.language.iso | en | en |
dc.rights | Creative Commons Attribution 4.0 International | en |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | en |
dc.subject | Persistent homology | en |
dc.subject | Topological data analysis | en |
dc.subject | Simplicial approximation | en |
dc.subject | Permutahedron | en |
dc.subject | Approximation algorithms | en |
dc.subject | 55U10 | en |
dc.subject | 11H06 | en |
dc.subject | 68W25 | en |
dc.title | Polynomial-Sized Topological Approximations Using the Permutahedron | en |
dc.title.serial | Discrete & Computational Geometry | en |
dc.type | Article - Refereed | en |
dc.type.dcmitype | Text | en |
dc.type.dcmitype | StillImage | en |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Choudhary2019_Article_Polynomial-SizedTopologicalApp.pdf
- Size:
- 1.06 MB
- Format:
- Adobe Portable Document Format
- Description: