English
Related papers

Related papers: Dimensionality Reduction for $k$-Distance Applied …

200 papers

Persistence diagrams (PDs) are used as signatures of point cloud data. Two clouds of points can be compared using the bottleneck distance d_B between their PDs. A potential drawback of this pipeline is that point clouds sampled from…

Computational Geometry · Computer Science 2024-08-30 Nathan H. May , Bala Krishnamoorthy , Patrick Gambill

Detecting the dimension of a hidden manifold from a point sample has become an important problem in the current data-driven era. Indeed, estimating the shape dimension is often the first step in studying the processes or phenomena…

Computational Geometry · Computer Science 2014-05-15 Tamal K. Dey , Fengtao Fan , Yusu Wang

Recently it has been shown that computing the dimension of the first homology group $H_1(K)$ of a simplicial $2$-complex $K$ embedded linearly in $\mathbb{R}^4$ is as hard as computing the rank of a sparse $0-1$ matrix. This puts a major…

Computational Geometry · Computer Science 2019-03-18 Tamal K. Dey

The Johnson-Lindenstrauss transform is a fundamental method for dimension reduction in Euclidean spaces, that can map any dataset of $n$ points into dimension $O(\log n)$ with low distortion of their distances. This dimension bound is tight…

Data Structures and Algorithms · Computer Science 2026-02-20 Shaofeng H. -C. Jiang , Robert Krauthgamer , Shay Sapir , Sandeep Silwal , Di Yue

In Persistent Homology and Topology, filtrations are usually given by introducing an ordered collection of sets or a continuous function from a topological space to $\R^n$. A natural question arises, whether these approaches are equivalent…

General Topology · Mathematics 2013-04-05 Barbara Di Fabio , Patrizio Frosini

The Persistent Homology Transform (PHT) summarizes a shape in $\mathbb{R}^m$ by collecting persistence diagrams obtained from linear height filtrations in all directions on $\mathbb{S}^{m-1}$. It enjoys strong theoretical guarantees,…

Computational Geometry · Computer Science 2026-04-10 Michael Kerber , Elena Xinyi Wang

In this paper, we study the fundamental problems of maintaining the diameter and a $k$-center clustering of a dynamic point set $P \subset \mathbb{R}^d$, where points may be inserted or deleted over time and the ambient dimension $d$ is not…

Data Structures and Algorithms · Computer Science 2025-11-04 Kiarash Banihashem , Jeff Giliberti , Samira Goudarzi , MohammadTaghi Hajiaghayi , Peyman Jabbarzade , Morteza Monemizadeh

We develop persistent homology in the setting of filtrations of (Cech) closure spaces. Examples of filtrations of closure spaces include metric spaces, weighted graphs, weighted directed graphs, and filtrations of topological spaces. We use…

Algebraic Topology · Mathematics 2025-02-19 Peter Bubenik , Nikola Milićević

Comparison between multidimensional persistent Betti numbers is often based on the multidimensional matching distance. While this metric is rather simple to define and compute by considering a suitable family of filtering functions…

Computational Geometry · Computer Science 2016-03-15 Andrea Cerri , Marc Ethier , Patrizio Frosini

The theory of multidimensional persistent homology was initially developed in the discrete setting, and involved the study of simplicial complexes filtered through an ordering of the simplices. Later, stability properties of…

Computational Geometry · Computer Science 2013-03-28 Niccolò Cavazza , Marc Ethier , Patrizio Frosini , Tomasz Kaczynski , Claudia Landi

Persistent homology is a popular and useful tool for analysing finite metric spaces, revealing features that can be used to distinguish sets of unlabeled points and as input into machine learning pipelines. The famous stability theorem of…

Computational Geometry · Computer Science 2024-05-10 Philip Smith , Vitaliy Kurlin

In this paper we study the properties of the homology of different geometric filtered complexes (such as Vietoris-Rips, Cech and witness complexes) built on top of precompact spaces. Using recent developments in the theory of topological…

Algebraic Topology · Mathematics 2013-11-18 Frederic Chazal , Vin de Silva , Steve Oudot

Dimensionality reduction is an integral part of data visualization. It is a process that obtains a structure preserving low-dimensional representation of the high-dimensional data. Two common criteria can be used to achieve a dimensionality…

Computational Geometry · Computer Science 2018-06-25 Lin Yan , Yaodong Zhao , Paul Rosen , Carlos Scheidegger , Bei Wang

Computing Persistent Homology for large point clouds remains a bottleneck for the wider adoption of persistent homology by the scientific community. We present an algorithm which can compute the degree-1 Vietoris-Rips Persistent Homology of…

Algebraic Topology · Mathematics 2024-09-13 Musashi Ayrton Koyama , Facundo Memoli , Vanessa Robins , Katharine Turner

In this paper we study a new metric for comparing Betti numbers functions in bidimensional persistent homology, based on coherent matchings, i.e. families of matchings that vary in a continuous way. We prove some new results about this…

Algebraic Topology · Mathematics 2018-05-29 Andrea Cerri , Marc Ethier , Patrizio Frosini

For a finite set of balls of radius $r$, the $k$-fold cover is the space covered by at least $k$ balls. Fixing the ball centers and varying the radius, we obtain a nested sequence of spaces that is called the $k$-fold filtration of the…

Computational Geometry · Computer Science 2023-05-18 Mickaël Buchet , Bianca B. Dornelas , Michael Kerber

The \v{C}ech and Rips constructions of persistent homology are stable with respect to perturbations of the input data. However, neither is robust to outliers, and both can be insensitive to topological structure of high-density regions of…

Algebraic Topology · Mathematics 2022-04-29 Andrew J. Blumberg , Michael Lesnick

\v{C}ech complexes reveal valuable topological information about point sets at a certain scale in arbitrary dimensions, but the sheer size of these complexes limits their practical impact. While recent work introduced approximation…

Computational Geometry · Computer Science 2013-07-15 Michael Kerber , R. Sharathkumar

We present a collection of algorithms which utilize dimensional reduction to perform mesh refinement and study possibly singular solutions of time-dependent partial differential equations. The algorithms are inspired by constructions used…

Numerical Analysis · Mathematics 2007-06-21 Panagiotis Stinis

Given a compact geodesic space $X$ we apply the fundamental group and alternatively the first homology group functor to the corresponding Rips or \v{C}ech filtration of $X$ to obtain what we call a persistence. This paper contains the…

Geometric Topology · Mathematics 2024-09-18 Žiga Virk