{
  "abstract": "An undirected connected graph can be interpreted as a metric space by considering the path distance between its vertices. Extending this perspective, we explore how walks in the graph, viewed as sequences of subsets of vertices $V$, fit into a more general framework where the path distance emerges as a special case of broader metrics that define hypertopologies on the space of subsets of $V$. In this paper, we propose a general framework to address this issue, motivated by the extension of recent reinforcement learning algorithms on graphs through Lipschitz function extensions. Our approach demonstrates how models for dynamical systems and related machine learning techniques can be adapted to (quasi-pseudo-metric) hyperspaces, offering a novel perspective for the analysis and modeling of dynamical systems. Finally, we illustrate the practical relevance of our theoretical contributions through a concrete graph optimization example, highlighting the utility and effectiveness of our proposed approach.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2611.07860",
  "author_total": 3,
  "authors": [
    {
      "name": "Natalia Jonard-Pérez"
    },
    {
      "name": "Enrique A. Sánchez-Pérez"
    },
    {
      "name": "Sergi Sanjuan"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/9szz3axqv3vz4.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2611.07860",
  "fulltext_url": null,
  "id": "9szz3axqv3vz4",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2611.07860",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "math.GN"
    ]
  ],
  "openalex": null,
  "pdf_url": "https://arxiv.org/pdf/2611.07860",
  "pmcid": null,
  "pmid": null,
  "published": "2026-11-05",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/9szz3axqv3vz4.ris",
  "sources": [
    {
      "first_seen": "2026-11-06T18:21:34Z",
      "native_id": "2611.07860",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2611.07860"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.GN",
      "subfield": "geometry-topology"
    }
  ],
  "title": "Extending graph metrics to hyperspaces of vertex sets: optimization and reinforcement learning applications",
  "title_text": "Extending graph metrics to hyperspaces of vertex sets: optimization and reinforcement learning applications",
  "type": "preprint",
  "updated_at": "2026-11-09T00:20:48Z",
  "url": "https://research.draconitic.com/paper/9szz3axqv3vz4",
  "venue": "arXiv",
  "versions": []
}