Generic families of finite metric spaces with identical or trivial 1-dimensional persistence

Code that ran

We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. If it links a repository, it is listed below.

Repositories linked to this paper

phil-smith1/trivial_1d_persistence — marked official in Papers with Code; named in the paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

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 persistent homology provides an upper bound for the change of persistence in the bottleneck distance under perturbations of points, but without giving a lower bound. This paper clarifies the possible limitations persistent homology may have in distinguishing finite metric spaces, which is evident for non-isometric point sets with identical persistence. We describe generic families of point sets in metric spaces that have identical or even trivial one-dimensional persistence. The results motivate stronger invariants to distinguish finite point sets up to isometry.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2202.00577")
get_code_for_paper("2202.00577")
have("2202.00577")

Connect an agent — have() is free.