Gauge Geometry of Hodge Zero-Mode Transport in Parameter-Dependent Topological Data Analysis

• URL: http://arxiv.org/abs/2605.28326v1
• Date: Wed, 27 May 2026 11:27:10 GMT
• Title: Gauge Geometry of Hodge Zero-Mode Transport in Parameter-Dependent Topological Data Analysis
• Abstract summary: Curvature and holonomy are descriptors of reorganization and accumulated memory in evolving topological structures.<n>Curvature highlights parameter regions where homological features mix or change rapidly, while holonomy summarizes net effect of such changes after a closed cycle.<n>We show that the proposed method detects tracking instability, distinguishes systems with nearly identical persistence diagrams, and captures cycle-level memory invisible to pointwise feature matching.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a practical computational framework for detecting structural changes in parameter-dependent topological data. In many applications, such as time-series data analysis, anomaly detection, and monitoring of systems under changing control parameters, persistence diagrams describe the birth and death of topological features at each parameter value, but they do not fully capture how these features are reorganized over time. To address this limitation, we represent homological features by zero modes of the ordinary combinatorial Hodge Laplacian and track the corresponding feature spaces in a common ambient chain space. This allows us to compute curvature and holonomy as descriptors of local reorganization and accumulated memory in evolving topological structures. Curvature highlights parameter regions where homological features mix or change rapidly, while holonomy summarizes the net effect of such changes after a closed cycle. We also establish stability estimates showing that these descriptors are robust under perturbations of the Hodge Laplacian on regular regions. Numerical experiments on controlled time-dependent point-cloud data show that the proposed method detects tracking instability, distinguishes systems with nearly identical persistence diagrams, and captures cycle-level memory invisible to pointwise feature matching. These results suggest that zero-mode transport geometry can serve as a useful computational tool for analyzing dynamic topological data.

Related papers

• The Geometry of Memorization: Finite-Time Spectral Sensitivity as a Diagnostic for Flow Matching Models [0.0]
  Continuous-time generative frameworks construct probability paths between base and target domains by optimizing time-dependent velocity fields.<n>This paper presents the Finite-Time Spectral Sensitivity (FTSS) g(t), a gradient-free, forward-pass metric that exposes flow geometry by tracking the root-mean-square singular value of the state-transition matrix.
  arXiv  Detail & Related papers  (2026-07-14T10:55:02Z)
• Towards Fast GNN Surrogates for CO2 Migration in Complex Geological Formations [58.079925240809644]
  We propose an end-to-end graph neural surrogate tailored to CO$$ibility plume migration forecasting in geological storage.<n>The method is evaluated on the SPE11A benchmark, a well-known industry test case designed to assess CO$$ storage scenarios.<n>The proposed model produces competitive forecasts of gas saturation and liquid-phase density, with cumulative errors that remain moderate over extended forecasting horizons.
  arXiv  Detail & Related papers  (2026-06-15T18:19:17Z)
• K-Models: a Flexible and Interpretable Method for Ordinal Clustering with Application to Antigen-Antibody Interaction Profiles [65.21921642886367]
  K-Models is a novel framework that integrates ordinal constraints and estimates key underlying elements of the random process generating the observed functional profiles.<n>The proposed method is evaluated through simulations and real-world applications.
  arXiv  Detail & Related papers  (2026-05-14T13:35:44Z)
• A Mean Curvature Approach to Boundary Detection: Geometric Insights for Unsupervised Learning [52.452902154360565]
  We introduce Mean Curvature Boundary Points (MCBP), a novel geometric framework grounded in Geometric Machine Learning.<n>MCBP explicitly models the intrinsic curvature of the data manifold and computes pointwise mean curvature without requiring principled manifold parametrization.<n>Experiments on synthetic and real-world datasets demonstrate that MCBP consistently improves clustering performance.
  arXiv  Detail & Related papers  (2026-05-05T20:19:09Z)
• Observable Geometry of Singular Statistical Models [0.12183405753834557]
  We introduce an invariant framework based on emphobservable charts: collections of functionals of the data distribution that distinguish probability measures.<n>These charts define local coordinate systems directly on the model space, independent of parameterization.<n>Our main result establishes that, under mild regularity conditions, observable order provides a lower bound on the rate at which Kullback-Leibler divergence vanishes.
  arXiv  Detail & Related papers  (2026-04-01T15:21:52Z)
• Topological Detection of Hopf Bifurcations via Persistent Homology: A Functional Criterion from Time Series [0.0]
  We propose a framework for the detection of Hopf bifurcations directly from time series, based on persistent homology applied to phase space reconstructions via Takens embedding within the framework of Topological Data Analysis.<n>The results support the interpretation of dynamical transitions as topological phase transitions and demonstrate the potential of topological data analysis as a model-free tool for the quantitative analysis of nonlinear time series.
  arXiv  Detail & Related papers  (2026-03-28T20:25:38Z)
• Koopman Operator Identification of Model Parameter Trajectories for Temporal Domain Generalization (KOMET) [0.16311150636417257]
  We present KOMET, a model-agnostic, data-driven framework that treats the sequence of trained parameter vectors as the trajectory of a nonlinear dynamical system.<n>A warm-start sequential training protocol enforces parameter-trajectory smoothness, and a Fourier-augmented observable dictionary exploits the periodic structure inherent in many real-world distribution drifts.<n>KoMET achieves mean autonomous-rollout accuracies between 0.981 and 1.000 over 100 held-out time steps.
  arXiv  Detail & Related papers  (2026-03-27T18:58:45Z)
• Flexible Gravitational-Wave Parameter Estimation with Transformers [73.44614054040267]
  We introduce a flexible transformer-based architecture paired with a training strategy that enables adaptation to diverse analysis settings at inference time.<n>We demonstrate that a single flexible model -- called Dingo-T1 -- can analyze 48 gravitational-wave events from the third LIGO-Virgo-KAGRA Observing Run.
  arXiv  Detail & Related papers  (2025-12-02T17:49:08Z)
• Registration is a Powerful Rotation-Invariance Learner for 3D Anomaly Detection [64.0168648353038]
  3D anomaly detection in point-cloud data is critical for industrial quality control, aiming to identify structural defects with high reliability.<n>Current memory bank-based methods often suffer from inconsistent feature transformations and limited discriminative capacity.<n>We propose a registration-induced, rotation-invariant feature extraction framework that integrates the objectives of point-cloud registration and memory-based anomaly detection.
  arXiv  Detail & Related papers  (2025-10-19T14:56:38Z)
• Quasi Zigzag Persistence: A Topological Framework for Analyzing Time-Varying Data [0.25322020135765466]
  Quasi Zigzag Persistent Homology (QZPH) is a framework for analyzing time-varying data.<n>We introduce a stable topological invariant that captures both static and dynamic features at different scales.
  arXiv  Detail & Related papers  (2025-02-22T02:53:26Z)
• Detecting Anomalies in Dynamic Graphs via Memory enhanced Normality [39.476378833827184]
  Anomaly detection in dynamic graphs presents a significant challenge due to the temporal evolution of graph structures and attributes. We introduce a novel spatial- temporal memories-enhanced graph autoencoder (STRIPE) STRIPE significantly outperforms existing methods with 5.8% improvement in AUC scores and 4.62X faster in training time.
  arXiv  Detail & Related papers  (2024-03-14T02:26:10Z)
• Improving embedding of graphs with missing data by soft manifolds [51.425411400683565]
  The reliability of graph embeddings depends on how much the geometry of the continuous space matches the graph structure. We introduce a new class of manifold, named soft manifold, that can solve this situation. Using soft manifold for graph embedding, we can provide continuous spaces to pursue any task in data analysis over complex datasets.
  arXiv  Detail & Related papers  (2023-11-29T12:48:33Z)
• Stable and consistent density-based clustering via multiparameter persistence [49.1574468325115]
  We consider the degree-Rips construction from topological data analysis.<n>We analyze its stability to perturbations of the input data using the correspondence-interleaving distance.<n>We integrate these methods into a pipeline for density-based clustering, which we call Persistable.
  arXiv  Detail & Related papers  (2020-05-18T19:45:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.