B-GRASP: A Bayesian Framework for Inferring Graph Weights from SPDE-Inspired Dynamics
Abstract
We present B-GRASP (Bayesian GRAph inference with SPDE priors), a Bayesian framework for inferring uncertain edge weights in stochastic dynamical systems on graphs from noisy observations of nodal states. The unknown edge weights parameterize the graph differential operator and therefore directly govern the evolution of the graph process. Motivated by connections between differential operators in PDEs and SPDEs and their graph counterparts, we construct stochastic graph models incorporating diffusion, reaction dynamics, and stochastic forcing. The resulting hierarchical formulation jointly represents uncertainty in the graph structure and stochastic forcing. Latent graph variables determine positive edge weights and the corresponding graph Laplacian, while latent Brownian variables represent the stochastic forcing. Conditional on these variables, the graph dynamics define a deterministic forward map from which the likelihood and posterior distribution are constructed. We characterize the posterior using maximum a posteriori estimation and the No-U-Turn Sampler, enabling both point estimation and uncertainty quantification. We demonstrate the framework on a one-dimensional inverse heat-conduction problem, stationary and nonstationary graph reaction-diffusion systems with nonlinear dynamics, and state-level COVID-19 data in the United States. The numerical results show that posterior uncertainty provides information not captured by point estimates, particularly for weakly identifiable or highly conductive edges, and enables uncertainty in both graph connectivity and stochastic forcing to be quantified within a Bayesian framework.
Related
- An information-borrowing Bayesian method for inferring high-dimensional population-level brain connectivity from small samples
- From wings to tails: a general framework for inferring dispersal potential from morphology
- Petimot: A Novel Framework for Inferring Protein Motions from Sparse Data Using SE(3)-Equivariant Graph Neural Networks
- Inferring Multi-Timescale Neural Dynamics with Switching Linear Dynamical Systems
- Unified Network Spectroscopy: Inferring Reduced Biological Dynamics from Fluctuations under Structured Noise and Broken Ergodicity
BibTeX
@misc{schenk2026bgrasp,
title = {{B-GRASP: A Bayesian Framework for Inferring Graph Weights from SPDE-Inspired Dynamics}},
author = {Christina Schenk and Babak Maboudi Afkham},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.39519},
eprint = {2609.39519},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.39519},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - B-GRASP: A Bayesian Framework for Inferring Graph Weights from SPDE-Inspired Dynamics
AU - Christina Schenk
AU - Babak Maboudi Afkham
PY - 2026
DA - 2026/09/30
PB - arXiv
DO - 10.48550/arxiv.2609.39519
UR - https://arxiv.org/abs/2609.39519
AB - We present B-GRASP (Bayesian GRAph inference with SPDE priors), a Bayesian framework for inferring uncertain edge weights in stochastic dynamical systems on graphs from noisy observations of nodal states. The unknown edge weights parameterize the graph differential operator and therefore directly govern the evolution of the graph process. Motivated by connections between differential operators in PDEs and SPDEs and their graph counterparts, we construct stochastic graph models incorporating diffusion, reaction dynamics, and stochastic forcing. The resulting hierarchical formulation jointly represents uncertainty in the graph structure and stochastic forcing. Latent graph variables determine positive edge weights and the corresponding graph Laplacian, while latent Brownian variables represent the stochastic forcing. Conditional on these variables, the graph dynamics define a deterministic forward map from which the likelihood and posterior distribution are constructed. We characterize the posterior using maximum a posteriori estimation and the No-U-Turn Sampler, enabling both point estimation and uncertainty quantification. We demonstrate the framework on a one-dimensional inverse heat-conduction problem, stationary and nonstationary graph reaction-diffusion systems with nonlinear dynamics, and state-level COVID-19 data in the United States. The numerical results show that posterior uncertainty provides information not captured by point estimates, particularly for weakly identifiable or highly conductive edges, and enables uncertainty in both graph connectivity and stochastic forcing to be quantified within a Bayesian framework.
ER -