Concentration bounds for the extremal variogram

11/01/2021
by   Sebastian Engelke, et al.
0

In extreme value theory, the extremal variogram is a summary of the tail dependence of a random vector. It is a central ingredient for learning extremal tree structures (arXiv:2012.06179) and has close connections to the estimation of Hüsler-Reiss models and extremal graphical models (arXiv:1812.01734). This note presents concentration results for the empirical version of the extremal variogram under general domain of attraction conditions. The results play a role in extending the findings in arXiv:2012.06179 to increasing dimensions. The note is also the first building block for penalized estimation of sparse Hüsler-Reiss graphical models.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/10/2023

Decomposable Tail Graphical Models

We develop an asymptotic theory for extremes in decomposable graphical m...
research
07/08/2019

Empirical Bayesian Learning in AR Graphical Models

We address the problem of learning graphical models which correspond to ...
research
01/10/2013

Network-based clustering with mixtures of L1-penalized Gaussian graphical models: an empirical investigation

In many applications, multivariate samples may harbor previously unrecog...
research
12/11/2020

Structure learning for extremal tree models

Extremal graphical models are sparse statistical models for multivariate...
research
04/17/2020

Estimation of sparse Gaussian graphical models with hidden clustering structure

Estimation of Gaussian graphical models is important in natural science ...
research
06/14/2007

Getting started in probabilistic graphical models

Probabilistic graphical models (PGMs) have become a popular tool for com...
research
11/25/2009

On ℓ_1-regularized estimation for nonlinear models that have sparse underlying linear structures

In a recent work (arXiv:0910.2517), for nonlinear models with sparse und...

Please sign up or login with your details

Forgot password? Click here to reset