In statistics, an empirical distribution function (commonly also called an empirical Cumulative Distribution Function, eCDF) is the distribution function associated with the empirical measure of a sample. This cumulative distribution function is a step function that jumps up by 1/n at each of the n data points. Its value at any specified value of the measured variable is the fraction of observations of the measured variable that are less than or equal to the specified value.
The empirical distribution function is an estimate of the cumulative distribution function that generated the points in the sample. It converges with probability 1 to that underlying distribution, according to the Glivenko–Cantelli theorem. A number of results exist to quantify the rate of convergence of the empirical distribution function to the underlying cumulative distribution function.
Let (X1, …, Xn) be independent, identically distributed real random variables with the common cumulative distribution function F(t). Then the empirical distribution function is defined as
where is the indicator of event A. For a fixed t, the indicator is a Bernoulli random variable with parameter p = F(t); hence is a binomial random variable with mean nF(t) and variance nF(t)(1 − F(t)). This implies that is an unbiased estimator for F(t).
However, in some textbooks, the definition is given as 
The mean of the empirical distribution is an unbiased estimator of the mean of the population distribution.
which is more commonly denoted
The variance of the empirical distribution times is an unbiased estimator of the variance of the population distribution.
The mean squared error for the empirical distribution is as follows.
Where is an estimator and an unknown parameter
For any real number the notation (read “ceiling of a”) denotes the least integer greater than or equal to . For any real number a, the notation (read “floor of a”) denotes the greatest integer less than or equal to .
If is not an integer, then the -th quantile is unique and is equal to
If is an integer, then the -th quantile is not unique and is any real number such that
If is odd, then the empirical median is the number
If is even, then the empirical median is the number
Since the ratio (n + 1)/n approaches 1 as n goes to infinity, the asymptotic properties of the two definitions that are given above are the same.
By the strong law of large numbers, the estimator converges to F(t) as n → ∞ almost surely, for every value of t:
thus the estimator is consistent. This expression asserts the pointwise convergence of the empirical distribution function to the true cumulative distribution function. There is a stronger result, called the Glivenko–Cantelli theorem, which states that the convergence in fact happens uniformly over t:
The sup-norm in this expression is called the Kolmogorov–Smirnov statistic for testing the goodness-of-fit between the empirical distribution and the assumed true cumulative distribution function F. Other norm functions may be reasonably used here instead of the sup-norm. For example, the L2-norm gives rise to the Cramér–von Mises statistic.
The asymptotic distribution can be further characterized in several different ways. First, the central limit theorem states that pointwise, has asymptotically normal distribution with the standard rate of convergence:
This result is extended by the Donsker’s theorem, which asserts that the empirical process , viewed as a function indexed by , converges in distribution in the Skorokhod space to the mean-zero Gaussian process , where B is the standard Brownian bridge. The covariance structure of this Gaussian process is
The uniform rate of convergence in Donsker’s theorem can be quantified by the result known as the Hungarian embedding:
Alternatively, the rate of convergence of can also be quantified in terms of the asymptotic behavior of the sup-norm of this expression. Number of results exist in this venue, for example the Dvoretzky–Kiefer–Wolfowitz inequality provides bound on the tail probabilities of :
In fact, Kolmogorov has shown that if the cumulative distribution function F is continuous, then the expression converges in distribution to , which has the Kolmogorov distribution that does not depend on the form of F.
Another result, which follows from the law of the iterated logarithm, is that 
As per Dvoretzky–Kiefer–Wolfowitz inequality the interval that contains the true CDF, , with probability is specified as
As per the above bounds, we can plot the Empirical CDF, CDF and Confidence intervals for different distributions by using any one of the Statistical implementations. Following is the syntax from Statsmodel for plotting empirical distribution.
""" Empirical CDF Functions """ import numpy as np from scipy.interpolate import interp1d def _conf_set(F, alpha=0.05): nobs = len(F) epsilon = np.sqrt(np.log(2.0 / alpha) / (2 * nobs)) lower = np.clip(F - epsilon, 0, 1) upper = np.clip(F + epsilon, 0, 1) return lower, upper class StepFunction: def __init__(self, x, y, ival=0.0, sorted=False, side="left"): if side.lower() not in ["right", "left"]: msg = "side can take the values 'right' or 'left'" raise ValueError(msg) self.side = side _x = np.asarray(x) _y = np.asarray(y) if _x.shape != _y.shape: msg = "x and y do not have the same shape" raise ValueError(msg) if len(_x.shape) != 1: msg = "x and y must be 1-dimensional" raise ValueError(msg) self.x = np.r_[-np.inf, _x] self.y = np.r_[ival, _y] if not sorted: asort = np.argsort(self.x) self.x = np.take(self.x, asort, 0) self.y = np.take(self.y, asort, 0) self.n = self.x.shape def __call__(self, time): tind = np.searchsorted(self.x, time, self.side) - 1 return self.y[tind] class ECDF(StepFunction): def __init__(self, x, side="right"): x = np.array(x, copy=True) x.sort() nobs = len(x) y = np.linspace(1.0 / nobs, 1, nobs) super(ECDF, self).__init__(x, y, side=side, sorted=True) def monotone_fn_inverter(fn, x, vectorized=True, **keywords): x = np.asarray(x) if vectorized: y = fn(x, **keywords) else: y =  for _x in x: y.append(fn(_x, **keywords)) y = np.array(y) a = np.argsort(y) return interp1d(y[a], x[a]) if __name__ == "__main__": # TODO: Make sure everything is correctly aligned and make a plotting # function from urllib.request import urlopen import matplotlib.pyplot as plt nerve_data = urlopen("http://www.statsci.org/data/general/nerve.txt") nerve_data = np.loadtxt(nerve_data) x = nerve_data / 50.0 # Was in 1/50 seconds cdf = ECDF(x) x.sort() F = cdf(x) plt.step(x, F, where="post") lower, upper = _conf_set(F) plt.step(x, lower, "r", where="post") plt.step(x, upper, "r", where="post") plt.xlim(0, 1.5) plt.ylim(0, 1.05) plt.vlines(x, 0, 0.05) plt.show()
A non-exhaustive list of software implementations of Empirical Distribution function includes: