A Kriging procedure for processes indexed by graphs
classification
🧮 math.ST
stat.TH
keywords
graphskrigingprocessesrandomindexedpredictionprocedureconstruction
read the original abstract
We provide a new kriging procedure of processes on graphs. Based on the construction of Gaussian random processes indexed by graphs, we extend to this framework the usual linear prediction method for spatial random fields, known as kriging. We provide the expression of the estimator of such a random field at unobserved locations as well as a control for the prediction error.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.