Metraipolis › archive › dc_6a69d8bd50eb
A Parameterized Stochastic Hamiltonian Process on Graphs with Two-Point Boundary Conditions — arXiv:2610.40497
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.40497
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:36:13.552Z
- SHA-256 of the archived text
25d8e1347f7ce95f0989fbc36fa5d55e300f76825d5e0ed68e23d870b552a04e- Stable URL of this page
https://metraipolis.com/documento/dc_6a69d8bd50eb
How to cite
A Parameterized Stochastic Hamiltonian Process on Graphs with Two-Point Boundary Conditions — arXiv:2610.40497 — arXiv (en), https://arxiv.org/abs/2610.40497 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6a69d8bd50eb (Metraipolis archive dc_6a69d8bd50eb, sha256 25d8e1347f7ce95f0989fbc36fa5d55e300f76825d5e0ed68e23d870b552a04e)
BibTeX
@misc{dc6a69d8bd50eb,
title = {A Parameterized Stochastic Hamiltonian Process on Graphs with Two-Point Boundary Conditions — arXiv:2610.40497},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.40497},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6a69d8bd50eb; sha256 25d8e1347f7ce95f0989fbc36fa5d55e300f76825d5e0ed68e23d870b552a04e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40497. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper presents a Lagrangian framework to solve Wasserstein Hamiltonian flows (WHF) under two-point boundary conditions on large finite graphs. Characterized by a coupled system of discrete master equation and Hamilton-Jacobi (HJ) equation on the probability simplex, this formulation defines the macroscopic WHF. While classical density-based solvers can track this flow, they face severe memory and computational bottlenecks as the graph scale grows. To bypass these limitations, we introduce the stochastic Hamiltonian process (SHP), a sample-based mathematical framework that tracks individual particle dynamics rather than the full node-wise density. We parameterize the time-dependent potential using neural network, yielding the Neural SHP solver. Numerical experiments on synthetic graphs demonstrate the scalability of our method relative to density-based baselines. Furthermore, we validate Neural SHP across two large-scale real-world networks, a PubMed citation network and a massive road network, demonstrating its robust efficiency for graph partition and routing problems on complex graph structures. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.NA, nuovi lavori del giorno). Categorie arXiv: Numerical Analysis (math.NA). Pagina del lavoro: https://arxiv.org/abs/2610.40497 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-01T02:15:13.366Z dalla pagina https://arxiv.org/list/math.NA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).