Smooth Isotropic Covariance Functions on Metric Graphs via Polyharmonic Resistance Distances

Source abstract

Metric graphs are generalisations of linear networks and provide a natural framework for the definition of continuously-indexed Gaussian processes. We define a new class of distances on these topologies, termed polyharmonic distances, which unify and extend the spectral construction underlying the effective resistance distance and the biharmonic one. We give both a spectral and a variational characterisation. Furthermore, we show an explicit class of stochastic processes whose variograms coincide with the squared polyharmonic distances. Finally, we show how these metrics can be composed with suitable completely monotonic functions to define isotropic processes having any prescribed finite-order mean-square differentiability along the edges and satisfying the Kirchhoff conditions up to order one at the vertices.