ON THE OPTIMAL MAP IN THE 2-DIMENSIONAL RANDOM MATCHING PROBLEM

被引:11
|
作者
Ambrosio, Luigi [1 ]
Glaudo, Federico [2 ]
Trevisan, Dario [3 ]
机构
[1] Scuola Normale Super Pisa, Piazza Cavalieri 7, I-56126 Pisa, Italy
[2] ETH, Ramistr 101, CH-8092 Zurich, Switzerland
[3] Univ Pisa, Dipartimento Matemat, Largo Bruno Pontecorvo 5, I-56127 Pisa, Italy
基金
欧洲研究理事会;
关键词
Minimum matching; random matching; optimal transport; Hamilton-Jacobi; stability; POLAR FACTORIZATION; COST;
D O I
10.3934/dcds.2019304
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We show that, on a 2-dimensional compact manifold, the optimal transport map in the semi-discrete random matching problem is wellapproximated in the L-2-norm by identity plus the gradient of the solution to the Poisson problem - Delta f(n,t) = mu(n,t) - 1, where mu(n,t) is an appropriate regularization of the empirical measure associated to the random points. This shows that the ansatz of [8] is strong enough to capture the behavior of the optimal map in addition to the value of the optimal matching cost. As part of our strategy, we prove a new stability result for the optimal transport map on a compact manifold.
引用
收藏
页码:7291 / 7308
页数:18
相关论文
共 50 条
  • [1] FINER ESTIMATES ON THE 2-DIMENSIONAL MATCHING PROBLEM
    Ambrosio, Luigi
    Glaudo, Federico
    JOURNAL DE L ECOLE POLYTECHNIQUE-MATHEMATIQUES, 2019, 6 : 737 - 765
  • [2] A PDE approach to a 2-dimensional matching problem
    Ambrosio, Luigi
    Stra, Federico
    Trevisan, Dario
    PROBABILITY THEORY AND RELATED FIELDS, 2019, 173 (1-2) : 433 - 477
  • [3] A PDE approach to a 2-dimensional matching problem
    Luigi Ambrosio
    Federico Stra
    Dario Trevisan
    Probability Theory and Related Fields, 2019, 173 : 433 - 477
  • [4] ON 2-DIMENSIONAL PATTERN-MATCHING BY OPTIMAL PARALLEL ALGORITHMS
    CROCHEMORE, M
    RYTTER, W
    THEORETICAL COMPUTER SCIENCE, 1994, 132 (1-2) : 403 - 414
  • [5] A SOLUTION FOR THE STEREO MATCHING PROBLEM BASED ON 2-DIMENSIONAL MINIMIZATION
    GEIER, J
    INVESTIGATIVE OPHTHALMOLOGY & VISUAL SCIENCE, 1993, 34 (04) : 1185 - 1185
  • [6] NOTE ON 2-DIMENSIONAL PATTERN-MATCHING BY OPTIMAL PARALLEL ALGORITHMS
    CROCHEMORE, M
    RYTTER, W
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 654 : 100 - 112
  • [7] 2-DIMENSIONAL DICTIONARY MATCHING
    AMIR, A
    FARACH, M
    INFORMATION PROCESSING LETTERS, 1992, 44 (05) : 233 - 239
  • [8] NOTE ON THE RECURRENCE TIME PROBLEM FOR THE 2-DIMENSIONAL MARKOFFIAN RANDOM FUNCTION
    SIEGERT, AJF
    PHYSICAL REVIEW, 1947, 71 (07): : 469 - 469
  • [9] LOCALIZATION PROBLEM OF A 2-DIMENSIONAL LATTICE IN A RANDOM MAGNETIC-FIELD
    AVISHAI, Y
    HATSUGAI, Y
    KOHMOTO, M
    PHYSICAL REVIEW B, 1993, 47 (15): : 9561 - 9565
  • [10] DYNAMICS FOR A 2-DIMENSIONAL ANTISYMMETRIC MAP
    FANG, HP
    JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1994, 27 (15): : 5187 - 5200