Independent and identically distributed random variables
This article needs additional citations for verification. (December 2009) 
In probability theory and statistics, a collection of random variables is independent and identically distributed if each random variable has the same probability distribution as the others and all are mutually independent.^{[1]} This property is usually abbreviated as i.i.d. or iid or IID. Herein, i.i.d. is used, because it is the most prevalent.
Introduction[edit]
In statistics, it is commonly assumed that observations in a sample are effectively i.i.d. The assumption (or requirement) that observations be i.i.d. tends to simplify the underlying mathematics of many statistical methods (see mathematical statistics and statistical theory). In practical applications of statistical modeling, however, the assumption may or may not be realistic.^{[2]} To partially test how realistic the assumption is on a given data set, the correlation can be computed, lag plots drawn or turning point test performed.^{[3]} The generalization of exchangeable random variables is often sufficient and more easily met.
The i.i.d. assumption is important in the classical form of the central limit theorem, which states that the probability distribution of the sum (or average) of i.i.d. variables with finite variance approaches a normal distribution.
Often the i.i.d. assumption arises in the context of sequences of random variables. Then "independent and identically distributed" implies that an element in the sequence is independent of the random variables that came before it. In this way, an i.i.d. sequence is different from a Markov sequence, where the probability distribution for the nth random variable is a function of the previous random variable in the sequence (for a first order Markov sequence). An i.i.d. sequence does not imply the probabilities for all elements of the sample space or event space must be the same.^{[4]} For example, repeated throws of loaded dice will produce a sequence that is i.i.d., despite the outcomes being biased.
Definition[edit]
Definition for two random variables[edit]
Suppose that the random variables and are defined to assume values in . Let and be the cumulative distribution functions of and , respectively, and denote their joint cumulative distribution function by .
Two random variables and are identically distributed if and only if^{[5]} .
Two random variables and are independent if and only if . (See further Independence (probability theory) § Two random variables.)
Two random variables and are i.i.d. if they are independent and identically distributed, i.e. if and only if

(Eq.1) 
Definition for more than two random variables[edit]
The definition extends naturally to more than two random variables. We say that random variables are i.i.d. if they are independent (see further Independence (probability theory)#More than two random variables) and identically distributed, i.e. if and only if

(Eq.2) 
where denotes the joint cumulative distribution function of .
Definition for independent variables[edit]
In probability theory, mutual independence means that A ,B are two events, if the equation P(A ∩ B) =P(AB) =P(A)P(B) satisfied, then events A, B are mutually independent.
Suppose, there are the two events of the experiment A, B if P(A)>0, there is possibility P(BA) Generally, the occurrence of A has an effect on the probability of B, which is called conditional probability, and only when the occurrence of A has no effect on the occurrence of B , there is P(BA) =P(B).
Note: If P(A)>0, P(B)>0 then A, B are mutually independent which cannot be established with mutually incompatible at the same time, that is, independence must be compatible and mutual exclusion must be related.
Suppose A , B, C are three events. If P(AB) =P(A)P(B) , P(BC) =P(B)P(C), P(AC) =P(A)P(C) ,P(ABC) =P(A)P(B)P(C) are satisfied, then the events A, B, C are independent of each other.
A more general definition is there are n events, A1, A2,……..An. If the probabilities of the product events for any 2, 3, ..., n events are equal to the product of the probabilities of each event, then the events A1, A2, ……An are independent of each other.
Examples[edit]
The following are examples or applications of i.i.d. random variables:
 A sequence of outcomes of spins of a fair or unfair roulette wheel is i.i.d. One implication of this is that if the roulette ball lands on "red", for example, 20 times in a row, the next spin is no more or less likely to be "black" than on any other spin (see the Gambler's fallacy).
 A sequence of fair or loaded dice rolls is i.i.d.
 A sequence of fair or unfair coin flips is i.i.d.
 In signal processing and image processing the notion of transformation to i.i.d. implies two specifications, the "i.d." (i.d. = identically distributed) part and the "i." (i. = independent) part:
 (i.d.) the signal level must be balanced on the time axis;
 (i.) the signal spectrum must be flattened, i.e. transformed by filtering (such as deconvolution) to a white noise signal (i.e. a signal where all frequencies are equally present).
The following are examples of data sampling that do not satisfy the i.i.d. assumption:
 A medical dataset where multiple samples are taken from multiple patients, it is very likely that samples from same patients may be correlated.
 Samples drawn from time dependent processes, for example, yearwise census data.
Generalizations[edit]
Many results that were first proven under the assumption that the random variables are i.i.d. have been shown to be true even under a weaker distributional assumption.
Exchangeable random variables[edit]
The most general notion which shares the main properties of i.i.d. variables are exchangeable random variables, introduced by Bruno de Finetti.^{[citation needed]} Exchangeability means that while variables may not be independent, future ones behave like past ones – formally, any value of a finite sequence is as likely as any permutation of those values – the joint probability distribution is invariant under the symmetric group.
This provides a useful generalization – for example, sampling without replacement is not independent, but is exchangeable.
Lévy process[edit]
In stochastic calculus, i.i.d. variables are thought of as a discrete time Lévy process: each variable gives how much one changes from one time to another. For example, a sequence of Bernoulli trials is interpreted as the Bernoulli process. One may generalize this to include continuous time Lévy processes, and many Lévy processes can be seen as limits of i.i.d. variables—for instance, the Wiener process is the limit of the Bernoulli process.
In machine learning[edit]
In machine learning theory, i.i.d. assumption is often made for training datasets to imply that all samples stem from the same generative process and that the generative process is assumed to have no memory of past generated samples.
See also[edit]
References[edit]
Citations[edit]
 ^ Clauset, Aaron (2011). "A brief primer on probability distributions" (PDF). Santa Fe Institute.
 ^ Hampel, Frank (1998), "Is statistics too difficult?", Canadian Journal of Statistics, 26 (3): 497–513, doi:10.2307/3315772, hdl:20.500.11850/145503, JSTOR 3315772 (§8).
 ^ Le Boudec, JeanYves (2010). Performance Evaluation Of Computer And Communication Systems (PDF). EPFL Press. pp. 46–47. ISBN 9782940222407. Archived from the original (PDF) on 20131012. Retrieved 20130614.
 ^ Cover, T. M.; Thomas, J. A. (2006). Elements Of Information Theory. WileyInterscience. pp. 57–58. ISBN 9780471241959.
 ^ Casella & Berger 2002, Theorem 1.5.10
Sources[edit]
 Casella, George; Berger, Roger L. (2002), Statistical Inference, Duxbury Advanced Series