---
title: Empirical Distribution Functions (EDFs)
url: https://www.emergentmind.com/topics/empirical-distribution-functions-edfs
type: topic
---

# Empirical Distribution Functions (EDFs)

An empirical distribution function (EDF) is a nonparametric estimator of the cumulative distribution function (CDF) of a population based on sampled data. Formally, for a sample \(X_1,\dots,X_n\) from an unknown distribution \(F\), the EDF is defined by
\[
F_n(x) = \frac{1}{n}\sum_{i=1}^n \mathbf{1}\{X_i \le x\},
\]
where \(\mathbf{1}\{\cdot\}\) is the indicator function. EDFs are foundational in nonparametric inference, providing unbiased estimators of \(F\) with well-understood convergence and limiting properties. They serve as the basis for classical goodness-of-fit testing, resampling techniques, quantile estimation, empirical process theory, and the analysis of complex sampling designs and dependent data.

## 1. Classical Results: Law of Large Numbers and Limiting Theory

The central result governing the EDF is the Glivenko–Cantelli theorem, which states that for i.i.d. \(X_i \sim F\),
\[
\sup_{x \in \mathbb{R}} |F_n(x) - F(x)| \xrightarrow{a.s.} 0 \quad \text{as } n \to \infty.
\]
This uniform law of large numbers underpins the strong consistency of the EDF as an estimator of \(F\) [2502.20206], [1301.0726]. Finite-sample deviation bounds are given by the Dvoretzky–Kiefer–Wolfowitz (DKW) inequality:
\[
\Pr\left(\sup_x |F_n(x) - F(x)| > \varepsilon \right) \le 2e^{-2n\varepsilon^2}
\]
and the corresponding uniform \(1 - \delta\) confidence band
\[
\sup_x |F_n(x) - F(x)| \le \sqrt{\frac{\ln(2/\delta)}{2n}} \quad \text{with probability at least } 1 - \delta.
\]
The functional central limit theorem (Donsker's theorem) asserts that \(\sqrt{n}(F_n - F)\) converges in distribution (in \(\ell^\infty(\mathbb{R})\)) to a mean-zero Gaussian process with covariance kernel \(\mathrm{Cov}(B_F(x), B_F(y)) = F(x \wedge y) - F(x)F(y)\), characterizing the limiting empirical process [2108.08512].

## 2. Extensions to Dependent Data: Mixing and Functional Dependence

When data exhibit dependence, EDFs retain strong law and CLT properties under suitable mixing conditions. For strictly stationary, \(\alpha\)-mixing or \(\beta\)-mixing sequences with summable mixing coefficients,
\[
\sum_{k=1}^{\infty} \alpha(k) < \infty \implies \sup_x |F_n(x) - F(x)| \xrightarrow{a.s.} 0,
\]
and analogous results hold for \(\beta\)-mixing. Convergence rates and uniform limit laws depend on the decay rate of mixing [2502.20206], [1301.0726].

Functional dependence, captured via the Wu–Shen or Berbee coupling constructions, allows even broader applicability. For a stationary or locally stationary process, a functional CLT holds for the EDF under polynomial decay of functional dependence measures. The empirical process limit has covariance incorporating both marginal and serial dependencies:
\[
\mathrm{Cov}(G(x), G(y)) = \sum_{k \in \mathbb{Z}} \mathrm{Cov}(1_{\{X_0 \le x\}}, 1_{\{X_k \le y\}})
\]
[2108.08512].

For high-dimensional vector-valued data, as in the Gaussian setting with general covariance matrix \(\Gamma^{(m)}\), the behavior of the EDF of vector components is governed by an average off-diagonal covariance parameter \(\gamma_m\):
\[
\gamma_m = m^{-2} \sum_{i \ne j} \Gamma^{(m)}_{i,j}
\]
Under “vanishing second order” assumptions, both LLN and CLT results extend, with the limit depending only on \(\gamma_m\) [1210.2489].

## 3. EDFs under Complex and Ranked Set Sampling Designs

In settings where direct measurement is costly and auxiliary information is available, design-based EDF estimators are constructed using ranked set sampling (RSS). McIntyre's RSS and its finite-population generalizations (level-0, level-1, level-2) yield EDFs with complex inclusion probabilities \(\pi_i^{(t)}\) and variance expressions:
\[
\hat{F}_n^{(t)}(x) = \sum_{i \in \mathcal{D}_t} w^{(t)}_i\,\mathbf{1}\{X_i \le x\},\quad w^{(t)}_i = \frac{1/\pi_i^{(t)}}{\sum_j 1/\pi_j^{(t)}}
\]
Explicit formulas for \(\pi_i^{(t)}\), \(\pi_{ij}^{(t)}\) are derived for each design [2205.10522]. The resulting design-based EDF is unbiased or approximately unbiased for the finite-population distribution function.

Efficiency analyses using asymptotic relative efficiency (ARE) show that level-2 RSS-based EDFs dominate both simple random sampling (SRS) and other RSS designs in terms of variance reduction, especially with perfect or high-quality ranking. This structure allows practitioners to estimate distributional quantities and quantiles (e.g., medians) with improved precision in finite populations, provided auxiliary ranking variables have sufficient correlation (\(\rho \gtrsim 0.75\)) [2205.10522].

## 4. EDFs in Sequential Testing, Time Series, and Multivariate Settings

EDFs are central to nonparametric sequential change-point detection in both univariate and multivariate time series. For a sequence \(\bm{X}_1, \ldots, \bm{X}_n\), the moving-window EDFs:
\[
F_{j:k}(\bm{x}) = \frac{1}{k - j + 1} \sum_{i = j}^k \mathbf{1}\{\bm{X}_i \le \bm{x}\}
\]
enable the construction of monitoring statistics sensitive to distributional changes (CUSUM-type, Cramér–von Mises-type, Anderson–Darling-type). Under strong mixing, these detectors have known limits, and thresholds can be calibrated via the dependent multiplier bootstrap [2004.12322], [2201.10311].

In open-end and closed-end monitoring designs, the key innovation is the use of covariance-estimated Mahalanobis norms over finite grids, which retains sensitivity to all types of distributional changes—location, scale, tail, or dependence structure—regardless of coordinate labeling or dimension [2201.10311].

## 5. EDFs in Nonparametric and Goodness-of-Fit Inference

Classical goodness-of-fit tests—Kolmogorov–Smirnov, Cramér–von Mises, Anderson–Darling, and their multivariate extensions—are based directly on functionals of the EDF, or on the difference between the EDF and a parametric (or null) CDF [2106.07437]. In the two-sample setting, tests compare two EDFs, e.g.,
\[
KS = \sup_x |\hat{F}_A(x) - \hat{F}_B(x)|,\quad AD = \sum_x \frac{|\hat{F}_A(x) - \hat{F}_B(x)|}{\hat{D}(x)(1-\hat{D}(x))}
\]
where \(\hat{D}(x)\) is the pooled EDF. Recent developments integrate variance-stabilizing weights and L1/Wasserstein-distance concepts to provide uniformly strong power in both classical (e.g., mean and variance shift) and challenging mixture/shape-change alternatives [2007.01360].

EDF-based tests exhibit well-understood local and asymptotic Bahadur efficiencies, with integral-type statistics (Cramér–von Mises, Anderson–Darling) outperforming supremum-type statistics (Kolmogorov–Smirnov) for normality testing in composite settings. Anderson–Darling generally offers the highest local efficiency [2106.07437].

## 6. Extensions: Goodness-of-Fit for Latent Processes and High-Frequency Data

In high-frequency financial econometrics and stochastic process inference, EDFs are employed to estimate time-occupation and marginal CDFs of latent processes such as spot volatility. The realized EDF (REDF) is constructed from bias-corrected local estimators of volatility, e.g.,
\[
F_{n,T}(x) = \frac{1}{T}\int_0^T \mathbf{1}\{\hat{V}_t \le x\} dt
\]
where \(\hat{V}_t\) is a pre-averaged, noise-robust estimator of instantaneous variance. Uniform consistency and functional CLTs for the REDF are established under microstructure noise and stochastic volatility/jump regimes [2601.20469]. This enables the construction of realized goodness-of-fit tests for volatility models, with critical values obtained via parametric bootstrap due to dependence in the limiting Gaussian process.

Simulation and empirical results confirm that the REDF-based procedure accurately recovers the true CDF of latent variance and enables powerful, well-sized testing for model fit in realistic high-frequency data settings [2601.20469].

## 7. Differential Privacy, Applications, and Modern Directions

The release of entire EDFs under strong privacy constraints is addressed via differentially private mechanisms. DP-EDFs are constructed using dyadic tree-based Laplace mechanisms or function secret sharing to achieve \((\varepsilon,\delta)\)-differential privacy. For query points \(\tau = (\tau_1, ..., \tau_N)\), the DP-ECDF is
\[
\tilde{F}_n(\tau_i) = F_n(\tau_i) + \sum_{\ell=0}^L \eta_{j,\ell}
\]
where Laplace noise \(\eta\) is added along root-to-leaf paths in the query tree. The expected squared error per query scales as \(2(L+1)^3 / (n^2 \varepsilon^2)\) [2502.06651].

Applications include private release of ROC curves and calibration statistics (e.g., Hosmer–Lemeshow), with empirical studies demonstrating the effectiveness of post-processing techniques (such as isotonic regression) in reducing DP error without inflating privacy loss. Modern EDF methodology thus extends into machine learning, robust inference, and federated or distributed frameworks with strong privacy and communication guarantees.

---

**References**:  
[2205.10522] "Design-based estimators of distribution function in ranked set sampling with an application"  
[2502.20206] "On the Glivenko-Cantelli theorem for real-valued empirical functions of stationary $α$-mixing and $β$-mixing sequences"  
[2108.08512] "Empirical process theory for nonsmooth functions under functional dependence"  
[1210.2489] "On empirical distribution function of high-dimensional Gaussian vector components with an application to multiple testing"  
[2601.20469] "The realized empirical distribution function of stochastic variance with application to goodness-of-fit testing"  
[2201.10311] "Multi-purpose open-end monitoring procedures for multivariate observations based on the empirical distribution function"  
[2004.12322] "Nonparametric sequential change-point detection for multivariate time series based on empirical distribution functions"  
[2106.07437] "Bahadur efficiency of EDF based normality tests when parameters are estimated"  
[2007.01360] "A New ECDF Two-Sample Test Statistic"  
[2502.06651] "Differentially Private Empirical Cumulative Distribution Functions"  
[1301.0726] "Marcinkiewicz-Zygmund and ordinary strong laws for empirical distribution functions and plug-in estimators"

Source: https://www.emergentmind.com/topics/empirical-distribution-functions-edfs