Probability vector
Stochastic vector redirects here. For the concept of a random vector, see Multivariate random variable.
| This article does not cite any references or sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (December 2009) |
In mathematics and statistics, a probability vector or stochastic vector is a vector with non-negative entries that add up to one.
The positions (indices) of a probability vector represent the possible outcomes of a discrete random variable, and the vector gives us the probability mass function of that random variable, which is the standard way of characterizing a discrete probability distribution.
Here are some examples of probability vectors:

Writing out the vector components of a vector p as
the vector components must sum to one:
One also has the requirement that each individual component must have a probability between zero and one:
for all i. These two requirements show that stochastic vectors have a geometric interpretation: A stochastic vector is a point on the "far face" of a standard orthogonal simplex. That is, a stochastic vector uniquely identifies a point on the face opposite of the orthogonal corner of the standard simplex.
[edit] Some Properties of n dimensional Probability Vectors
- Probability vectors of dimension n are contained within an n − 1 dimensional unit hyperplane.
- The mean of a probability vector is 1 / n.
- The shortest probability vector has the value 1 / n as each component of the vector, and has a length of
. - The longest probability vector has the value 1 in a single component and 0 in all others, and has a length of 1.
- The shortest vector corresponds to maximum uncertainty, the longest to maximum certainty.
- No two probability vectors in the n dimensional unit hypersphere are collinear unless they are identical.
- The length of a probability vector is equal to
; where σ2 is the variance of the elements of the probability vector.



.
; where