19
$\begingroup$

Let $X \sim \mathcal{N}(0, \Sigma)$ be a Gaussian vector in dimension $N$. I am interested by the probability density of the random variable $\lVert X \lVert_2$.

If $\Sigma = {I}_N$, we recognize the $\chi$-law. We especially know that the probability density is given by $$p(x) \propto x^{{N} -1} \mathrm{e}^{-\frac{x^2}{2}} 1_{x\geq 0} .$$

In the general case, we can decompose the matrix $\Sigma = P^t D P$ with $P$ orthogonal and $D=D(\lambda_1,\cdots,\lambda_N)$ diagonal and $\lVert X \lVert_2 \sim \lVert \mathcal{N} (0,D)\lVert_2$. What can we say about the probability density of $\lVert X \lVert_2$ in this general case?

Thanks by advance.

$\endgroup$

2 Answers 2

13
$\begingroup$

After you diagonalize the covariance matrix, you have $\|X\|^2=\sum_{k=1}^n X_i^2$, right? And $X_1^2,\ldots,X_n^2$ are independent $\chi(1)$-distributed r.v. (up to a scaling with $\frac{1}{\sqrt{\lambda_i}})$, i.e., they are gamma-distributed, but with different scale parameter. So you can apply the results of this paper:

P. G. Moschopoulos (1985) The distribution of the sum of independent gamma random variables, Annals of the Institute of Statistical Mathematics, 37, 541-544.

See also

A. M. Mathai (1982) Storage capacity of a dam with gamma type inputs, Annals of the Institute of Statistical Mathematics, 34, 591-597.

$\endgroup$
1
  • 1
    $\begingroup$ Effectively, the paper of Moschopoulos (and actually the other one too) gives a formula for the density of $\lVert X \lVert_2^2$ from what we can deduce another one for $\lVert X \lVert_2$. It is expressed as an infinite sum. Thanks a lot for these references. $\endgroup$
    – Goulifet
    Jan 30, 2014 at 15:20
2
$\begingroup$

It is a Wishart distribution.

Please see this answer for more information: Distribution of Squared Euclidean Norm of Gaussian Vector.

$\endgroup$
1
  • $\begingroup$ how can $\Vert X\Vert_2$, which is a real number, have a density from a Wishart distribution, which takes matrix valued input? $\endgroup$ Nov 15, 2023 at 18:56

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.