Continuously indexed graphical models

Abstract Let X={Xu}u∈U be a real-valued Gaussian process indexed by a set U. We show that X can be viewed as a graphical model with an uncountably infinite graph, where each Xu is a vertex. This graph is characterized by the reproducing property of X’s covariance kernel, without restricting U to be finite or countable, allowing the modelling of stochastic processes in continuous time/space. Unlike traditional methods, this characterization is not based on zero entries of an inverse covariance, posing challenges for structure estimation. We propose a plug-in methodology that targets graph recovery up to a finite resolution and shows consistency for graphs which are sufficiently regular and that can be applied to virtually any measurement regime. Furthermore, we derive convergence rates and finite-sample guarantees for the method, and demonstrate its performance through a simulation study and two data analyses.

Authors

Institutions

Publication Details

Journal
Journal of the Royal Statistical Society Series B (Statistical Methodology)
Published
2024-09-13
DOI
https://doi.org/10.1093/jrsssb/qkae086
Citations
2
Primary Topic
Data Management and Algorithms
Type
article
Field-Weighted Citation Impact
0.70

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Continuously indexed graphical models

Victor M. Panaretos, Kartik G. Waghmare
2 citations
Journal of the Royal Statistical Society Series B (Statistical Methodology)
Data Management and Algorithms
0.70
article

Continuously indexed graphical models

Victor M. Panaretos, Kartik G. Waghmare
article en
2 citations

Abstract

Abstract Let X={Xu}u∈U be a real-valued Gaussian process indexed by a set U. We show that X can be viewed as a graphical model with an uncountably infinite graph, where each Xu is a vertex. This graph is characterized by the reproducing property of X’s covariance kernel, without restricting U to be finite or countable, allowing the modelling of stochastic processes in continuous time/space. Unlike traditional methods, this characterization is not based on zero entries of an inverse covariance, posing challenges for structure estimation. We propose a plug-in methodology that targets graph recovery up to a finite resolution and shows consistency for graphs which are sufficiently regular and that can be applied to virtually any measurement regime. Furthermore, we derive convergence rates and finite-sample guarantees for the method, and demonstrate its performance through a simulation study and two data analyses.

Journal of the Royal Statistical Society Series B (Statistical Methodology)Vol. 87(1)
École Polytechnique Fédérale de Lausanne (CH)
Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung
Openalex Percentile: Top 31%
Data Management and Algorithms
0.70
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.