Dependence modelling in ultra high dimensions with vine copulas and the Graphical Lasso

被引:11
作者
Mueller, Dominik [1 ]
Czado, Claudia [1 ]
机构
[1] Tech Univ Munich, Dept Math, Boltzmannstr 3, D-85748 Garching, Germany
关键词
Sparsity; Copula; Graphical models; SELECTION; CONSTRUCTIONS; NETWORKS;
D O I
10.1016/j.csda.2019.02.007
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
To model high dimensional data, Gaussian methods are widely used since they remain tractable and yield parsimonious models by imposing strong assumptions on the data. Vine copulas are more flexible by combining arbitrary marginal distributions and (conditional) bivariate copulas. Yet, this adaptability is accompanied by sharply increasing computational effort as the dimension increases. The proposed approach overcomes this burden and makes the first step into ultra high dimensional non-Gaussian dependence modelling by using a divide-and-conquer approach. First, Gaussian methods are applied to split datasets into feasibly small subsets and second, parsimonious and flexible vine copulas are applied thereon. Finally, these sub-models are reconciled into one joint model. Numerical results demonstrating the feasibility of the novel approach in moderate dimensions are provided. The ability of the approach to estimate ultra high dimensional non-Gaussian dependence models in thousands of dimensions is presented. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:211 / 232
页数:22
相关论文
共 48 条
[1]   Pair-Copula Constructions for Financial Applications: A Review [J].
Aas, Kjersti .
ECONOMETRICS, 2016, 4 (04)
[2]   Pair-copula constructions of multiple dependence [J].
Aas, Kjersti ;
Czado, Claudia ;
Frigessi, Arnoldo ;
Bakken, Henrik .
INSURANCE MATHEMATICS & ECONOMICS, 2009, 44 (02) :182-198
[3]  
[Anonymous], 1962, Modern Factor Analysis
[4]  
[Anonymous], 2017, R PACKAGE VERSION
[5]  
[Anonymous], 2011, DEPEND MODEL
[6]  
[Anonymous], 2017, ARXIV170305203
[7]  
[Anonymous], ARXIV160403269
[8]  
[Anonymous], 2015, BAYESIAN MODEL SELEC
[9]  
[Anonymous], 2005, Quantitative Risk Management
[10]   COMPLEXITY OF FINDING EMBEDDINGS IN A K-TREE [J].
ARNBORG, S ;
CORNEIL, DG ;
PROSKUROWSKI, A .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1987, 8 (02) :277-284