Open Access
2022 Nested covariance functions on graphs with Euclidean edges cross time
Emilio Porcu, Xavier Emery, Ana Paula Peron
Author Affiliations +
Electron. J. Statist. 16(2): 4222-4246 (2022). DOI: 10.1214/22-EJS2039

Abstract

Covariance functions over generalized networks have been explored to a very limited extent. We consider nested spatial or space-time covariance models, where space is a generalized network, and where time can be linear (the real line) or circular. We show sufficient conditions allowing preservation of positive semidefiniteness when at least one of the weights involved in the linear combination is negative. Several examples illustrate our findings. In particular, we show nested constructions for Euclidean trees with a finite number of leaves involving basic covariance functions with different scale parameters or different compact supports. We also provide criteria that allow one to build space-time models through half spectral modeling on graphs cross linear or circular time.

Funding Statement

Emilio Porcu acknowledges the project FSU-2021-016 from Khalifa University of Science and Technology. Xavier Emery acknowledges the funding of the National Agency for Research and Development of Chile, through grants ANID / FONDECYT / REGULAR / 1210050 and ANID PIA AFB180004. Ana Paula Peron was partially supported by FAPESP, grant # 2021/04269-0.

Acknowledgments

The authors are grateful to the Editors and to a Referee for the thorough comments that allowed for an improved version of the manuscript.

Citation

Download Citation

Emilio Porcu. Xavier Emery. Ana Paula Peron. "Nested covariance functions on graphs with Euclidean edges cross time." Electron. J. Statist. 16 (2) 4222 - 4246, 2022. https://doi.org/10.1214/22-EJS2039

Information

Received: 1 October 2021; Published: 2022
First available in Project Euclid: 17 August 2022

MathSciNet: MR4474573
zbMATH: 07578467
Digital Object Identifier: 10.1214/22-EJS2039

Keywords: circular time , covariance functions , Euclidean trees , generalized networks , graphs with Euclidean edges , linear time

Vol.16 • No. 2 • 2022
Back to Top