Detecting independence of random vectors: Generalized distance covariance and Gaussian covariance

13Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Distance covariance is a quantity to measure the dependence of two random vectors. We show that the original concept introduced and developed by Székely, Rizzo and Bakirov can be embedded into a more general framework based on symmetric Lévy measures and the corresponding real-valued continuous negative definite functions. The Lévy measures replace the weight functions used in the original definition of distance covariance. All essential properties of distance covariance are preserved in this new framework. From a practical point of view this allows less restrictive moment conditions on the underlying random variables and one can use other distance functions than Euclidean distance, e.g. Minkowski distance. Most importantly, it serves as the basic building block for distance multivariance, a quantity to measure and estimate dependence of multiple random vectors, which is introduced in a follow-up paper [Distance Multivariance: New dependence measures for random vectors (submitted). Revised version of arXiv: 1711.07775v1] to the present article.

Cite

CITATION STYLE

APA

Böttcher, B., Keller-Ressel, M., & Schilling, R. L. (2018). Detecting independence of random vectors: Generalized distance covariance and Gaussian covariance. Modern Stochastics: Theory and Applications, 5(3), 353–383. https://doi.org/10.15559/18-VMSTA116

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free