Metric spaces of walks and Lipschitz duality on graphs

• URL: http://arxiv.org/abs/2508.19709v1
• Date: Wed, 27 Aug 2025 09:17:05 GMT
• Title: Metric spaces of walks and Lipschitz duality on graphs
• Authors: R. Arnau, A. González Cortés, E. A. Sánchez Pérez, S. Sanjuan,
• Abstract summary: We study the metric structure of walks on graphs, understood as Lipschitz sequences.<n>We analyze the main properties of these metric spaces, which provides the foundation for the analysis of weaker forms of instruments to measure relative distances between walks: proximities.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study the metric structure of walks on graphs, understood as Lipschitz sequences. To this end, a weighted metric is introduced to handle sequences, enabling the definition of distances between walks based on stepwise vertex distances and weighted norms. We analyze the main properties of these metric spaces, which provides the foundation for the analysis of weaker forms of instruments to measure relative distances between walks: proximities. We provide some representation formulas for such proximities under different assumptions and provide explicit constructions for these cases. The resulting metric framework allows the use of classical tools from metric modeling, such as the extension of Lipschitz functions from subspaces of walks, which permits extending proximity functions while preserving fundamental properties via the mentioned representations. Potential applications include the estimation of proximities and the development of reinforcement learning strategies based on exploratory walks, offering a robust approach to Lipschitz regression on network structures.

Related papers

• On Multi-Step Theorem Prediction via Non-Parametric Structural Priors [50.16583672681106]
  In this work, we explore training-free theorem prediction through the lens of in-context learning (ICL)<n>We propose Theorem Precedence Graphs, which encode temporal dependencies from historical solution traces as directed graphs, and impose explicit topological constraints that effectively prune the search space during inference.<n>Experiments on the FormalGeo7k benchmark show that our method achieves 89.29% accuracy, substantially outperforming ICL baselines and matching state-of-the-art supervised models.
  arXiv  Detail & Related papers  (2026-03-05T06:08:50Z)
• Metrics for Parametric Families of Networks [5.29459046551606]
  Building on a Gromov-Wasserstein variant of optimal transport, we define a family of parameterized Gromov-Wasserstein distances.<n>We establish foundational properties of these distances, showing that they subsume several existing metrics in the literature.<n>We prove our distances can be consistently approximated in random graph and random metric space settings via empirical estimates from generative models.
  arXiv  Detail & Related papers  (2025-09-26T16:31:28Z)
• Symbolic Approximations to Ricci-flat Metrics Via Extrinsic Symmetries of Calabi-Yau Hypersurfaces [0.0]
  We analyse machine learning approximations to flat metrics of Fermat Calabi-Yau n-folds.<n>We show that the flat metric admits a surprisingly compact representation for certain choices of complex structure moduli.<n>We conclude by distilling the ML models to obtain for the first time closed form expressions for Kahler metrics with near-zero scalar curvature.
  arXiv  Detail & Related papers  (2024-12-27T18:19:26Z)
• The Fisher-Rao geometry of CES distributions [50.50897590847961]
  The Fisher-Rao information geometry allows for leveraging tools from differential geometry. We will present some practical uses of these geometric tools in the framework of elliptical distributions.
  arXiv  Detail & Related papers  (2023-10-02T09:23:32Z)
• Enriching Disentanglement: From Logical Definitions to Quantitative Metrics [59.12308034729482]
  Disentangling the explanatory factors in complex data is a promising approach for data-efficient representation learning. We establish relationships between logical definitions and quantitative metrics to derive theoretically grounded disentanglement metrics. We empirically demonstrate the effectiveness of the proposed metrics by isolating different aspects of disentangled representations.
  arXiv  Detail & Related papers  (2023-05-19T08:22:23Z)
• Identifying latent distances with Finslerian geometry [6.0188611984807245]
  Generative models cause the data space and the geodesics to be at best impractical, and at worst impossible to manipulate. In this work, we propose another metric whose geodesics explicitly minimise the expected length of the pullback metric. In high dimensions, we prove that both metrics converge to each other at a rate of $Oleft(frac1Dright)$.
  arXiv  Detail & Related papers  (2022-12-20T05:57:27Z)
• Data-Driven Influence Functions for Optimization-Based Causal Inference [105.5385525290466]
  We study a constructive algorithm that approximates Gateaux derivatives for statistical functionals by finite differencing. We study the case where probability distributions are not known a priori but need to be estimated from data.
  arXiv  Detail & Related papers  (2022-08-29T16:16:22Z)
• Exploring Predictive States via Cantor Embeddings and Wasserstein Distance [0.0]
  We show how Wasserstein distances may be used to detect predictive equivalences in symbolic data. We show that exploratory data analysis using the resulting geometry provides insight into the temporal structure of processes.
  arXiv  Detail & Related papers  (2022-06-09T00:09:47Z)
• Adversarially Robust Topological Inference [20.02318707644732]
  In particular, the sublevel sets of the distance function are used in the computation of persistent homology.<n>Despite its stability to perturbations in the Hausdorff distance, persistent homology is highly sensitive to outliers.<n>We propose a textitmedian-of-means variant of the distance function (textsfMoM Dist) and establish its statistical properties.
  arXiv  Detail & Related papers  (2022-06-03T19:45:43Z)
• Reinforcement Learning from Partial Observation: Linear Function Approximation with Provable Sample Efficiency [111.83670279016599]
  We study reinforcement learning for partially observed decision processes (POMDPs) with infinite observation and state spaces. We make the first attempt at partial observability and function approximation for a class of POMDPs with a linear structure.
  arXiv  Detail & Related papers  (2022-04-20T21:15:38Z)
• A Unifying and Canonical Description of Measure-Preserving Diffusions [60.59592461429012]
  A complete recipe of measure-preserving diffusions in Euclidean space was recently derived unifying several MCMC algorithms into a single framework. We develop a geometric theory that improves and generalises this construction to any manifold.
  arXiv  Detail & Related papers  (2021-05-06T17:36:55Z)
• GELATO: Geometrically Enriched Latent Model for Offline Reinforcement Learning [54.291331971813364]
  offline reinforcement learning approaches can be divided into proximal and uncertainty-aware methods. In this work, we demonstrate the benefit of combining the two in a latent variational model. Our proposed metrics measure both the quality of out of distribution samples as well as the discrepancy of examples in the data.
  arXiv  Detail & Related papers  (2021-02-22T19:42:40Z)

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.