Metraipolis › archive › dc_fe5cda2105ff
A bridge representation of Gaussian Whittle-Matérn fields on compact metric graphs — arXiv:2609.18375
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.18375
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T15:40:05.158Z
- SHA-256 of the archived text
92f58ce7244961c7e355460075c08fae77dd0c610705bd37be9986f153da56d1- Stable URL of this page
https://metraipolis.com/documento/dc_fe5cda2105ff
How to cite
A bridge representation of Gaussian Whittle-Matérn fields on compact metric graphs — arXiv:2609.18375 — arXiv (en), https://arxiv.org/abs/2609.18375 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fe5cda2105ff (Metraipolis archive dc_fe5cda2105ff, sha256 92f58ce7244961c7e355460075c08fae77dd0c610705bd37be9986f153da56d1)
BibTeX
@misc{dcfe5cda2105ff,
title = {A bridge representation of Gaussian Whittle-Matérn fields on compact metric graphs — arXiv:2609.18375},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.18375},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fe5cda2105ff; sha256 92f58ce7244961c7e355460075c08fae77dd0c610705bd37be9986f153da56d1},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.18375. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Gaussian Whittle-Matérn fields form a flexible class of Gaussian processes on compact metric graphs, where spatial dependence is governed by the geometry and connectivity of the network through a fractional-order stochastic partial differential equation. This paper develops a new bridge representation of these fields in the case of half-integer smoothness parameters, when the fields have Markov properties. This representation decomposes the field into a finite-dimensional graph component and independent Whittle-Matérn bridge processes on the individual edges. The resulting decomposition leads to efficient likelihood evaluation, kriging prediction, and simulation methods. We show that this improves numerical stability and can greatly reduce computation time compared to previous methods. A simulation study on a Chicago street-network graph illustrates the computational efficiency of the sampling method and an application to Madrid traffic intensity data demonstrates the practical gains for likelihood-based inference and prediction. The methods are implemented in the R package MetricGraph. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-17 in stat.CO). Categorie arXiv: Computation (stat.CO). Pagina del lavoro: https://arxiv.org/abs/2609.18375 — 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-15T15:08:06.744Z dalla pagina https://arxiv.org/catchup/stat.CO/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).