arXiv subjects

Frank Röttger

Publications and source records attributed to Frank Röttger.

At least 19 recordsLinked to original sources

arXiv2026

Directional variograms for multivariate extremes

Multivariate generalized Pareto distributions arise as limits of threshold exceedances and form a central model class for multivariate extremes. Existing inference methods based on the extremal variogram condition on the value of a single component, which can be statistically suboptimal. We generalize this approach by conditioning the multivariate generalized Pareto random vector $Y$ to lie on arbitrary half-spaces. Specifically, for a direction vector $v$, we introduce the random vector $Y^v = (Y \mid v^\top Y > 0)$ and define the associated $v$-variogram $Γ_{ij}^v=\mathrm{Var}(Y_i^v-Y_j^v)$. We establish the decomposition $Y^v \stackrel{d}{=} W^v+E\mathbf{1}$ into the so-called $v$-extremal function $W^v$ and an independent exponential random variable $E$, and derive several results relating these random variables to each other. For logistic, Dirichlet, and Hüsler-Reiss multivariate generalized Pareto models, we derive closed-form expressions for $Γ^v$. In the Hüsler-Reiss case, we further derive new density representations and identify a distinguished resistance-curvature vector $v_0$ that uniquely centers the Gaussian law of $W^{v_0}$ while characterizing the least-mass half-space. On the statistical side, we introduce empirical $v$-variograms and show in a simulation study that the choice of $v$ induces a pronounced bias-variance trade-off that is strongly related to the mass of the conditioning half-space. Moreover, combining information across multiple directions $v$ can substantially reduce estimation variance relative to methods based on a single vector.

stat.ME↗

arXiv2026

Spectral Sparsification of Laplacian-Constrained Gaussian and Hüsler-Reiss Graphical Models

Graph Laplacians encode graph structures in matrix form, and thus facilitate the application of linear algebra to graph theory. In statistics, two related families of probabilistic graphical models can be parameterized by graph Laplacians. The first one is the Laplacian-constrained Gaussian graphical model (LCGGM), which imposes that the (pseudo-)inverse covariance matrix of a Gaussian random vector is a Laplacian matrix. Applications include graph signal processing and network topology learning. The second one is the Hüsler-Reiss graphical model, which is considered as an extremal analog of the Gaussian graphical model, and can be used in extremal dependence modeling of floods, heatwaves, and financial losses. For both models, the restriction to positive edge weights in the graph Laplacian gives rise to an approach for graph structure learning that does not require tuning parameters. While these approaches yield a strong model fit in many settings, the resulting graph estimates are typically much denser than the underlying ground truth, limiting interpretability and scalability. In order to improve the accuracy of Laplacian-constrained graph learning, we propose to use spectral graph sparsification as a post-estimation operation. To do so, we replace the original Laplacian estimate by a sparser Laplacian that is spectrally close, and re-fit the model on the resulting graph. We refer to the two resulting methods as Spectral-LCGGM and Spectral-HR. We investigate the properties of the proposed estimators and show several theoretical results on their performance. Furthermore, we demonstrate that the newly proposed methods perform well by running simulations on Erdős-Rényi and stochastic block model graphs, and we also showcase their applications to real data.

stat.ME↗

arXiv2026

Learning Gaussian Graphical Models under Total Positivity via Spectral Graph Sparsification

Many practical data analysis tasks reduce to learning, from observed samples, how a collection of variables depend on each other. A widely used approach is to fit a Gaussian graphical model, which represents the dependence structure as a graph connecting the variables. In a number of important applications, such as financial returns, gene co-expression, and climate or network analysis, the dependencies tend to be positive: variables move together rather than offset each other. Encoding this positivity through the constraint of multivariate total positivity of order two (MTP2) yields an attractive estimator that produces accurate fits with no tuning required. The resulting graphs are, however, typically much denser than the underlying ground-truth model, which makes them hard to interpret and slow to use in any downstream task that operates on the graph. In this work, we propose a novel highly-scalable approach for learning Gaussian graphical models from data using spectral sparsification; we call it Spectral-MTP2. Spectral graph sparsification is a fundamental method which aims to preserve meaningful properties of a dense graph with a sparser subgraph. We theoretically and empirically investigate and validate our method, and show that learning Gaussian Graphical Models under MTP2 using spectral sparsification preserves MTP2 and approximates well the original model in terms of Kullback-Leibler divergence and Gaussian log-likelihood. In simulations and applications to equity returns and gene expression, we observe that Spectral-MTP2 retains most of the fit quality of the denser MTP2 baseline, while producing substantially sparser and more interpretable graphs.

stat.ME↗

arXiv2026

Algebraic statistics of Hüsler-Reiss graphical models in multivariate extremes

The field of extreme value statistics is concerned with modeling and predicting rare events. In a Hüsler-Reiss graphical model, a graph represents extremal conditional independence (CI) relations between random variables. These models are exponential families parameterized by a graph Laplacian and are considered the analogue of multivariate Gaussian models in the extremal setting. We study these models from the perspective of algebraic geometry. Translating the CI relations into polynomial constraints in the parameters, we define extremal CI ideals and find a determinantal representation of their generators. In terms of parametric inference, we study the extremal maximum likelihood degree as the number of solutions to a conditionally negative definite matrix completion problem. We also define and analyze the extremal maximum likelihood threshold for Hüsler-Reiss graphical models, which provides a certificate for the existence of a surrogate MLE in terms of the dimensionality of the point configuration that realizes the underlying summary statistic as a Euclidean distance matrix. We highlight throughout many interesting similarities but also differences with respect to Gaussian graphical models.

math.ST↗

arXiv2026

Extremal conditional independence for Hüsler-Reiss distributions via modular functions

We study extremal conditional independence for Hüsler-Reiss distributions, which is a parametric subclass of multivariate Pareto distributions. As the main contribution, we introduce two set functions, i.e.~functions which assign a value to the distribution and each of its marginals, and show that extremal conditional independence statements can be characterized by modularity relations for these functions. For the first function, we make use of the close connection between Hüsler-Reiss and Gaussian models to introduce a multiinformation-inspired measure $m^{\text{HR}}$ for Hüsler-Reiss distributions. For the second function, we consider an invariant $σ^2$ that is naturally associated to the Hüsler-Reiss parameterization and establish the second modularity criterion under additional positivity constraints. Together, these results provide new tools for describing extremal dependence structures in high-dimensional extreme value statistics. In addition, we study the geometry of a bounded subset of Hüsler-Reiss parameters and its relation with the Gaussian elliptope.

math.ST↗

arXiv2025

Optimal designs for discrete choice models via graph Laplacians

In discrete choice experiments, the information matrix depends on the model parameters. Therefore designing optimally informative experiments for arbitrary initial parameters often yields highly nonlinear optimization problems and makes optimal design infeasible. To overcome such challenges, we connect design theory for discrete choice experiments with Laplacian matrices of undirected graphs, resulting in complexity reduction and feasibility of optimal design. We rewrite the $D$-optimality criterion in terms of Laplacians via Kirchhoff's matrix tree theorem, and show that its dual has a simple description via the Cayley-Menger determinant of the Farris transform of the Laplacian matrix. This results in a drastic reduction of complexity and allows us to implement a gradient descent algorithm to find locally $D$-optimal designs. For the subclass of Bradley-Terry paired comparison models, we find a direct link to maximum likelihood estimation for Laplacian-constrained Gaussian graphical models. Finally, we study the performance of our algorithm and demonstrate its application to real and simulated data.

math.ST↗

arXiv2025

Extremes of structural causal models

The behavior of extreme observations is well-understood for time series or spatial data, but little is known if the data generating process is a structural causal model (SCM). We study the behavior of extremes in this model class, both for the observational distribution and under extremal interventions. We show that under suitable regularity conditions on the structure functions, the extremal behavior is described by a multivariate Pareto distribution, which can be represented as a new SCM on an extremal graph. Importantly, the latter is a sub-graph of the graph in the original SCM, which means that causal links can disappear in the tails. We further introduce a directed version of extremal graphical models and show that an extremal SCM satisfies the corresponding Markov properties. Based on a new test of extremal conditional independence, we propose two algorithms for learning the extremal causal structure from data. The first is an extremal version of the PC-algorithm, and the second is a pruning algorithm that removes edges from the original graph to consistently recover the extremal graph. The methods are illustrated on river data with known causal ground truth.

stat.ME↗

arXiv2025

Latent Gaussian and Hüsler--Reiss Graphical Models with Golazo Penalty

The existence of latent variables in practical problems is common, for example when some variables are difficult or expensive to measure, or simply unknown. When latent variables are unaccounted for, structure learning for Gaussian graphical models can be blurred by additional correlation between the observed variables that is incurred by the latent variables. A standard approach for this problem is a latent version of the graphical lasso that splits the inverse covariance matrix into a sparse and a low-rank part that are penalized separately. This approach has recently been extended successfully to Hüsler--Reiss graphical models, which can be considered as an analogue of Gaussian graphical models in extreme value statistics. In this paper we propose a generalization of structure learning for Gaussian and Hüsler--Reiss graphical models via the flexible Golazo penalty. This allows us to introduce latent versions of for example the adaptive lasso, positive dependence constraints or predetermined sparsity patterns, and combinations of those. We develop algorithms for both latent graphical models with the Golazo penalty and demonstrate them on simulated and real data.

stat.ME↗

arXiv2024

The geometry of Gaussian double Markovian distributions

Gaussian double Markovian models consist of covariance matrices constrained by a pair of graphs specifying zeros simultaneously in the covariance matrix and its inverse. We study the semi-algebraic geometry of these models, in particular their dimension, smoothness and connectedness as well as algebraic and combinatorial properties.

math.ST↗

arXiv2024

Modeling Extreme Events: Univariate and Multivariate Data-Driven Approaches

This article summarizes the contribution of team genEVA to the EVA (2023) Conference Data Challenge. The challenge comprises four individual tasks, with two focused on univariate extremes and two related to multivariate extremes. In the first univariate assignment, we estimate a conditional extremal quantile using a quantile regression approach with neural networks. For the second, we develop a fine-tuning procedure for improved extremal quantile estimation with a given conservative loss function. In the first multivariate sub-challenge, we approximate the data-generating process with a copula model. In the remaining task, we use clustering to separate a high-dimensional problem into approximately independent components. Overall, competitive results were achieved for all challenges, and our approaches for the univariate tasks yielded the most accurate quantile estimates in the competition.

stat.ME↗

arXiv2024

Graphical models for multivariate extremes

Graphical models in extremes have emerged as a diverse and quickly expanding research area in extremal dependence modeling. They allow for parsimonious statistical methodology and are particularly suited for enforcing sparsity in high-dimensional problems. In this work, we provide the fundamental concepts of extremal graphical models and discuss recent advances in the field. Different existing perspectives on graphical extremes are presented in a unified way through graphical models for exponent measures. We discuss the important cases of nonparametric extremal graphical models on simple graph structures, and the parametric class of Hüsler--Reiss models on arbitrary undirected graphs. In both cases, we describe model properties, methods for statistical inference on known graph structures, and structure learning algorithms when the graph is unknown. We illustrate different methods in an application to flight delay data at US airports.

stat.ME↗

arXiv2023

On the local metric property in multivariate extremes

Many multivariate data sets exhibit a form of positive dependence, which can either appear globally between all variables or only locally within particular subgroups. A popular notion of positive dependence that allows for localized positivity is positive association. In this work we introduce the notion of extremal positive association for multivariate extremes from threshold exceedances. Via a sufficient condition for extremal association, we show that extremal association generalizes extremal tree models. For Hüsler--Reiss distributions the sufficient condition permits a parametric description that we call the metric property. As the parameter of a Hüsler--Reiss distribution is a Euclidean distance matrix, the metric property relates to research in electrical network theory and Euclidean geometry. We show that the metric property can be localized with respect to a graph and study surrogate likelihood inference. This gives rise to a two-step estimation procedure for locally metrical Hüsler--Reiss graphical models. The second step allows for a simple dual problem, which is implemented via a gradient descent algorithm. Finally, we demonstrate our results on simulated and real data.

math.ST↗

arXiv2023

Total positivity in multivariate extremes

Positive dependence is present in many real world data sets and has appealing stochastic properties that can be exploited in statistical modeling and in estimation. In particular, the notion of multivariate total positivity of order 2 ($ \mathrm{MTP}_{2} $) is a convex constraint and acts as an implicit regularizer in the Gaussian case. We study positive dependence in multivariate extremes and introduce $ \mathrm{EMTP}_{2} $, an extremal version of $ \mathrm{MTP}_{2} $. This notion turns out to appear prominently in extremes, and in fact, it is satisfied by many classical models. For a Hüsler--Reiss distribution, the analogue of a Gaussian distribution in extremes, we show that it is $ \mathrm{EMTP}_{2} $ if and only if its precision matrix is a Laplacian of a connected graph. We propose an estimator for the parameters of the Hüsler--Reiss distribution under $ \mathrm{EMTP}_{2} $ as the solution of a convex optimization problem with Laplacian constraint. We prove that this estimator is consistent and typically yields a sparse model with possibly nondecomposable extremal graphical structure. Applying our methods to a data set of Danube River flows, we illustrate this regularization and the superior performance compared to existing methods.

math.ST↗

arXiv2023

Parametric and nonparametric symmetries in graphical models for extremes

Colored graphical models provide a parsimonious approach to modeling high-dimensional data by exploiting symmetries in the model parameters. In this work, we introduce the notion of coloring for extremal graphical models on multivariate Pareto distributions, a natural class of limiting distributions for threshold exceedances. Thanks to a stability property of the multivariate Pareto distributions, colored extremal tree models can be defined fully nonparametrically. For more general graphs, the parametric family of Hüsler--Reiss distributions allows for two alternative approaches to colored graphical models. We study both model classes and introduce statistical methodology for parameter estimation. It turns out that for Hüsler--Reiss tree models the different definitions of colored graphical models coincide. In addition, we show a general parametric description of extremal conditional independence statements for Hüsler--Reiss distributions. Finally, we demonstrate that our methodology outperforms existing approaches on a real data set.

math.ST↗

arXiv2022

A central limit theorem for the two-sided descent statistic on Coxeter groups

We study the asymptotic behaviour of the statistic (des+ides) which assigns to an element w of a finite Coxeter group W the number of descents of w plus the number of descents of its inverse. Our main result is a central limit theorem for the probability distributions associated to this statistic. This answers a question of Kahle-Stump and generalises work of Chatterjee-Diaconis, Özdemir and Röttger.

math.CO↗

arXiv2021

Reciprocal Maximum Likelihood Degrees of Brownian Motion Tree Models

We give an explicit formula for the reciprocal maximum likelihood degree of Brownian motion tree models. To achieve this, we connect them to certain toric (or log-linear) models, and express the Brownian motion tree model of an arbitrary tree as a toric fiber product of star tree models.

math.ST↗

arXiv2021

The semi-algebraic geometry of saturated optimal designs for the Bradley-Terry model

Optimal design theory for nonlinear regression studies local optimality on a given design space. We identify designs for the Bradley--Terry paired comparison model with small undirected graphs and prove that every saturated D-optimal design is represented by a path. We discuss the case of four alternatives in detail and derive explicit polynomial inequality descriptions for optimality regions in parameter space. Using these regions, for each point in parameter space we can prescribe a D-optimal design.

math.ST↗

arXiv2020

$ D $-optimal designs for Poisson regression with synergetic interaction effect

We characterize $D$-optimal designs in the two-dimensional Poisson regression model with synergetic interaction and provide an explicit proof. The proof is based on the idea of reparameterization of the design region in terms of contours of constant intensity. This approach leads to a substantial reduction of complexity as properties of the sensitivity can be treated along and across the contours separately. Furthermore, some extensions of this result to higher dimensions are presented.

math.ST↗