A new bridge representation of Gaussian Whittle-Mat\'ern fields in the case of half-integer smoothness parameters, when the fields have Markov properties is developed, which decomposes the field into a finite-dimensional graph component and independent Whittle-Mat\'ern bridge processes on the individual edges.
Abstract
Gaussian Whittle-Mat\'ern 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\'ern 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.
Isotropic Gaussian processes on networks have a covariance that is a function of a distance between locations, but valid constructions have so far required graphs with Euclidean edges and the resistance metric. We introduce a one-parameter family of metrics $d_\kappa$, $\kappa\ge0$, on arbitrary compact metric graphs,...
We study inference on the strength of Gaussian multiplicative chaos from one geometric graph with unobserved vertex positions. In the planar model, the edge-count statistic has a piecewise deterministic limit with a transition at $\gamma=1$, whereas degree quantiles consistently estimate $\nu=\gamma^2/2$ throughout the...
This work analyzes a continuous two-groups model with Gaussian--Laplace mixtures and derives a prediction-risk bound for the resulting transport-map estimator, thereby reducing the problem to finite-dimensional empirical risk minimization.
This paper presents a Lagrangian framework to solve Wasserstein Hamiltonian flows (WHF) under two-point boundary conditions on large finite graphs. Characterized by a coupled system of discrete master equation and Hamilton-Jacobi (HJ) equation on the probability simplex, this formulation defines the macroscopic WHF. Wh...
Ya-Xin Feng, Yang Xiang, Hao-Min Zhou· 0 citations
Topology is, by its nature and design, suited to structure that is nonlinear, multiscale, and nonstationary - however, within machine learning, its use remains largely confined to topological data analysis. We advocate that tools from low-dimensional topology which have remained almost exclusively contained within the...
Jennifer Z. Rozenblit, Chen-Guang Yang, Yu-Xin Liu et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.