Metraipolis › archive › dc_39f9bb63cd49

HierX: Fast Multi-Scale Distance-Decay Interaction on Million-Node Networks — arXiv:2609.08676

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.08676
License (as archived)
CC0-1.0
Archived
2026-10-16T16:01:49.922Z
SHA-256 of the archived text
134e04383914a129a9ca6b82b53aba40c45477fbba67abc0bde1dbf08671d28e
Stable URL of this page
https://metraipolis.com/documento/dc_39f9bb63cd49

How to cite

HierX: Fast Multi-Scale Distance-Decay Interaction on Million-Node Networks — arXiv:2609.08676 — arXiv (en), https://arxiv.org/abs/2609.08676 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_39f9bb63cd49 (Metraipolis archive dc_39f9bb63cd49, sha256 134e04383914a129a9ca6b82b53aba40c45477fbba67abc0bde1dbf08671d28e)
BibTeX
@misc{dc39f9bb63cd49,
  title = {HierX: Fast Multi-Scale Distance-Decay Interaction on Million-Node Networks — arXiv:2609.08676},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.08676},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_39f9bb63cd49; sha256 134e04383914a129a9ca6b82b53aba40c45477fbba67abc0bde1dbf08671d28e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.08676. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Many models across the sciences require global distance-decay interactions on large sparse networks. Gravity models, accessibility measures, spatial economic models, and network influence processes all evaluate distance-weighted potential fields: each location accumulates contributions from every other location, weighted by a decaying function of the shortest-path travel cost between them. Computed directly, such aggregate fields require the dense matrix of all pairwise network costs, which scales quadratically in time and memory. Common approximations either discard long-range contributions or fail when interaction is governed by network distances rather than geometric proximity. We introduce HierX, a hierarchical sparse-plus-correction operator for distance-decay potential fields on networks. HierX constructs multi-scale representative layers with explicit correction terms ensuring each location pair contributes exactly once at the finest available resolution. Under bounded-growth assumptions common in spatially embedded networks, applying HierX scales as O(n log n). Systematic benchmarks confirm quasi-linear scaling to 100,000 nodes. In head-to-head comparison with distance cutoff truncation and Nystrom low-rank approximation on 25,000-zone networks, HierX achieves 5-9% RMSE at a fraction of the computational work; Nystrom degrades severely on steep decay kernels. Case studies compute population-weighted accessibility on the 2.58-million-node Great Britain driving network and the 1.77-million-node London pedestrian network: a one-time hierarchy construction (~1 hour) yields a compact reusable operator that then evaluates each national-scale accessibility field in under one second (~700 ms for Great Britain, ~150 ms for London). Open-source code and worked examples are provided.

Tema degli esploratori: governance digitale e beni comuni (retro-catalogo arXiv: annunci del 2026-09-09 in physics.soc-ph).
Categorie arXiv: Physics and Society (physics.soc-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.08676 — 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-10-16T15:45:24.122Z dalla pagina https://arxiv.org/catchup/physics.soc-ph/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).