Probabilities and Statistics
76 flashcards · Mathematics · by Athena Papkouf
Given n distinct objects, the number of different permutations (without repetition) of length r ≤ n is
permutations of length n
n!
multinomial coefficient
binomial coefficient
The number of ways of choosing a set of r objects from a set of n distinct objects without repetition is
The number of ways of distributing n distinct objects into r distinct groups of size n1, . . . , nr, where n1 + · · · + nr = n, is
Pascal’s triangle
Vandermonde’s formula
A probability space (Ω, F,P) is a mathematical object associated with a random experiment, comprising:
a set Ω, the sample space (universe), which contains all the possible results (outcomes, elementary events) ω of the experiment; a collection F of subsets of Ω. These subsets are called events, and F is called the event space; a function P : F → [0, 1] called a probability distribution, which associates a probability P(A) ∈ [0, 1] to each A ∈ F
An event space F is a set of the subsets of Ω such that:
A probability distribution P assigns a probability to each element of the event space F, with the following properties:
(7 items)
P is called a continuous set function because
for all sequences of sets for which
Inclusion-exclusion formulae
number of terms in the general inclusion-exclusion formula
Let A, B be events of the probability space (Ω, F,P), such that P(B) > 0. Then the conditional probability of A given B is
If P(B) = 0, we adopt the convention P(A ∩ B) = P(A | B)P(B), so both sides are equal to zero.
Let (Ω, F,P) be a probability space, and let B ∈ F such that P(B) > 0 and Q(A) = P(A | B). Then (Ω, F, Q) is a probability space. In particular,
Law of total probability
Bayes theorem
Prediction decomposition
Let A1, . . . , An be events in a probability space. Then
Let (Ω, F,P) be a probability space. Two events A, B ∈ F are independent (we write A ⊥⊥ B) if
mutual independence
pairwise independence
conditional independence
Does mutual independence entail pairwise independence?
Mutual independence entails pairwise independence, but the converse is only true when n = 2
Does mutual independence imply conditional independence?
Mutual independence neither implies nor is implied by conditional independence.
random variable
Let (Ω, F,P) be a probability space. A random variable (rv) X : Ω → R is a function from the sample space Ω taking values in the real numbers R.
support of random variable/ discrete random variable
indicator variable/Bernoulli random variable/Bernoulli trial.
A random variable that takes only the values 0 and 1
probability mass function (PMF)
binomial random variable
geometric random variable
Lack of memory
Negative binomial distribution
Hypergeometric distribution
Discrete uniform distribution
Poisson distribution
Cumulative distribution function
Transformations of discrete random variables
Expectation (discrete)
Expected value of a function
variance
conditional probability mass function
Conditional expected value
probability density function
Uniform distribution
exponential random variable
expectation (continuous)
variance (continuous)
expectation of g(X)
Conditional densities
p quantile
General transformation
Normal distribution
standard normal
standard normalisation
(joint) probability mass function
(joint) cumulative distribution function
(joint) density
(joint) cumulative distribution function (continuous)
marginal probability mass/density function
conditional probability mass/density function
Jjoint cumulative distribution function (multivariate)
joint density/mass probability function
multinomial distribution of denominator m and probabilities (p1, . . . , pk)
Random variables X, Y defined on the same probability space are independent if
expectation of g(X, Y )
joint moments
joint central moments
covariance
Properties of covariance
correlation
This measures the linear dependence between X and Y
Let g(X, Y ) be a function of a random vector (X, Y ). Its conditional expectation given X = x is
Expectation and conditioning (multiple variables)