Kolmogorov distance
E174592
Kolmogorov distance is a statistical metric that measures the maximum difference between two cumulative distribution functions, commonly used to quantify convergence in distribution and in goodness-of-fit tests.
All labels observed (5)
| Label | Occurrences |
|---|---|
| Kolmogorov–Smirnov test | 3 |
| Kolmogorov distance canonical | 1 |
| Kolmogorov metric | 1 |
| Kolmogorov–Smirnov metric | 1 |
| Kolmogorov–Smirnov statistic | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T1535776 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Kolmogorov distance Context triple: [Berry–Esseen theorem, typicalMetric, Kolmogorov distance]
-
A.
Kullback–Leibler divergence
Kullback–Leibler divergence is a fundamental information-theoretic measure that quantifies how one probability distribution differs from a reference distribution.
-
B.
Berry–Esseen theorem
The Berry–Esseen theorem is a quantitative refinement of the central limit theorem that provides explicit bounds on the rate of convergence of normalized sums of independent random variables to the normal distribution.
-
C.
Rényi divergence
Rényi divergence is a family of information-theoretic measures that generalize Kullback–Leibler divergence to quantify the dissimilarity between probability distributions, parameterized by an order α.
-
D.
Cameron–Martin theorem
The Cameron–Martin theorem is a fundamental result in probability theory and functional analysis that characterizes how Gaussian measures on infinite-dimensional spaces change under shifts by elements of a special Hilbert subspace (the Cameron–Martin space).
-
E.
Rényi entropy
Rényi entropy is a generalized measure of information and uncertainty that extends Shannon entropy by introducing a tunable order parameter to emphasize different aspects of a probability distribution.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Kolmogorov distance Target entity description: Kolmogorov distance is a statistical metric that measures the maximum difference between two cumulative distribution functions, commonly used to quantify convergence in distribution and in goodness-of-fit tests.
-
A.
Kullback–Leibler divergence
Kullback–Leibler divergence is a fundamental information-theoretic measure that quantifies how one probability distribution differs from a reference distribution.
-
B.
Berry–Esseen theorem
The Berry–Esseen theorem is a quantitative refinement of the central limit theorem that provides explicit bounds on the rate of convergence of normalized sums of independent random variables to the normal distribution.
-
C.
Rényi divergence
Rényi divergence is a family of information-theoretic measures that generalize Kullback–Leibler divergence to quantify the dissimilarity between probability distributions, parameterized by an order α.
-
D.
Cameron–Martin theorem
The Cameron–Martin theorem is a fundamental result in probability theory and functional analysis that characterizes how Gaussian measures on infinite-dimensional spaces change under shifts by elements of a special Hilbert subspace (the Cameron–Martin space).
-
E.
Rényi entropy
Rényi entropy is a generalized measure of information and uncertainty that extends Shannon entropy by introducing a tunable order parameter to emphasize different aspects of a probability distribution.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
metric on probability distributions
ⓘ
probability metric ⓘ statistical distance ⓘ |
| alsoKnownAs |
Kolmogorov distance
ⓘ
surface form:
Kolmogorov metric
Kolmogorov–Smirnov distance ⓘ Kolmogorov distance ⓘ
surface form:
Kolmogorov–Smirnov metric
|
| appliesTo |
empirical distribution functions
ⓘ
theoretical distribution functions ⓘ |
| assumes | distributions defined on a common measurable space ⓘ |
| belongsTo |
nonparametric goodness-of-fit methodology
ⓘ
theory of weak convergence of probability measures ⓘ |
| category | distance between probability distributions ⓘ |
| comparedWith |
Lévy–Prokhorov metric
ⓘ
Wasserstein distance ⓘ total variation distance ⓘ |
| definedOn |
cumulative distribution functions
ⓘ
probability distributions on the real line ⓘ |
| domainRestriction | distributions with cumulative distribution functions ⓘ |
| expressedAs | supremum over all real x of |F(x) − G(x)| ⓘ |
| invariantUnder | monotone transformations of the underlying variable that preserve order ⓘ |
| lessSensitiveTo | local deviations in tails compared to some other metrics ⓘ |
| mathematicalForm | d_K(F,G) = sup_x |F(x) − G(x)| ⓘ |
| measures | maximum difference between two cumulative distribution functions ⓘ |
| metricProperty |
identity of indiscernibles
ⓘ
non-negativity ⓘ symmetry ⓘ triangle inequality ⓘ |
| namedAfter |
Andrei Kolmogorov
ⓘ
surface form:
Andrey Kolmogorov
|
| relatedTo |
Kolmogorov distance
self-linksurface differs
ⓘ
surface form:
Kolmogorov–Smirnov statistic
Kolmogorov distance self-linksurface differs ⓘ
surface form:
Kolmogorov–Smirnov test
supremum norm ⓘ uniform metric ⓘ |
| requires | right-continuous cumulative distribution functions with left limits ⓘ |
| sensitiveTo | global differences between distributions ⓘ |
| strongerThan |
Lévy–Prokhorov metric
ⓘ
surface form:
Lévy metric on the real line
|
| topologyInduced | weak convergence of probability measures on the real line ⓘ |
| usedFor |
goodness-of-fit testing
ⓘ
one-sample goodness-of-fit tests ⓘ quantifying convergence in distribution ⓘ two-sample comparison of distributions ⓘ |
| usedIn |
Kolmogorov distance
self-linksurface differs
ⓘ
surface form:
Kolmogorov–Smirnov test
nonparametric statistics ⓘ probability theory ⓘ statistical hypothesis testing ⓘ stochastic process convergence analysis ⓘ |
| usedToDefine | Kolmogorov–Smirnov statistic in empirical samples ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Kolmogorov distance Description of subject: Kolmogorov distance is a statistical metric that measures the maximum difference between two cumulative distribution functions, commonly used to quantify convergence in distribution and in goodness-of-fit tests.
Referenced by (7)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
Kolmogorov–Smirnov test
this entity surface form:
Kolmogorov metric
this entity surface form:
Kolmogorov–Smirnov metric
this entity surface form:
Kolmogorov–Smirnov test
this entity surface form:
Kolmogorov–Smirnov test
this entity surface form:
Kolmogorov–Smirnov statistic