Discrete Probability Distribution Article Index for
Discrete 		Shopping
Probability 		Website Links For
Discrete 		 

Information About

Discrete Probability Distribution
  CATEGORIES ABOUT DISCRETE PROBABILITY DISTRIBUTION
   
probability theory
   
APPAREL
BABY
BEAUTY
BOOKS
CAR TOYS
CELL PHONES
DVD'S
ELECTRONICS
GOURMET FOOD
GROCERIES
HEALTH & PERSONAL
HOME & GARDEN
JEWELRY
MUSIC
MUSIC INSTRUMENTS
OFFICE PRODUCTS
SOFTWARE
SPORTING GOODS
TOOLS & HARDWARE
TOYS
VIDEO GAMES
SHOPPING HOME
MORE SHOPPING...



:\sum_u \Pr(X=u) = 1\qquad\qquad\qquad(1)

as ''u'' runs through the set of all possible values of ''X''.

If a random variable is discrete, then the Set of all values that it can assume with nonzero probability is Finite or Countably Infinite , because the sum of uncountably many positive Real Number s (which is the smallest upper bound of the set of all finite partial sums) always diverges to infinity.

In the cases most often considered, this set of possible values is a topologically discrete set in the sense that all its points are Isolated Point s. But there are discrete random variables for which this countable set is Dense on the real line.

The Poisson Distribution , the Bernoulli Distribution , the Binomial Distribution , the Geometric Distribution , and the Negative Binomial Distribution are among the most well-known discrete probability distributions.


ALTERNATIVE DESCRIPTION


Equivalently to the above, a discrete random variable can be defined as a random variable whose Cumulative Distribution Function (cdf) increases only by Jump Discontinuities — that is, its cdf increases only where it "jumps" to a higher value, and is constant between those jumps. The points where jumps occur are precisely the values which the random variable may take. The number of such jumps may be finite or Countably Infinite . The set of locations of such jumps need not be topologically discrete; for example, the cdf might jump at each Rational Number .


REPRESENTATION IN TERMS OF INDICATOR FUNCTIONS

For a discrete random variable ''X'', let ''u''0, ''u''1, ... be the values it can assume with non-zero probability. Denote

:\Omega_i=\{\omega: X(\omega)=u_i\},\, i=0, 1, 2, \dots

These are disjoint sets, and by formula (1)

:\Pr\left(\bigcup_i \Omega_i ight)=\sum_i \Pr(\Omega_i)=\sum_i\Pr(X=u_i)=1.

It follows that the probability that ''X'' assumes any value except for ''u''0, ''u''1, ... is zero, and thus one can write ''X'' as

:X=\sum_i \alpha_i 1_{\Omega_i}

except on a set of probability zero, where \alpha_i=\Pr(X=u_i) and 1_A is the Indicator Function of ''A''. This may serve as an alternative definition of discrete random variables.