Calculation of the Prokhorov distance by optimal quantization and maximum flow
From MaRDI portal
Publication:734428
Recommendations
- Optimal vector quantization in terms of Wasserstein distance
- Quadratic distances on probabilities: A unified foundation
- Maximally highly proximal flows
- Proximal distance algorithms: theory and practice
- Vector Quantization for Arbitrary Distance Function Estimation
- Quantization for probability measures in the Prokhorov metric
- Distance majorization and its applications
- Quantization of probability densities: a gradient flow approach
- Optimal quantization for dyadic homogeneous Cantor distributions
- Bounding Kolmogorov distances through Wasserstein and related integral probability metrics
Cites work
- scientific article; zbMATH DE number 3125504 (Why is no real title available?)
- scientific article; zbMATH DE number 3954047 (Why is no real title available?)
- scientific article; zbMATH DE number 3967642 (Why is no real title available?)
- A General Qualitative Definition of Robustness
- Distances of Probability Measures and Random Variables
- Nearest random variables with given distributions
- On the linear programming approach to the optimality property of Prokhorov's distance
- Robust Statistics
Cited in
(4)- scientific article; zbMATH DE number 3872381 (Why is no real title available?)
- AN EMPIRICAL STUDY OF THE ASYMPTOTIC LAWS OF SOME ESTIMATORS OF GENERALIZED ASSOCIATION PARAMETER AND SIGNED SYMMETRIC COVARIATION COEFFICIENT
- Estimation and comparison of signed symmetric covariation coefficient and generalized association parameter for alpha-stable dependence modeling
- Optimal vector quantization in terms of Wasserstein distance
This page was built for publication: Calculation of the Prokhorov distance by optimal quantization and maximum flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734428)
