NDLI: Linear-size approximations to the vietoris-rips filtration

Please wait, while we are loading the content...

On topological changes in the delaunay triangulation of moving points

The point-set embeddability problem for plane graphs

Protein molecules in 3D: complex behavior from simple local geometry plus weak interactions

Higher-order Erdös: Szekeres theorems

How to walk your dog in the mountains with no magic leash

Approximating low-dimensional coverage problems

Mappings and meshes

Cubic plane graphs on a given point set

Linear-size approximations to the vietoris-rips filtration

Self-improving algorithms for coordinate-wise maxima

Tessellation analysis of the cosmic web

Stabbing horizontal segments with vertical rays

Periodic body-and-bar frameworks

Disjoint edges in complete topological graphs

Configuration space visualization

Geometric packing under non-uniform constraints

Algorithmic complexity of finding cross-cycles in flag complexes

Add isotropic Gaussian kernels at own risk: more and more resilient modes in higher dimensions

Tracing compressed curves in triangulated surfaces

Improved range searching lower bounds

Multinerves and helly numbers of acyclic families

Alexander duality for functions: the persistent behavior of land and water and shore

Finding the maximal empty disk containing a query point

Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model

On sub-determinants and the diameter of polyhedra

Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions

Surface patches from unorganized space curves

Computing cartograms with optimal complexity

Counting crossing-free structures

On the expected complexity of voronoi diagrams on terrains

Testing graph isotopies on surfaces

An output-sensitive algorithm for computing projections of resultant polytopes

Duals of orphan-free anisotropic voronoi diagrams are embedded meshes

Certified computation of planar morse-smale complexes

Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set

A theorem of bárány revisited and extended

Optimal area-sensitive bounds for polytope approximation

The 2-page crossing number of $K_{n}$

Lang's universal molecule algorithm

Approximate bregman near neighbors in sublinear time: beyond the triangle inequality

A fast and simple surface reconstruction algorithm

On Klee's measure problem for grounded boxes

On laplacians of random complexes

Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique

Stability of Delaunay-type structures for manifolds: [extended abstract]

A deterministic o(m log m) time algorithm for the reeb graph

Approximating Tverberg points in linear time for any fixed dimension

Improved pointer machine and I/O lower bounds for simplex range reporting and related problems

Object-image correspondence for curves under central and parallel projections

String graphs and incomparability graphs

The sticky geometry of the cosmic web

Linear-size approximations to the vietoris-rips filtration

Content Provider	ACM Digital Library
Author	Sheehy, Donald R.
Abstract	The Vietoris-Rips filtration is a versatile tool in topological data analysis. It is a sequence of simplicial complexes built on a metric space to add topological structure to an otherwise disconnected set of points. It is widely used because it encodes useful information about the topology of the underlying metric space. This information is often extracted from its so-called persistence diagram. Unfortunately, this filtration is often too large to construct in full. We show how to construct an O(n)-size filtered simplicial complex on an n-point metric space such that its persistence diagram is a good approximation to that of the Vietoris-Rips filtration. This new filtration can be constructed in O(n log n) time. The constant factors in both the size and the running time depend only on the doubling dimension of the metric space and the desired tightness of the approximation. For the first time, this makes it computationally tractable to approximate the persistence diagram of the Vietoris-Rips filtration across all scales for large data sets. We describe two different sparse filtrations. The first is a zigzag filtration that removes points as the scale increases. The second is a (non-zigzag) filtration that yields the same persistence diagram. Both methods are based on a hierarchical net-tree and yield the same guarantees.
Starting Page	239
Ending Page	248
Page Count	10
File Format	PDF
ISBN	9781450312998
DOI	10.1145/2261250.2261286
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2012-06-17
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Persistent homology Doubling dimension Vietoris-rips filtration Metric spanners
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Linear-Size Approximations to the Vietoris–Rips Filtration

Linear-Size Approximations to the Vietoris–Rips (2014)

Linear-size approximations to the vietoris-rips.

Vietoris-Rips and Cech Complexes of Metric Gluings

Linear-size approximations to the vietoris–rips (2013).

Linear-Size Approximations to the Vietoris-Rips Filtration

Vietoris-Rips Persistent Homology.

Reduced Vietoris-Rips Complexes: New methods to compute Vietoris-Rips Persistent Homology

Zigzag zoology: rips zigzags for homology inference

Linear-size approximations to the vietoris-rips filtration

Similar Documents

Linear-Size Approximations to the Vietoris–Rips Filtration

Linear-Size Approximations to the Vietoris–Rips (2014)

Linear-size approximations to the vietoris-rips.

Vietoris-Rips and Cech Complexes of Metric Gluings

Linear-size approximations to the vietoris–rips (2013).

Linear-Size Approximations to the Vietoris-Rips Filtration

Vietoris-Rips Persistent Homology.

Reduced Vietoris-Rips Complexes: New methods to compute Vietoris-Rips Persistent Homology

Zigzag zoology: rips zigzags for homology inference

Linear-size approximations to the vietoris-rips filtration