The SPDE Approach to Mat'ern Fields: Graph Representations
Not on the map. Why?
Abstract (arXiv)
This paper investigates Gaussian Markov random field approximations to nonstationary Gaussian fields using graph representations of stochastic partial differential equations. We establish approximation error guarantees building on the theory of spectral convergence of graph Laplacians. The proposed graph representations provide a generalization of the Mat'ern model to unstructured point clouds, and facilitate inference and sampling using linear algebra methods for sparse matrices. In addition, they bridge and unify several models in Bayesian inverse problems, spatial statistics and graph-based machine learning. We demonstrate through examples in these three disciplines that the unity revealed by graph representations facilitates the exchange of ideas across them.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 16 Apr 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 3; 2023: 1; 2024: 0; 2025: 1.
6 papers.
- 2023Sparse Cholesky Factorization for Solving Nonlinear PDEs via Gaussian Processescited by 31
- 2021Non-separable Spatio-temporal Graph Kernels via SPDEscited by 11
- 2022Optimization on Manifolds via Graph Gaussian Processescited by 6
- 2022Rates of Convergence for Regression with the Graph Poly-Laplaciancited by 4
- 2022Mathematical Foundations of Graph-Based Bayesian Semi-Supervised Learningcited by 1
- 2025Bayesian Optimization on Networkscited by 0
- 2025Bayesian Optimization on Networks31 Oct 2025
- 2023Sparse Cholesky Factorization for Solving Nonlinear PDEs via Gaussian Processes3 Apr 2023
- 2022Optimization on Manifolds via Graph Gaussian Processes20 Oct 2022
- 2022Rates of Convergence for Regression with the Graph Poly-Laplacian6 Sep 2022
- 2022Mathematical Foundations of Graph-Based Bayesian Semi-Supervised Learning3 Jul 2022
- 2021Non-separable Spatio-temporal Graph Kernels via SPDEs16 Nov 2021