Indecomposable distribution

From Wikipedia, the free encyclopedia

In probability theory, an indecomposable distribution is any probability distribution that cannot be represented as the distribution of the sum of two or more non-constant independent random variables.

X = \left\{ \begin{matrix} 1 & \mathrm{with}\ \mathrm{probability} & p, \\ 0 & \mathrm{with}\ \mathrm{probability} & 1-p, \end{matrix} \right.
then the probability distribution of X is indecomposable.
  • Suppose a + b + c = 1, a, b, c ≥ 0, and
X = \left\{\begin{matrix} 2 & \mathrm{with}\ \mathrm{probability}\ a, \\ 1 & \mathrm{with}\ \mathrm{probability}\ b, \\ 0 & \mathrm{with}\ \mathrm{probability}\ c. \end{matrix} \right.
This probability distribution is decomposable if
\sqrt{a} + \sqrt{c} \le 1 \
and otherwise indecomposable. To see, this, suppose U and V are independent random variables and U + V has this probability distribution. Then we must have
\begin{matrix} U = \left\{ \begin{matrix} 1 & \mathrm{with}\ \mathrm{probability} & p, \\ 0 & \mathrm{with}\ \mathrm{probability} & 1 - p, \end{matrix} \right. & \mbox{and} & V = \left\{ \begin{matrix} 1 & \mathrm{with}\ \mathrm{probability} & q, \\ 0 & \mathrm{with}\ \mathrm{probability} & 1 - q, \end{matrix} \right. \end{matrix}
for some p, q ∈ [0, 1]. It follows that
a = pq, \,
c = (1-p)(1-q), \,
b = 1 - a - c. \,
This system of two quadratic equations in two variables p and q has a solution (pq) ∈ [0, 1]2 if and only if
\sqrt{a} + \sqrt{c} \le 1. \
Thus, for example, the discrete uniform distribution on the set {0, 1, 2} is indecomposable, but the binomial distribution assigning respective probabilities 1/4, 1/2, 1/4 is decomposable.
f(x) = {1 \over \sqrt{2\pi\,}} x^2 e^{-x^2/2}
is indecomposable.
  • The uniform distribution on the interval [0, 1] is decomposable, since it is the probability distribution of the random variable
\sum_{n=1}^\infty {X_n \over 2^n },
where the independent random variables Xn are each equal to 0 or 1 with equal probabilities.
\Pr(Y = y) = (1-p)^n p\,
on {0, 1, 2, ...}. For any positive integer k, there is a sequence of negative-binomially distributed random variables Yj, j = 1, ..., k, such that Y1 + ... + Yk has this geometric distibution. Therefore, this distribution is infinitely divisible. But now let Dn be the nth binary digit of Y, for n ≥ 0. Then the Ds are independent and
Y = \sum_{n=1}^\infty {D_n \over 2^n},
and each term in this sum is indecomposable.

  • Lukacs, Eugene, Characteristic Functions, New York, Hafner Publishing Company, 1970.
Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.