Take the 2-minute tour ×
Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. It's 100% free, no registration required.

Suppose X_1, ..., X_k are iid standard Gaussian variables, for some k > 1.

Then, what is the distribution of X := X_1 * ... * X_k ? Can it be approximated by a Gaussian, maybe for large k ?

share|improve this question
I am failing to see how this questions is related to theoretical computer science. If this is only statistics/probability you can ask on stats.stackexchange.com. –  M. Alaggan Aug 13 '11 at 23:59
I agree that this is off-topic here. But this page might be useful (covers some special cases): mathworld.wolfram.com/NormalProductDistribution.html –  Jukka Suomela Aug 14 '11 at 0:49
Polynomials of Gaussian random variables arise in theoretical CS often, especially in Fourier analysis of Boolean functions, inapproximability and so on. I'm asking here since I believe TCS researchers may have more "CS-friendly" answers to this question (e.g., involving approximations, quantitative bounds, etc). –  MCH Aug 14 '11 at 1:00
I agree, MCH. I don't understand the objections. –  arnab Aug 14 '11 at 3:04
@MCH: Perhaps you could edit the question to emphasise TCS connections and TCS aspects, to make it more obvious that it is on-topic here? And now that we have already some answers – and it seems that the general case is very complicated – perhaps you could also tell us more about the specific requirements of your application? –  Jukka Suomela Aug 14 '11 at 17:08
show 4 more comments

2 Answers

up vote 4 down vote accepted

When the $X_i$ are iid for some distribution with non-negative essential support (i.e., the probability of a negative value is zero) and the distribution of $\log(X)$ has a finite variance, then the Central Limit Theorem easily implies that $X^* = \log(X_1 \times \cdots \times X_k)$ approximately has a normal (Gaussian) distribution for sufficiently large $k$.

The problem here is that each $X_i$ has a 50% chance of being negative, precluding (easy) analysis with logarithms. Nevertheless, only two things can happen (almost surely, after neglecting the zero chance that any of the $X_i$ equals $0$): either an even number of the $X_i$ are negative, in which case the product is positive, or an odd number of the $X_i$ are negative, in which case the product is negative. Each case has a 50% chance of happening. Whence, the probability density of the product has two parts (symmetric to each other about 0) and each part looks like the product of draws from a half-normal distribution. A calculation shows that the log of a half-normal distribution has finite variance, allowing us to apply the preceding observation and conclude that for sufficiently large $k$, the distribution of $\log(X^*)$ conditional on $X^* \gt 0$ is approximately Gaussian and the distribution of $\log(-X^*)$ conditional on $X^* \lt 0$ is exactly the same. ($X^*$ is an equal mixture of variables $Y$ and $Z$ where $Y$ is approximately lognormal and $-Z$ has the same distribution as $Y$.)

In effect, the distribution of $X^*$ has two pieces: the positive piece is approximately lognormal and the negative piece is its reflection about 0. This makes it bimodal; all odd moments are $0$; and small even moments can be approximated from the Central Limit Theorem. In particular, the mean of the positive part of $\log(X^*)$ equals $-(\log(2) + \gamma)k/2$, approximately $-0.635181 k$, and its variance equals $\pi^2 k/8$, approximately $1.2337 k$.

Simulations indicate this approximation is good for $k \gt 100$, more or less. Considerable negative skewness in the distribution of $\log(|X^*|)$ is evident for smaller $k$.

Histogram for k=100

This (unnormalized) histogram documents 100,000 independent realizations of $\log(|X^*|)$ with $k=100$. Very slight negative skewness is still visible, but the general Gaussian shape is apparent, centered as expected around -63.5 with variance 123.3 (standard deviation 11.1).

It is evident from the wide range of highly negative logarithms that an attempt to plot the distribution of $X^*$ itself would be useless: it would show as a unit spike at 0. If we normalize it, though, a plot is informative. Specifically, consider the "signed geometric mean" $\text{Sign}(X^*)\exp(\log(|X^*|)/k)$:

Histogram of the signed geometric mean

This histogram displays the same data as the previous one, but normalized as signed geometric means. The shape on the right is a lognormal distribution; the shape on the left is its reflection about 0.

share|improve this answer
add comment

The distribution of the multiplication of independent Gaussians is not close to a Gaussian.

There are various ways to convince yourself in this. E.g., compute the expectation and the variance of the product from the expectation and the variance of the individual variables. This gives you a candidate Gaussian if there were a Gaussian approximation. Now, think of some simple properties of the product (e.g., the probability it is 0) and see if your candidate is good enough as an approximation.

share|improve this answer
Can whoever down-voted my answer please provide an explanation for why they did so? –  Dana Moshkovitz Aug 14 '11 at 1:49
Please explain before giving downvotes. I agree with Dana's comment, and am also puzzled why the answer would get a downvote. –  Suresh Venkat Aug 14 '11 at 5:13
@Suresh I am not the downvoter, but I did consider it. The reason I considered it is because I think the question if off-topic and from meta discussions like this I got the impression that we should discourage answering off-topic questions. –  Artem Kaznatcheev Aug 14 '11 at 7:51
My interpretation is that down-voting an answer is like flagging it false, misleading, irrelevant etc. If you don't want to encourage something don't up-vote it. –  Dana Moshkovitz Aug 14 '11 at 21:34
Or down-voting can mean “this should not have been posted.” People interpret the same thing differently, and you cannot tell others when to down-vote answers and when not to. –  Tsuyoshi Ito Aug 14 '11 at 22:38
show 10 more comments

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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