The Density of Cross-Persistence Diagrams and Its Applications

Alexander Mironenko, Evgeny. Burnaev, Serguei BarannikovarXiv 2026 · DOI · arXiv

TL;DR

This paper establishes the first rigorous theoretical foundation for the probability density of cross-persistence diagrams—a tool in Topological Data Analysis (TDA) used to compare two different data distributions. To overcome the massive computational bottleneck of calculating these diagrams, the authors introduce Cross-RipsNet, a deep learning architecture that predicts cross-persistence densities directly from raw point clouds, achieving up to a 6.5x speedup and enabling state-of-the-art performance in manifold discrimination, time-series classification, and AI-generated text detection.

What Problem Does This Paper Address?

Topological Data Analysis (TDA) helps researchers understand the "shape" of data by tracking features like clusters, loops, and voids across multiple scales using persistence diagrams. While standard TDA is great at analyzing a single dataset (or manifold), it struggles to directly capture the interactions and structural discrepancies between pairs of different datasets.

Recently, "cross-persistence diagrams" (or cross-barcodes) were introduced to solve this by analyzing the joint topological structure of two point clouds. However, two major hurdles remained:

  1. Lack of Statistical Frameworks: There was no mathematically proven notion of a probability density function over cross-persistence diagrams, limiting their use in rigorous statistical inference (like density estimation or hypothesis testing).
  2. Computational Complexity: Calculating these joint topological features is incredibly expensive, scaling quadratically with the number of data points, making real-time or large-scale applications impractical.

Methods

The authors tackle these challenges with a blend of mathematical proofs and deep learning:

  • Theoretical Proof of Density: The authors prove that cross-persistence diagrams admit a true probability density function with respect to the Lebesgue measure. This justifies using linear representations like Manifold Topology Divergence (MTD) in standard statistical pipelines.
  • Cross-RipsNet: To bypass explicit diagram computation at inference time, the authors design a point-order-invariant neural network. Unlike previous models that only look at single point clouds, Cross-RipsNet uses separate encoders to process two distinct point clouds alongside a shared head to capture their joint topology.
  • Distance Matrix Summarization: To feed geometric relationship data into the network without overwhelming memory, they introduce an asymmetric distance matrix layer optimized via Quantile-based distance summarization. This selects $K$ quantiles from each point's neighborhood distance distribution, capturing local-to-global structure efficiently.
FIGURE 1. Standard pipeline for Cross-barcode vectorization
  • Controlled Noise Injection: The authors introduce a method of injecting Gaussian noise into the data. Counterintuitively, this amplifies existing geometric discrepancies between different classes rather than obscuring them, making distinct manifolds much easier to tell apart.

Datasets

The framework was evaluated across a diverse set of modalities:

  • Image/Manifold Distinction: MNIST, CIFAR-10, COIL-20, and CIFAR-100.
  • Synthetic Topology: Randomly generated unions of 2D circles (1, 2, or 3 circles).
  • 3D Shapes: Point clouds sampled from 3D objects in the ModelNet10 dataset.
  • Textual Data: GPT- and human-generated answers to Wikipedia and Reddit prompts, embedded into high-dimensional space using a pretrained RoBERTa model.
  • Time-Series: A gravitational wave detection dataset and six benchmarks from the UCR Time Series Classification Archive (including Worms and Earthquakes).

Key Insights and Ideas

  • Noise as an Amplifier: One of the most surprising findings is that adding noise can actually improve topological discrimination. While noise preserves the tight concentration of intra-class comparisons (comparing a manifold to itself), it widens the perceived geometric gap when comparing two different manifolds.
  • Bypassing the TDA Bottleneck: Cross-RipsNet proves that a neural network can implicitly learn to extract complex, joint topological features directly from raw coordinates and summarized distance metrics, completely skipping the expensive step of building simplicial complexes during inference.
  • Asymmetric Sensitivity: Cross-persistence is inherently asymmetric ($MTD(P,Q) \neq MTD(Q,P)$). The authors leverage this asymmetry to better detect directional differences, such as determining whether an unknown text sample aligns closer to human or AI-generated distributions.

Key Results

  • Density Prediction Accuracy: Cross-RipsNet using quantile summarization consistently outperformed baselines (like a modified standard RipsNet) in predicting cross-persistence density, achieving the lowest symmetrical KL divergence across synthetic, 3D shape, and text domains.
  • Significant Speedups: Compared to classical algorithmic computation, Cross-RipsNet achieved a 6.5x speedup on 3D shape data and a 4.0x speedup on text data.
  • Downstream Performance:
  • In gravitational wave detection, using cross-persistence features outperformed the baseline Giotto-ai TDA approach by 9% in classification accuracy.
  • In AI vs. Human text classification, the proposed MTD-based features achieved the highest discriminative performance on both Wiki and Reddit datasets, outperforming single-cloud persistence entropy baselines.

Limitations and Future Work

Despite the training speedups, Cross-RipsNet still requires the explicit construction of an asymmetric distance matrix as an intermediate step during its preprocessing and training phases. Because this matrix scales quadratically ($O(NM)$), the practical applicability of the model is currently limited to point clouds of up to approximately $10^4$ points per cloud on standard hardware.

For future work, the authors suggest exploring more advanced classifiers, developing smarter example-selection strategies for time-series data, and incorporating a wider array of zero-dimensional and higher-dimensional topological characteristics directly into the deep learning framework.

Summary updated

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
BibTeX
@misc{mironenko2026density,
  author = {Alexander Mironenko and Evgeny. Burnaev and Serguei Barannikov},
  title = {{The Density of Cross-Persistence Diagrams and Its Applications}},
  year = {2026},
  eprint = {2603.11623},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2603.11623},
}
Figure