Research

Paper

AI LLM March 12, 2026

The Density of Cross-Persistence Diagrams and Its Applications

Authors

Alexander Mironenko, Evgeny. Burnaev, Serguei Barannikov

Abstract

Topological Data Analysis (TDA) provides powerful tools to explore the shape and structure of data through topological features such as clusters, loops, and voids. Persistence diagrams are a cornerstone of TDA, capturing the evolution of these features across scales. While effective for analyzing individual manifolds, persistence diagrams do not account for interactions between pairs of them. Cross-persistence diagrams (cross-barcodes), introduced recently, address this limitation by characterizing relationships between topological features of two point clouds. In this work, we present the first systematic study of the density of cross-persistence diagrams. We prove its existence, establish theoretical foundations for its statistical use, and design the first machine learning framework for predicting cross-persistence density directly from point cloud coordinates and distance matrices. Our statistical approach enables the distinction of point clouds sampled from different manifolds by leveraging the linear characteristics of cross-persistence diagrams. Interestingly, we find that introducing noise can enhance our ability to distinguish point clouds, uncovering its novel utility in TDA applications. We demonstrate the effectiveness of our methods through experiments on diverse datasets, where our approach consistently outperforms existing techniques in density prediction and achieves superior results in point cloud distinction tasks. Our findings contribute to a broader understanding of cross-persistence diagrams and open new avenues for their application in data analysis, including potential insights into time-series domain tasks and the geometry of AI-generated texts. Our code is publicly available at https://github.com/Verdangeta/TDA_experiments

Metadata

arXiv ID: 2603.11623
Provider: ARXIV
Primary Category: cs.AI
Published: 2026-03-12
Fetched: 2026-03-14 05:03

Related papers

Raw Data (Debug)
{
  "raw_xml": "<entry>\n    <id>http://arxiv.org/abs/2603.11623v1</id>\n    <title>The Density of Cross-Persistence Diagrams and Its Applications</title>\n    <updated>2026-03-12T07:33:15Z</updated>\n    <link href='https://arxiv.org/abs/2603.11623v1' rel='alternate' type='text/html'/>\n    <link href='https://arxiv.org/pdf/2603.11623v1' rel='related' title='pdf' type='application/pdf'/>\n    <summary>Topological Data Analysis (TDA) provides powerful tools to explore the shape and structure of data through topological features such as clusters, loops, and voids. Persistence diagrams are a cornerstone of TDA, capturing the evolution of these features across scales. While effective for analyzing individual manifolds, persistence diagrams do not account for interactions between pairs of them. Cross-persistence diagrams (cross-barcodes), introduced recently, address this limitation by characterizing relationships between topological features of two point clouds. In this work, we present the first systematic study of the density of cross-persistence diagrams. We prove its existence, establish theoretical foundations for its statistical use, and design the first machine learning framework for predicting cross-persistence density directly from point cloud coordinates and distance matrices. Our statistical approach enables the distinction of point clouds sampled from different manifolds by leveraging the linear characteristics of cross-persistence diagrams. Interestingly, we find that introducing noise can enhance our ability to distinguish point clouds, uncovering its novel utility in TDA applications. We demonstrate the effectiveness of our methods through experiments on diverse datasets, where our approach consistently outperforms existing techniques in density prediction and achieves superior results in point cloud distinction tasks. Our findings contribute to a broader understanding of cross-persistence diagrams and open new avenues for their application in data analysis, including potential insights into time-series domain tasks and the geometry of AI-generated texts. Our code is publicly available at https://github.com/Verdangeta/TDA_experiments</summary>\n    <category scheme='http://arxiv.org/schemas/atom' term='cs.AI'/>\n    <published>2026-03-12T07:33:15Z</published>\n    <arxiv:comment>19 pages, 20 figures</arxiv:comment>\n    <arxiv:primary_category term='cs.AI'/>\n    <arxiv:journal_ref>in IEEE Access, vol. 14, pp. 34320-34338, 2026,</arxiv:journal_ref>\n    <author>\n      <name>Alexander Mironenko</name>\n    </author>\n    <author>\n      <name>Evgeny. Burnaev</name>\n    </author>\n    <author>\n      <name>Serguei Barannikov</name>\n    </author>\n    <arxiv:doi>10.1109/ACCESS.2026.3669415</arxiv:doi>\n    <link href='https://doi.org/10.1109/ACCESS.2026.3669415' rel='related' title='doi'/>\n  </entry>"
}