# Distance correlation

In statistics and in probability theory, distance correlation or distance covariance is a measure of dependence between two paired random vectors of arbitrary, not necessarily equal, dimension. The population distance correlation coefficient is zero if and only if the random vectors are independent. Thus, distance correlation measures both linear and nonlinear association between two random variables or random vectors. This is in contrast to Pearson's correlation, which can only detect linear association between two random variables.

Distance correlation can be used to perform a statistical test of dependence with a permutation test. One first computes the distance correlation (involving the re-centering of Euclidean distance matrices) between two random vectors, and then compares this value to the distance correlations of many shuffles of the data.

## Background

The classical measure of dependence, the Pearson correlation coefficient,[1] is mainly sensitive to a linear relationship between two variables. Distance correlation was introduced in 2005 by Gábor J. Székely in several lectures to address this deficiency of Pearson's correlation, namely that it can easily be zero for dependent variables. Correlation = 0 (uncorrelatedness) does not imply independence while distance correlation = 0 does imply independence. The first results on distance correlation were published in 2007 and 2009.[2][3] It was proved that distance covariance is the same as the Brownian covariance.[3] These measures are examples of energy distances.

The distance correlation is derived from a number of other quantities that are used in its specification, specifically: distance variance, distance standard deviation, and distance covariance. These quantities take the same roles as the ordinary moments with corresponding names in the specification of the Pearson product-moment correlation coefficient.

## Definitions

### Distance covariance

Let us start with the definition of the sample distance covariance. Let (XkYk), k = 1, 2, ..., n be a statistical sample from a pair of real valued or vector valued random variables (XY). First, compute the n by n distance matrices (aj, k) and (bj, k) containing all pairwise distances

{\displaystyle {\begin{aligned}a_{j,k}&=\|X_{j}-X_{k}\|,\qquad j,k=1,2,\ldots ,n,\\b_{j,k}&=\|Y_{j}-Y_{k}\|,\qquad j,k=1,2,\ldots ,n,\end{aligned}}}

where ||⋅ ||denotes Euclidean norm. Then take all doubly centered distances

${\displaystyle A_{j,k}:=a_{j,k}-{\overline {a}}_{j\cdot }-{\overline {a}}_{\cdot k}+{\overline {a}}_{\cdot \cdot },\qquad B_{j,k}:=b_{j,k}-{\overline {b}}_{j\cdot }-{\overline {b}}_{\cdot k}+{\overline {b}}_{\cdot \cdot },}$

where ${\displaystyle \textstyle {\overline {a}}_{j\cdot }}$ is the j-th row mean, ${\displaystyle \textstyle {\overline {a}}_{\cdot k}}$ is the k-th column mean, and ${\displaystyle \textstyle {\overline {a}}_{\cdot \cdot }}$ is the grand mean of the distance matrix of the X sample. The notation is similar for the b values. (In the matrices of centered distances (Aj, k) and (Bj,k) all rows and all columns sum to zero.) The squared sample distance covariance (a scalar) is simply the arithmetic average of the products Aj, k Bj, k:

${\displaystyle \operatorname {dCov} _{n}^{2}(X,Y):={\frac {1}{n^{2}}}\sum _{j=1}^{n}\sum _{k=1}^{n}A_{j,k}\,B_{j,k}.}$

The statistic Tn = n dCov2n(X, Y) determines a consistent multivariate test of independence of random vectors in arbitrary dimensions. For an implementation see dcov.test function in the energy package for R.[4]

The population value of distance covariance can be defined along the same lines. Let X be a random variable that takes values in a p-dimensional Euclidean space with probability distribution μ and let Y be a random variable that takes values in a q-dimensional Euclidean space with probability distribution ν, and suppose that X and Y have finite expectations. Write

${\displaystyle a_{\mu }(x):=\operatorname {E} [\|X-x\|],\quad D(\mu ):=\operatorname {E} [a_{\mu }(X)],\quad d_{\mu }(x,x'):=\|x-x'\|-a_{\mu }(x)-a_{\mu }(x')+D(\mu ).}$

Finally, define the population value of squared distance covariance of X and Y as

${\displaystyle \operatorname {dCov} ^{2}(X,Y):=\operatorname {E} {\big [}d_{\mu }(X,X')d_{\nu }(Y,Y'){\big ]}.}$

One can show that this is equivalent to the following definition:

{\displaystyle {\begin{aligned}\operatorname {dCov} ^{2}(X,Y):={}&\operatorname {E} [\|X-X'\|\,\|Y-Y'\|]+\operatorname {E} [\|X-X'\|]\,\operatorname {E} [\|Y-Y'\|]\\&\qquad {}-\operatorname {E} [\|X-X'\|\,\|Y-Y''\|]-\operatorname {E} [\|X-X''\|\,\|Y-Y'\|]\\={}&\operatorname {E} [\|X-X'\|\,\|Y-Y'\|]+\operatorname {E} [\|X-X'\|]\,\operatorname {E} [\|Y-Y'\|]\\&\qquad {}-2\operatorname {E} [\|X-X'\|\,\|Y-Y''\|],\end{aligned}}}

where E denotes expected value, and ${\displaystyle \textstyle (X,Y),}$ ${\displaystyle \textstyle (X',Y'),}$ and ${\displaystyle \textstyle (X'',Y'')}$ are independent and identically distributed. The primed random variables ${\displaystyle \textstyle (X',Y')}$ and ${\displaystyle \textstyle (X'',Y'')}$ denote independent and identically distributed (iid) copies of the variables ${\displaystyle X}$ and ${\displaystyle Y}$ and are similarly iid.[5] Distance covariance can be expressed in terms of the classical Pearson's covariance, cov, as follows:

${\displaystyle \operatorname {dCov} ^{2}(X,Y)=\operatorname {cov} (\|X-X'\|,\|Y-Y'\|)-2\operatorname {cov} (\|X-X'\|,\|Y-Y''\|).}$

This identity shows that the distance covariance is not the same as the covariance of distances, cov(‖XX' ‖, ‖YY' ). This can be zero even if X and Y are not independent.

Alternatively, the distance covariance can be defined as the weighted L2 norm of the distance between the joint characteristic function of the random variables and the product of their marginal characteristic functions:[6]

${\displaystyle \operatorname {dCov} ^{2}(X,Y)={\frac {1}{c_{p}c_{q}}}\int _{\mathbb {R} ^{p+q}}{\frac {\left|\varphi _{X,Y}(s,t)-\varphi _{X}(s)\varphi _{Y}(t)\right|^{2}}{|s|_{p}^{1+p}|t|_{q}^{1+q}}}\,dt\,ds}$

where ${\displaystyle \varphi _{X,Y}(s,t)}$, ${\displaystyle \varphi _{X}(s)}$, and ${\displaystyle \varphi _{Y}(t)}$ are the characteristic functions of (X, Y), X, and Y, respectively, p, q denote the Euclidean dimension of X and Y, and thus of s and t, and cp, cq are constants. The weight function ${\displaystyle ({c_{p}c_{q}}{|s|_{p}^{1+p}|t|_{q}^{1+q}})^{-1}}$ is chosen to produce a scale equivariant and rotation invariant measure that doesn't go to zero for dependent variables.[6][7] One interpretation of the characteristic function definition is that the variables eisX and eitY are cyclic representations of X and Y with different periods given by s and t, and the expression ϕX, Y(s, t) − ϕX(s) ϕY(t) in the numerator of the characteristic function definition of distance covariance is simply the classical covariance of eisX and eitY. The characteristic function definition clearly shows that dCov2(X, Y) = 0 if and only if X and Y are independent.

### Distance variance and distance standard deviation

The distance variance is a special case of distance covariance when the two variables are identical. The population value of distance variance is the square root of

${\displaystyle \operatorname {dVar} ^{2}(X):=\operatorname {E} [\|X-X'\|^{2}]+\operatorname {E} ^{2}[\|X-X'\|]-2\operatorname {E} [\|X-X'\|\,\|X-X''\|],}$

where ${\displaystyle X}$, ${\displaystyle X'}$, and ${\displaystyle X''}$ are independent and identically distributed random variables, ${\displaystyle \operatorname {E} }$ denotes the expected value, and ${\displaystyle f^{2}(\cdot )=(f(\cdot ))^{2}}$ for function ${\displaystyle f(\cdot )}$, e.g., ${\displaystyle \operatorname {E} ^{2}[\cdot ]=(\operatorname {E} [\cdot ])^{2}}$.

The sample distance variance is the square root of

${\displaystyle \operatorname {dVar} _{n}^{2}(X):=\operatorname {dCov} _{n}^{2}(X,X)={\tfrac {1}{n^{2}}}\sum _{k,\ell }A_{k,\ell }^{2},}$

which is a relative of Corrado Gini's mean difference introduced in 1912 (but Gini did not work with centered distances).[8]

The distance standard deviation is the square root of the distance variance.

### Distance correlation

The distance correlation [2][3] of two random variables is obtained by dividing their distance covariance by the product of their distance standard deviations. The distance correlation is the square root of

${\displaystyle \operatorname {dCor} ^{2}(X,Y)={\frac {\operatorname {dCov} ^{2}(X,Y)}{\sqrt {\operatorname {dVar} ^{2}(X)\,\operatorname {dVar} ^{2}(Y)}}},}$

and the sample distance correlation is defined by substituting the sample distance covariance and distance variances for the population coefficients above.

For easy computation of sample distance correlation see the dcor function in the energy package for R.[4]

## Properties

### Distance correlation

1. ${\displaystyle 0\leq \operatorname {dCor} _{n}(X,Y)\leq 1}$ and ${\displaystyle 0\leq \operatorname {dCor} (X,Y)\leq 1}$; this is in contrast to Pearson's correlation, which can be negative.
2. ${\displaystyle \operatorname {dCor} (X,Y)=0}$ if and only if X and Y are independent.
3. ${\displaystyle \operatorname {dCor} _{n}(X,Y)=1}$ implies that dimensions of the linear subspaces spanned by X and Y samples respectively are almost surely equal and if we assume that these subspaces are equal, then in this subspace ${\displaystyle Y=A+b\,\mathbf {C} X}$ for some vector A, scalar b, and orthonormal matrix ${\displaystyle \mathbf {C} }$.

### Distance covariance

1. ${\displaystyle \operatorname {dCov} (X,Y)\geq 0}$ and ${\displaystyle \operatorname {dCov} _{n}(X,Y)\geq 0}$;
2. ${\displaystyle \operatorname {dCov} ^{2}(a_{1}+b_{1}\,\mathbf {C} _{1}\,X,a_{2}+b_{2}\,\mathbf {C} _{2}\,Y)=|b_{1}\,b_{2}|\operatorname {dCov} ^{2}(X,Y)}$ for all constant vectors ${\displaystyle a_{1},a_{2}}$, scalars ${\displaystyle b_{1},b_{2}}$, and orthonormal matrices ${\displaystyle \mathbf {C} _{1},\mathbf {C} _{2}}$.
3. If the random vectors ${\displaystyle (X_{1},Y_{1})}$ and ${\displaystyle (X_{2},Y_{2})}$ are independent then
${\displaystyle \operatorname {dCov} (X_{1}+X_{2},Y_{1}+Y_{2})\leq \operatorname {dCov} (X_{1},Y_{1})+\operatorname {dCov} (X_{2},Y_{2}).}$
Equality holds if and only if ${\displaystyle X_{1}}$ and ${\displaystyle Y_{1}}$ are both constants, or ${\displaystyle X_{2}}$ and ${\displaystyle Y_{2}}$ are both constants, or ${\displaystyle X_{1},X_{2},Y_{1},Y_{2}}$ are mutually independent.
4. ${\displaystyle \operatorname {dCov} (X,Y)=0}$ if and only if X and Y are independent.

This last property is the most important effect of working with centered distances.

The statistic ${\displaystyle \operatorname {dCov} _{n}^{2}(X,Y)}$ is a biased estimator of ${\displaystyle \operatorname {dCov} ^{2}(X,Y)}$. Under independence of X and Y [9]

{\displaystyle {\begin{aligned}\operatorname {E} [\operatorname {dCov} _{n}^{2}(X,Y)]&={\frac {n-1}{n^{2}}}\left\{(n-2)\operatorname {dCov} ^{2}(X,Y)+\operatorname {E} [\|X-X'\|]\,\operatorname {E} [\|Y-Y'\|]\right\}\\[6pt]&={\frac {n-1}{n^{2}}}\operatorname {E} [\|X-X'\|]\,\operatorname {E} [\|Y-Y'\|].\end{aligned}}}

An unbiased estimator of ${\displaystyle \operatorname {dCov} ^{2}(X,Y)}$ is given by Székely and Rizzo.[10]

### Distance variance

1. ${\displaystyle \operatorname {dVar} (X)=0}$ if and only if ${\displaystyle X=\operatorname {E} [X]}$ almost surely.
2. ${\displaystyle \operatorname {dVar} _{n}(X)=0}$ if and only if every sample observation is identical.
3. ${\displaystyle \operatorname {dVar} (A+b\,\mathbf {C} \,X)=|b|\operatorname {dVar} (X)}$ for all constant vectors A, scalars b, and orthonormal matrices ${\displaystyle \mathbf {C} }$.
4. If X and Y are independent then ${\displaystyle \operatorname {dVar} (X+Y)\leq \operatorname {dVar} (X)+\operatorname {dVar} (Y)}$.

Equality holds in (iv) if and only if one of the random variables X or Y is a constant.

## Generalization

Distance covariance can be generalized to include powers of Euclidean distance. Define

{\displaystyle {\begin{aligned}\operatorname {dCov} ^{2}(X,Y;\alpha ):={}&\operatorname {E} [\|X-X'\|^{\alpha }\,\|Y-Y'\|^{\alpha }]+\operatorname {E} [\|X-X'\|^{\alpha }]\,\operatorname {E} [\|Y-Y'\|^{\alpha }]\\&\qquad {}-2\operatorname {E} [\|X-X'\|^{\alpha }\,\|Y-Y''\|^{\alpha }].\end{aligned}}}

Then for every ${\displaystyle 0<\alpha <2}$, ${\displaystyle X}$ and ${\displaystyle Y}$ are independent if and only if ${\displaystyle \operatorname {dCov} ^{2}(X,Y;\alpha )=0}$. It is important to note that this characterization does not hold for exponent ${\displaystyle \alpha =2}$; in this case for bivariate ${\displaystyle (X,Y)}$, ${\displaystyle \operatorname {dCor} (X,Y;\alpha =2)}$ is a deterministic function of the Pearson correlation.[2] If ${\displaystyle a_{k,\ell }}$ and ${\displaystyle b_{k,\ell }}$ are ${\displaystyle \alpha }$ powers of the corresponding distances, ${\displaystyle 0<\alpha \leq 2}$, then ${\displaystyle \alpha }$ sample distance covariance can be defined as the nonnegative number for which

${\displaystyle \operatorname {dCov} _{n}^{2}(X,Y;\alpha ):={\frac {1}{n^{2}}}\sum _{k,\ell }A_{k,\ell }\,B_{k,\ell }.}$

One can extend ${\displaystyle \operatorname {dCov} }$ to metric-space-valued random variables ${\displaystyle X}$ and ${\displaystyle Y}$: If ${\displaystyle X}$ has law ${\displaystyle \mu }$ in a metric space with metric ${\displaystyle d}$, then define ${\displaystyle a_{\mu }(x):=\operatorname {E} [d(X,x)]}$, ${\displaystyle D(\mu ):=\operatorname {E} [a_{\mu }(X)]}$, and (provided ${\displaystyle a_{\mu }}$ is finite, i.e., ${\displaystyle X}$ has finite first moment), ${\displaystyle d_{\mu }(x,x'):=d(x,x')-a_{\mu }(x)-a_{\mu }(x')+D(\mu )}$. Then if ${\displaystyle Y}$ has law ${\displaystyle \nu }$ (in a possibly different metric space with finite first moment), define

${\displaystyle \operatorname {dCov} ^{2}(X,Y):=\operatorname {E} {\big [}d_{\mu }(X,X')d_{\nu }(Y,Y'){\big ]}.}$

This is non-negative for all such ${\displaystyle X,Y}$ iff both metric spaces have negative type.[11] Here, a metric space ${\displaystyle (M,d)}$ has negative type if ${\displaystyle (M,d^{1/2})}$ is isometric to a subset of a Hilbert space.[12] If both metric spaces have strong negative type, then ${\displaystyle \operatorname {dCov} ^{2}(X,Y)=0}$ iff ${\displaystyle X,Y}$ are independent.[11]

## Alternative definition of distance covariance

The original distance covariance has been defined as the square root of ${\displaystyle \operatorname {dCov} ^{2}(X,Y)}$, rather than the squared coefficient itself. ${\displaystyle \operatorname {dCov} (X,Y)}$ has the property that it is the energy distance between the joint distribution of ${\displaystyle \operatorname {X} ,Y}$ and the product of its marginals. Under this definition, however, the distance variance, rather than the distance standard deviation, is measured in the same units as the ${\displaystyle \operatorname {X} }$ distances.

Alternately, one could define distance covariance to be the square of the energy distance: ${\displaystyle \operatorname {dCov} ^{2}(X,Y).}$ In this case, the distance standard deviation of ${\displaystyle X}$ is measured in the same units as ${\displaystyle X}$ distance, and there exists an unbiased estimator for the population distance covariance.[10]

Under these alternate definitions, the distance correlation is also defined as the square ${\displaystyle \operatorname {dCor} ^{2}(X,Y)}$, rather than the square root.

## Alternative formulation: Brownian covariance

Brownian covariance is motivated by generalization of the notion of covariance to stochastic processes. The square of the covariance of random variables X and Y can be written in the following form:

${\displaystyle \operatorname {cov} (X,Y)^{2}=\operatorname {E} \left[{\big (}X-\operatorname {E} (X){\big )}{\big (}X^{\mathrm {'} }-\operatorname {E} (X^{\mathrm {'} }){\big )}{\big (}Y-\operatorname {E} (Y){\big )}{\big (}Y^{\mathrm {'} }-\operatorname {E} (Y^{\mathrm {'} }){\big )}\right]}$

where E denotes the expected value and the prime denotes independent and identically distributed copies. We need the following generalization of this formula. If U(s), V(t) are arbitrary random processes defined for all real s and t then define the U-centered version of X by

${\displaystyle X_{U}:=U(X)-\operatorname {E} _{X}\left[U(X)\mid \left\{U(t)\right\}\right]}$

whenever the subtracted conditional expected value exists and denote by YV the V-centered version of Y.[3][13][14] The (U,V) covariance of (X,Y) is defined as the nonnegative number whose square is

${\displaystyle \operatorname {cov} _{U,V}^{2}(X,Y):=\operatorname {E} \left[X_{U}X_{U}^{\mathrm {'} }Y_{V}Y_{V}^{\mathrm {'} }\right]}$

whenever the right-hand side is nonnegative and finite. The most important example is when U and V are two-sided independent Brownian motions /Wiener processes with expectation zero and covariance |s| + |t| − |st| = 2 min(s,t) (for nonnegative s, t only). (This is twice the covariance of the standard Wiener process; here the factor 2 simplifies the computations.) In this case the (U,V) covariance is called Brownian covariance and is denoted by

${\displaystyle \operatorname {cov} _{W}(X,Y).}$

There is a surprising coincidence: The Brownian covariance is the same as the distance covariance:

${\displaystyle \operatorname {cov} _{\mathrm {W} }(X,Y)=\operatorname {dCov} (X,Y),}$

and thus Brownian correlation is the same as distance correlation.

On the other hand, if we replace the Brownian motion with the deterministic identity function id then Covid(X,Y) is simply the absolute value of the classical Pearson covariance,

${\displaystyle \operatorname {cov} _{\mathrm {id} }(X,Y)=\left\vert \operatorname {cov} (X,Y)\right\vert .}$

## Related metrics

Other correlational metrics, including kernel-based correlational metrics (such as the Hilbert-Schmidt Independence Criterion or HSIC) can also detect linear and nonlinear interactions. Both distance correlation and kernel-based metrics can be used in methods such as canonical correlation analysis and independent component analysis to yield stronger statistical power.

## Notes

1. ^ Pearson 1895a, 1895b
2. ^ a b c
3. ^ a b c d
4. ^ a b
5. ^ Székely & Rizzo 2014, p. 11.
6. ^ a b Székely & Rizzo 2009a, p. 1249, Theorem 7, (3.7).
7. ^
8. ^
9. ^
10. ^ a b
11. ^ a b
12. ^ Klebanov 2005, p. [page needed].
13. ^
14. ^