arXiv subjects

Claudia Klüppelberg

Publications and source records attributed to Claudia Klüppelberg.

At least 19 recordsLinked to original sources

arXiv2025

Causal analysis of extreme risk in a network of industry portfolios

We provide a comprehensive review of causal dependence through a max-linear structural equation model. Such models express each node variable as a max-linear function of its parental node variables in a directed acyclic graph and some exogenous innovation. We reformulate results on structure learning and estimation, which we apply to a network of financial data. A new method, based on hard-thresholding and on the Hamming distance, estimates a sparse DAG for extreme risk~propagation.

q-fin.RM↗

arXiv2025

Heavy-tailed max-linear structural equation models in networks with hidden nodes

Recursive max-linear vectors provide models for causal dependence between large values of random variables that are supported on directed acyclic graphs, but the standard assumption that all nodes of such a graph are observed can be unrealistic. We give necessary and sufficient conditions for a partially observed recursive max-linear vector to be representable as a recursive max-linear (sub-)model and provide a graphical algorithm to construct the latter. Our conditions concern the max-weighted paths of a directed acyclic graph and its minimal representation, which play a key role for such models. In the framework of regular variation we translate these conditions into checkable criteria and establish a connection between max-weighted paths and the extremal dependence measure of transformed variables for pairs of nodes. We propose a statistical algorithm to detect bivariate regularly varying recursive max-linear models among the node variables of a directed acyclic graph and show consistency and asymptotic normality of the estimators of the extremal dependence measure under a thresholding procedure. Simulations show that our algorithm performs satisfactorily. We apply it to nutrition intake data.

math.ST↗

arXiv2025

Copula methods for modeling pair densities in density functional theory

We propose a new approach towards approximating the density-to-pair-density map based on copula theory from statistics. We extend the copula theory to multi-dimensional marginals, and deduce that one can describe any (exact or approximate) pair density by the single-particle density and a copula. We present analytical formulas for the exact copula in scaling limits, numerically compute the copula for dissociating systems with two to four particles in one dimension, and propose accurate approximations of the copula between equilibrium and dissociation for two-particle systems.

physics.comp-ph↗

arXiv2023

Estimating a Directed Tree for Extremes

We propose a new method to estimate a root-directed spanning tree from extreme data. A prominent example is a river network, to be discovered from extreme flow measured at a set of stations. Our new algorithm utilizes qualitative aspects of a max-linear Bayesian network, which has been designed for modelling causality in extremes. The algorithm estimates bivariate scores and returns a root-directed spanning tree. It performs extremely well on benchmark data and new data. We prove that the new estimator is consistent under a max-linear Bayesian network model with noise. We also assess its strengths and limitations in a small simulation study.

stat.ML↗

arXiv2022

Max-linear models in random environment

We extend previous work of max-linear models on finite directed acyclic graphs to infinite graphs as well as random graphs, and investigate their relations to classical percolation theory, more particularly the impact of Bernoulli bond percolation on such models. We show that the critical probability of percolation on the oriented square lattice graph $\mathbb{Z}^2$ describes a phase transition in the obtained model. Focus is on the dependence introduced by this graph into the max-linear model. We discuss natural applications in communication networks, in particular, concerning the propagation of influences.

math.PR↗

arXiv2021

Indirect Inference for Time Series Using the Empirical Characteristic Function and Control Variates

We estimate the parameter of a stationary time series process by minimizing the integrated weighted mean squared error between the empirical and simulated characteristic function, when the true characteristic functions cannot be explicitly computed. Motivated by Indirect Inference, we use a Monte Carlo approximation of the characteristic function based on iid simulated blocks. As a classical variance reduction technique, we propose the use of control variates for reducing the variance of this Monte Carlo approximation. These two approximations yield two new estimators that are applicable to a large class of time series processes. We show consistency and asymptotic normality of the parameter estimators under strong mixing, moment conditions, and smoothness of the simulated blocks with respect to its parameter. In a simulation study we show the good performance of these new simulation based estimators, and the superiority of the control variates based estimator for Poisson driven time series of counts.

math.ST↗

arXiv2020

Conditional Independence in Max-linear Bayesian Networks

Motivated by extreme value theory, max-linear Bayesian networks have been recently introduced and studied as an alternative to linear structural equation models. However, for max-linear systems the classical independence results for Bayesian networks are far from exhausting valid conditional independence statements. We use tropical linear algebra to derive a compact representation of the conditional distribution given a partial observation, and exploit this to obtain a complete description of all conditional independence relations. In the context-specific case, where conditional independence is queried relative to a specific value of the conditioning variables, we introduce the notion of a source DAG to disclose the valid conditional independence relations. In the context-free case we characterize conditional independence through a modified separation concept, $\ast$-separation, combined with a tropical eigenvalue condition. We also introduce the notion of an impact graph which describes how extreme events spread deterministically through the network and we give a complete characterization of such impact graphs. Our analysis opens up several interesting questions concerning conditional independence and tropical geometry.

math.ST↗

arXiv2020

Tail probabilities of random linear functions of regularly varying random vectors

We provide a new extension of Breiman's Theorem on computing tail probabilities of a product of random variables to a multivariate setting. In particular, we give a complete characterization of regular variation on cones in $[0,\infty)^d$ under random linear transformations. This allows us to compute probabilities of a variety of tail events, which classical multivariate regularly varying models would report to be asymptotically negligible. We illustrate our findings with applications to risk assessment in financial systems and reinsurance markets under a bipartite network structure.

math.PR↗

arXiv2020

Recursive max-linear models with propagating noise

Recursive max-linear vectors model causal dependence between node variables by a structural equation model, expressing each node variable as a max-linear function of its parental nodes in a directed acyclic graph (DAG) and some exogenous innovation. For such a model, there exists a unique minimum DAG, represented by the Kleene star matrix of its edge weight matrix, which identifies the model and can be estimated. For a more realistic statistical modeling we introduce some random observational noise. A probabilistic analysis of this new noisy model reveals that the unique minimum DAG representing the distribution of the non-noisy model remains unchanged and identifiable. Moreover, the distribution of the minimum ratio estimators of the model parameters at their left limits are completely determined by the distribution of the noise variables up to a positive constant. Under a regular variation condition on the noise variables we prove that the estimated Kleene star matrix converges to a matrix of independent Weibull entries after proper centering and scaling.

math.ST↗

arXiv2020

Ruin probabilities for risk processes in a bipartite network

This paper studies risk balancing features in an insurance market by evaluating ruin probabilities for single and multiple components of a multivariate compound Poisson risk process. The dependence of the components of the process is induced by a random bipartite network. In analogy with the non-network scenario, a network ruin parameter is introduced. This random parameter, which depends on the bipartite network, is crucial for the ruin probabilities. Under certain conditions on the network and for light-tailed claim size distributions we obtain Lundberg bounds and, for exponential claim size distributions, exact results for the ruin probabilities. For large sparse networks, the network ruin parameter is approximated by a function of independent Poisson variables. T

math.PR↗

arXiv2019

Estimating an Extreme Bayesian Network via Scalings

Recursive max-linear vectors model causal dependence between its components by expressing each node variable as a max-linear function of its parental nodes in a directed acyclic graph and some exogenous innovation. Motivated by extreme value theory, innovations are assumed to have regularly varying distribution tails. We propose a scaling technique in order to determine a causal order of the node variables. All dependence parameters are then estimated from the estimated scalings. Furthermore, we prove asymptotic normality of the estimated scalings and dependence parameters based on asymptotic normality of the empirical spectral measure. Finally, we apply our structure learning and estimation algorithm to financial data and food dietary interview data.

stat.ME↗

arXiv2019

Identifiability and estimation of recursive max-linear models

We address the identifiablity and estimation of recursive max-linear structural equation models represented by an edge weighted directed acyclic graph (DAG). Such models are generally unidentifiable and we identify the whole class of DAGs and edge weights corresponding to a given observational distribution. For estimation, standard likelihood theory cannot be applied because the corresponding families of distributions are not dominated. Given the underlying DAG, we present an estimator for the class of edge weights and show that it can be considered a generalized maximum likelihood estimator. In addition, we develop a simple method for identifying the structures of the DAGs. With probability tending to one at an exponential rate with the number of observations, this method correctly identifies the class of DAGs and, similarly, exactly identifies the possible edge weights.

math.ST↗

arXiv2019

Estimation of causal CARMA random fields

We estimate model parameters of Lévy-driven causal CARMA random fields by fitting the empirical variogram to the theoretical counterpart using a weighted least squares (WLS) approach. Subsequent to deriving asymptotic results for the variogram estimator, we show strong consistency and asymptotic normality of the parameter estimator. Furthermore, we conduct a simulation study to assess the quality of the WLS estimator for finite samples. For the simulation we utilize numerical approximation schemes based on truncation and discretization of stochastic integrals and we analyze the associated simulation errors in detail. Finally, we apply our results to real data of the cosmic microwave background.

math.ST↗

arXiv2019

Modelling Extremal Dependence for Operational Risk by a Bipartite Graph

We introduce a statistical model for operational losses based on heavy-tailed distributions and bipartite graphs, which captures the event type and business line structure of operational risk data. The model explicitly takes into account the Pareto tails of losses and the heterogeneous dependence structures between them. We then derive estimators for individual as well as aggregated tail risk, measured in terms of Value-at-Risk and Conditional-Tail-Expectation for very high confidence levels, and provide also an asymptotically full capital allocation method. Estimation methods for such tail risk measures and capital allocations are also proposed and tested on simulated data. Finally, by having access to real-world operational risk losses from the Italian banking system, we show that even with a small number of observations, the proposed estimation methods produce reliable estimates, and that quantifying dependence by means of the empirical network has a big impact on estimates at both individual and aggregate level, as well as for capital allocations.

q-fin.RM↗

arXiv2019

Bayesian Networks for Max-linear Models

We study Bayesian networks based on max-linear structural equations as introduced in Gissibl and Klüppelberg [16] and provide a summary of their independence properties. In particular we emphasize that distributions for such networks are generally not faithful to the independence model determined by their associated directed acyclic graph. In addition, we consider some of the basic issues of estimation and discuss generalized maximum likelihood estimation of the coefficients, using the concept of a generalized likelihood ratio for non-dominated families as introduced by Kiefer and Wolfowitz [21]. Finally we argue that the structure of a minimal network asymptotically can be identified completely from observational data.

stat.ME↗

arXiv2018

Generalised least squares estimation of regularly varying space-time processes based on flexible observation schemes

Regularly varying stochastic processes model extreme dependence between process values at different locations and/or time points. For such processes we propose a two-step parameter estimation of the extremogram, when some part of the domain of interest is fixed and another increasing. We provide conditions for consistency and asymptotic normality of the empirical extremogram centred by a pre-asymptotic version for such observation schemes. For max-stable processes with Fr{é}chet margins we provide conditions, such that the empirical extremogram (or a bias-corrected version) centred by its true version is asymptotically normal. In a second step, for a parametric extremogram model, we fit the parameters by generalised least squares estimation and prove consistency and asymptotic normality of the estimates. We propose subsampling procedures to obtain asymptotically correct confidence intervals. Finally, we apply our results to a variety of Brown-Resnick processes. A simulation study shows that the procedure works well also for moderate sample sizes.

math.ST↗

arXiv2018

Indirect Inference for Lévy-driven continuous-time GARCH models

We advocate the use of an Indirect Inference method to estimate the parameter of a COGARCH(1,1) process for equally spaced observations. This requires that the true model can be simulated and a reasonable estimation method for an approximate auxiliary model. We follow previous approaches and use linear projections leading to an auxiliary autoregressive model for the squared COGARCH returns. The asymptotic theory of the Indirect Inference estimator relies {on a uniform SLLN and asymptotic normality of the parameter estimates of the auxiliary model, which require continuity and differentiability of the COGARCH process} with respect to its parameter and which we prove via Kolmogorov's continuity criterion. This leads to consistent and asymptotically normal Indirect Inference estimates under moment conditions on the driving Lévy process. A simulation study shows that the method yields a substantial finite sample bias reduction compared to previous estimators.

stat.ME↗

arXiv2018

Semiparametric estimation for isotropic max-stable space-time processes

Regularly varying space-time processes have proved useful to study extremal dependence in space-time data. We propose a semiparametric estimation procedure based on a closed form expression of the extremogram to estimate parametric models of extremal dependence functions. We establish the asymptotic properties of the resulting parameter estimates and propose subsampling procedures to obtain asymptotically correct confidence intervals. A simulation study shows that the proposed procedure works well for moderate sample sizes and is robust to small departures from the underlying model. Finally, we apply this estimation procedure to fitting a max-stable process to radar rainfall measurements in a region in Florida. Complementary results and some proofs of key results are presented together with the simulation study in the supplement.

stat.ME↗