Search arXivSearch

arXiv · 1210.7485

Approximation Multivariate Distribution with pair copula Using the Orthonormal Polynomial and Legendre Multiwavelets basis functions

Abstract

In this paper, we concentrate on new methodologies for copulas introduced and developed by Joe, Cooke, Bedford, Kurowica, Daneshkhah and others on the new class of graphical models called vines as a way of constructing higher dimensional distributions. We develop the approximation method presented by Bedford et al (2012) at which they show that any $n$-dimensional copula density can be approximated arbitrarily well pointwise using a finite parameter set of 2-dimensional copulas in a vine or pair-copula construction. Our constructive approach involves the use of minimum information copulas that can be specified to any required degree of precision based on the available data or experts' judgements. By using this method, we are able to use a fixed finite dimensional family of copulas to be employed in a vine construction, with the promise of a uniform level of approximation. The basic idea behind this method is to use a two-dimensional ordinary polynomial series to approximate any log-density of a bivariate copula function by truncating the series at an appropriate point. We present an alternative approximation of the multivariate distribution of interest by considering orthonormal polynomial and Legendre multiwavelets as the basis functions. We show the derived approximations are more precise and computationally faster with better properties than the one proposed by Bedford et al. (2012). We then apply our method to modelling a dataset of Norwegian financial data that was previously analysed in the series of papers, and finally compare our results by them.

Explore related subjects

Keep this discovery

BibTeXRIS

Alireza Daneshkhah, Golamali Parham, Omid Chatrabgoun, M. Jokar. 2012-10-28. Approximation Multivariate Distribution with pair copula Using the Orthonormal Polynomial and Legendre Multiwavelets basis functions. https://arxiv.org/abs/1210.7485

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO