Valid Uncertainty Quantification for Extremal Graph Structure
Sourced from the work of Sebastian Engelke, Michael Lalancette, Stanislav Volgushev
§ Problem Statement
Setup
Engelke, Lalancette, and Volgushev (Annals of Statistics, 2025) explicitly identify uncertainty quantification for estimated extremal graphs as an important future direction, beyond graph recovery. The source does not itself state a fully formal high-dimensional simultaneous-inference theorem with explicit uniform size/coverage or FWER/FDR formulas.
This setup follows Engelke et al. (2025).
Unsolved Problem
Let and let be i.i.d. observations from a -variate H"usler--Reiss multivariate Pareto model on with variogram matrix . Assume is symmetric, , and strictly conditionally negative definite (equivalently: negative definite on ), so that for anchor the matrix
is positive definite and hence is well-defined. In this model class, the extremal graph on vertices has edge iff for .
Open problem: construct edge-wise and simultaneous inferential procedures for off-diagonal entries of that remain valid when both and . For each pair , target tests of
and confidence intervals with high-dimensional uniform guarantees over suitable classes (e.g., bounded spectrum, sparsity, and admissible growth):
Also target simultaneous error criteria such as asymptotic FWER/FDR control, e.g. or .
§ Discussion
§ Significance & Implications
The source paper establishes the need for uncertainty quantification in extremal graphical models. Since 2021, related inference developments (including H"usler--Reiss matrix-completion and likelihood-based uncertainty-quantification work in lower- or moderate-dimensional regimes) have improved the toolkit, but they do not yet close the core high-dimensional-uniform inference gap for edge-wise and simultaneous graph uncertainty.
§ Known Partial Results
Engelke et al. (2025): Partially resolved outside the strict open scope: existing results provide concentration guarantees and graph-recovery consistency, and newer post-2021 work gives additional inference machinery in more restricted settings. Still open in the stated sense: high-dimensional, uniform-valid edge-wise and simultaneous inference guarantees for extremal graph structure.
§ References
Learning extremal graphical structures in high dimensions
Sebastian Engelke, Michael Lalancette, Stanislav Volgushev (2025)
Annals of Statistics
📍 Section 7 (Extensions and future work) in the published Annals version, paragraph beginning "Another highly promising direction for future research is uncertainty quantification for the estimated graph..."
Published source paper; the uncertainty-quantification direction is discussed as future work.