Papers
Topics
Authors
Recent
Search
2000 character limit reached

Prokhorov Metric Overview

Updated 23 January 2026
  • Prokhorov metric is a clear definition that metrizes weak convergence for Borel probability measures on complete separable metric spaces.
  • It employs coupling-based and set-enlargement formulations to establish links with total variation and Wasserstein distances.
  • Generalizations such as the Gromov–Hausdorff–Prokhorov and fuzzy metrics broaden its applications in stochastic processes and robust statistical methods.

The Prokhorov metric is a fundamental tool in probability theory, optimal transport, stochastic processes, and geometric analysis for comparing Borel probability measures on metric spaces. It metrizes the topology of weak convergence of probability measures on complete separable metric spaces (Polish spaces), underpins compactness results such as Prokhorov's theorem, and facilitates generalizations to measured metric spaces and their convergence topologies. Its coupling-based and set-enlargement formulations yield crucial links to other divergences, notably total variation and Wasserstein distances, with deep implications for both classical and modern probabilistic analysis.

1. Formal Definitions and Core Properties

Given a complete separable metric space (X,d)(X, d), write P(X)\mathcal P(X) for the space of Borel probability measures on XX. For AXA \subset X and ε>0\varepsilon > 0, define the ε\varepsilon-neighborhood

Aε={xX:d(x,A)<ε}.A^{\varepsilon} = \{ x \in X : d(x, A) < \varepsilon \}.

The Prokhorov metric π(μ,ν)\pi(\mu, \nu) on P(X)\mathcal P(X) is defined by

π(μ,ν)=inf{ε>0:A Borel, μ(A)ν(Aε)+ε and ν(A)μ(Aε)+ε}.\pi(\mu, \nu) = \inf\left\{ \varepsilon > 0 : \forall A~\text{Borel},~ \mu(A) \leq \nu(A^\varepsilon) + \varepsilon ~\text{and}~ \nu(A) \leq \mu(A^\varepsilon) + \varepsilon \right\}.

Equivalently, a coupling formulation holds: P(X)\mathcal P(X)0 coincides with the infimum of P(X)\mathcal P(X)1 such that there exists a coupling P(X)\mathcal P(X)2 of P(X)\mathcal P(X)3 with P(X)\mathcal P(X)4 (Aolaritei et al., 19 Feb 2025, Löhr, 2011).

Core properties include:

  • P(X)\mathcal P(X)5 is a metric on P(X)\mathcal P(X)6. P(X)\mathcal P(X)7 is complete and separable if P(X)\mathcal P(X)8 is Polish (Gehér et al., 2017, Abraham et al., 2012).
  • P(X)\mathcal P(X)9 metrizes weak convergence: for XX0 and XX1, XX2 if and only if XX3 (i.e., XX4 for every bounded continuous XX5).
  • For probability measures, XX6; and the diameter of XX7 is XX8 (Abraham et al., 2012).

2. Coupling Characterizations and Parametrizations

The Prokhorov metric admits a coupling ("transport") characterization directly analogous to Strassen's theorem. Let XX9 denote the set of couplings of AXA \subset X0 and AXA \subset X1 (i.e., probability measures on AXA \subset X2 with marginals AXA \subset X3). Then

AXA \subset X4

This extends naturally to finite (not necessarily probability) measures by allowing couplings with marginal discrepancies controlled in total variation, as in the generalized Strassen theorem (Khezeli, 2019):

AXA \subset X5

where AXA \subset X6 bounds the total variation distance between marginals and AXA \subset X7 is a Borel measure on AXA \subset X8.

Parametrized variants introduce a parameter AXA \subset X9 scaling the neighborhood radius in the definition:

ε>0\varepsilon > 00

with the classical case recovering ε>0\varepsilon > 01 (Berckmoes, 2016).

3. Connection to Weak Convergence, Tightness, and Compactness

Prokhorov's theorem asserts: A family ε>0\varepsilon > 02 is relatively compact in the weak topology if and only if it is uniformly tight, i.e., for every ε>0\varepsilon > 03 there exists a compact ε>0\varepsilon > 04 with ε>0\varepsilon > 05 (Berckmoes, 2016). The topology induced by ε>0\varepsilon > 06 corresponds exactly to weak convergence, and relative compactness criteria are characterized quantitatively via the Hausdorff measure of non-compactness as follows:

ε>0\varepsilon > 07

where ε>0\varepsilon > 08 expresses uniform tightness (Berckmoes, 2016).

The Prokhorov metric serves as the measure component of several extended metrics for measured metric spaces:

  • Gromov–Hausdorff–Prokhorov (GHP) Distance: For two compact measured metric spaces ε>0\varepsilon > 09,

ε\varepsilon0

where the infimum is over isometric embeddings into a common Polish space ε\varepsilon1 (Abraham et al., 2012).

  • Gromov–Prohorov (GP) Metric: For metric measure spaces ε\varepsilon2,

ε\varepsilon3

the infimum taken over isometric embeddings into a common metric space (Löhr, 2011).

These constructions yield measured metric spaces as Polish spaces, fundamental as state spaces for random geometric models (e.g., continuum random trees, random maps) (Abraham et al., 2012, Löhr, 2011, Khezeli, 2019).

5. Comparisons with Other Probability Metrics

The Prokhorov metric can be tightly related to other notions of distance between probability measures:

  • For total variation, ε\varepsilon4 (where ε\varepsilon5 denotes the Prokhorov or Lévy–Prokhorov metric) (Aolaritei et al., 19 Feb 2025);
  • For Wasserstein ε\varepsilon6, ε\varepsilon7 and, in the coupling-based formulation, ε\varepsilon8 interpolates between TV and ε\varepsilon9 (Aolaritei et al., 19 Feb 2025).

A two-parameter decomposition shows that an LP ball of radius Aε={xX:d(x,A)<ε}.A^{\varepsilon} = \{ x \in X : d(x, A) < \varepsilon \}.0 corresponds to first a Aε={xX:d(x,A)<ε}.A^{\varepsilon} = \{ x \in X : d(x, A) < \varepsilon \}.1 perturbation of up to Aε={xX:d(x,A)<ε}.A^{\varepsilon} = \{ x \in X : d(x, A) < \varepsilon \}.2, then a TV change of up to Aε={xX:d(x,A)<ε}.A^{\varepsilon} = \{ x \in X : d(x, A) < \varepsilon \}.3 (Aolaritei et al., 19 Feb 2025).

6. Generalizations: Discrete and Fuzzy Prokhorov Metrics

a. Discrete Prokhorov Metrics in Topological Data Analysis

In contexts such as persistence diagrams, discrete analogues of the Prokhorov distance quantify similarity not in terms of measure, but cardinality:

Aε={xX:d(x,A)<ε}.A^{\varepsilon} = \{ x \in X : d(x, A) < \varepsilon \}.4

with Aε={xX:d(x,A)<ε}.A^{\varepsilon} = \{ x \in X : d(x, A) < \varepsilon \}.5 measuring, over optimal matchings, the number of unmatched points exceeding Aε={xX:d(x,A)<ε}.A^{\varepsilon} = \{ x \in X : d(x, A) < \varepsilon \}.6 in displacement and Aε={xX:d(x,A)<ε}.A^{\varepsilon} = \{ x \in X : d(x, A) < \varepsilon \}.7 a nondecreasing admissible function. The bottleneck and Wasserstein distances are special cases (Dłotko et al., 2021).

b. Fuzzy Prokhorov Metric

Given a compact fuzzy metric space Aε={xX:d(x,A)<ε}.A^{\varepsilon} = \{ x \in X : d(x, A) < \varepsilon \}.8 with Łukasiewicz t-norm, the fuzzy Prokhorov metric Aε={xX:d(x,A)<ε}.A^{\varepsilon} = \{ x \in X : d(x, A) < \varepsilon \}.9 compares probability measures via

π(μ,ν)\pi(\mu, \nu)0

where π(μ,ν)\pi(\mu, \nu)1 is the union of fuzzy balls π(μ,ν)\pi(\mu, \nu)2 about π(μ,ν)\pi(\mu, \nu)3. This induces a fuzzy metric and metrizes weak* convergence (Repovš et al., 2011).

7. Isometry Characterization, Applications, and Implications

Surjective isometries for the Lévy–Prokhorov metric on π(μ,ν)\pi(\mu, \nu)4, with π(μ,ν)\pi(\mu, \nu)5 a separable Banach space, are characterized: for any surjective π(μ,ν)\pi(\mu, \nu)6-isometry π(μ,ν)\pi(\mu, \nu)7, there exists a surjective affine isometry π(μ,ν)\pi(\mu, \nu)8 such that π(μ,ν)\pi(\mu, \nu)9. This generalizes Molnár's result for real line distributions (Gehér et al., 2017). The class of measure-preserving isometries thereby encodes the intrinsic geometric structure of P(X)\mathcal P(X)0 under the Prokhorov metric, with significant consequences for both functional analysis and probability.

Further, Prokhorov metric balls define Prokhorov-tight families and underlie effective control of both random process convergence and construction of ambiguity sets for robust statistical procedures, such as conformal prediction under distribution shift, where the metric's interpolation between TV and Wasserstein admits precise control of local and global perturbations (Aolaritei et al., 19 Feb 2025). This enables robustification in both theory and algorithmic implementations for nuanced distributional changes beyond classical settings.


References:

  • (Gehér et al., 2017) Gehér–Titkos, "A characterisation of isometries with respect to the Lévy-Prokhorov metric"
  • (Abraham et al., 2012) "A note on Gromov-Hausdorff-Prokhorov distance between (locally) compact measure spaces"
  • (Berckmoes, 2016) "On the Hausdorff measure of non-compactness for the parametrized Prokhorov metric"
  • (Khezeli, 2019) "Metrization of the Gromov-Hausdorff (-Prokhorov) Topology for Boundedly-Compact Metric Spaces"
  • (Aolaritei et al., 19 Feb 2025) "Conformal Prediction under Levy-Prokhorov Distribution Shifts: Robustness to Local and Global Perturbations"
  • (Dłotko et al., 2021) "Bottleneck Profiles and Discrete Prokhorov Metrics for Persistence Diagrams"
  • (Repovš et al., 2011) "Fuzzy Prokhorov metric on the set of probability measures"
  • (Löhr, 2011) "Equivalence of Gromov-Prohorov- and Gromov's Box-Metric on the Space of Metric Measure Spaces"

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Prokhorov Metric.