Calculation of the Prokhorov distance by optimal quantization and maximum flow

被引:0
|
作者
Bernard Garel
Jean-Claude Massé
机构
[1] Mathematical Institute of Toulouse (UPS) and ENSEEIHT,Département de Mathématiques et de Statistique
[2] Université Laval,undefined
来源
关键词
Prokhorov metric; Weak convergence; Quantization; Flow on a network;
D O I
暂无
中图分类号
学科分类号
摘要
Calculating exact values of the Prokhorov metric for the set of probability distributions on a metric space is a challenging problem. In this paper probability distributions are approximated by finite-support distributions through optimal or quasi-optimal quantization, in such a way that exact calculation of the Prokhorov distance between a distribution and a quantizer can be performed. The exact value of the Prokhorov distance between two quantizers is obtained by solving an optimization problem through the Simplex method. This last value is used to approximate the Prokhorov distance between the two initial distributions, and the accuracy of the approximation is measured. We illustrate the method on various univariate and bivariate probability distributions. Approximation of bivariate standard normal distributions by quasi-optimal quantizers is also considered.
引用
收藏
页码:73 / 88
页数:15
相关论文
共 50 条
  • [21] CALCULATION OF MAXIMUM FLOW RATE THROUGH SAFETY VALVES
    BOUILLOU.P
    BRITISH CHEMICAL ENGINEERING, 1970, 15 (11): : 1447 - &
  • [22] MAXIMUM PRINCIPLE AS APPLIED TO CALCULATION OF OPTIMAL CONTROLS OF DISCRETE SYSTEMS
    GABASOV, R
    KIRILLOV.FM
    DOKLADY AKADEMII NAUK SSSR, 1969, 189 (05): : 963 - &
  • [23] Sharp evaluation of the Prokhorov distance to zero under general moment conditions
    Rychlik, T
    JOURNAL OF COMPUTATIONAL ANALYSIS AND APPLICATIONS, 2004, 6 (02) : 165 - 172
  • [24] CALCULATION OF QUANTIZATION NOISE DISPERSION IN AN OPTIMAL ROOT-MEAN-SQUARE QUANTIZER
    KRASILNIKOV, NN
    IZVESTIYA VYSSHIKH UCHEBNYKH ZAVEDENII RADIOFIZIKA, 1992, 35 (6-7): : 612 - 614
  • [25] Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems
    Asahiro, Yuichi
    Doi, Yuya
    Miyano, Eiji
    Shimizu, Hirotaka
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, (COCOA 2015), 2015, 9486 : 586 - 600
  • [26] Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems
    Asahiro, Yuichi
    Doi, Yuya
    Miyano, Eiji
    Samizo, Kazuaki
    Shimizu, Hirotaka
    ALGORITHMICA, 2018, 80 (06) : 1834 - 1856
  • [27] REVERSE MAXIMUM FLOW PROBLEM UNDER THE WEIGHTED CHEBYSHEV DISTANCE
    Tayyebi, Javad
    Mohammadi, Abumoslem
    Kazemi, Seyyed Mohammad Reza
    RAIRO-OPERATIONS RESEARCH, 2018, 52 (4-5) : 1107 - 1121
  • [28] Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems
    Yuichi Asahiro
    Yuya Doi
    Eiji Miyano
    Kazuaki Samizo
    Hirotaka Shimizu
    Algorithmica, 2018, 80 : 1834 - 1856
  • [29] Inverse maximum flow problems under the weighted Hamming distance
    Longcheng Liu
    Jianzhong Zhang
    Journal of Combinatorial Optimization, 2006, 12 : 395 - 408
  • [30] Inverse maximum flow problems under the weighted Hamming distance
    Liu, Longcheng
    Zhang, Jianzhong
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2006, 12 (04) : 394 - 407