The DOI matches its Crossref record.
Topics in Optimal Transportation
Abstract
Introduction The Kantorovich duality Geometry of optimal transportation Brenier's polar factorization theorem The Monge-Ampere equation Displacement interpolation and displacement convexity Geometric and Gaussian inequalities The metric side of optimal transportation A differential point of view on optimal transportation Entropy production and transportation inequalities Problems Bibliography Table of short statements Index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
(2008) · doi:10.1007/978-3-7643-8722-8 · Cited by 2,220
Ricci curvature for metric-measure spaces via optimal transport
Lott, J., & Villani, C. (2009) · Annals of Mathematics · doi:10.4007/annals.2009.169.903 · Cited by 1,189
Self-citationOn the geometry of metric measure spaces. II
Sturm, K.-T. (2006) · Acta Mathematica · doi:10.1007/s11511-006-0003-7 · Cited by 1,149
Statistical Aspects of Wasserstein Distances
Panaretos, V. M., & Zemel, Y. (2019) · Annual Review of Statistics and Its Application · doi:10.1146/annurev-statistics-030718-104938 · Cited by 857
Computational Optimal Transport
Peyré, G., & Cuturi, M. (2019) · now publishers, Inc. eBooks · doi:10.1561/9781680835519 · Cited by 847
On the geometry of metric measure spaces
Sturm, K.-T. (2006) · Acta Mathematica · doi:10.1007/s11511-006-0002-8 · Cited by 835
Barycenters in the Wasserstein Space
Agueh, M., & Carlier, G. (2011) · SIAM Journal on Mathematical Analysis · doi:10.1137/100805741 · Cited by 749
Ricci curvature of Markov chains on metric spaces
Ollivier, Y. (2009) · Journal of Functional Analysis · doi:10.1016/j.jfa.2008.11.001 · Cited by 712
Bond-Taylor, S., Leach, A., Long, Y., & Willcocks, C. G. (2022) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2021.3116668 · Cited by 703
Iterative Bregman Projections for Regularized Transportation Problems
Benamou, J.-D., Carlier, G., Cuturi, M., Nenna, L., & Peyré, G. (2015) · SIAM Journal on Scientific Computing · doi:10.1137/141000439 · Cited by 672
Distributionally Robust Stochastic Optimization with Wasserstein Distance
Gao, R., & Kleywegt, A. (2023) · Mathematics of Operations Research · doi:10.1287/moor.2022.1275 · Cited by 630
Estimation and Confidence Regions for Parameter Sets in Econometric Models
Chernozhukov, V., Hong, H., & Tamer, E. (2007) · Econometrica · doi:10.1111/j.1468-0262.2007.00794.x · Cited by 617
An Introduction to Topological Data Analysis: Fundamental and Practical Aspects for Data Scientists
Chazal, F., & Michel, B. (2021) · Frontiers in Artificial Intelligence · doi:10.3389/frai.2021.667963 · Cited by 581
A Survey on Generative Diffusion Models
Cao, H., Tan, C., Gao, Z., Xu, Y., Chen, G., Heng, P.-A., & Li, S. Z. (2024) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2024.3361474 · Cited by 538
Gromov–Wasserstein Distances and the Metric Approach to Object Matching
Mémoli, F. (2011) · Foundations of Computational Mathematics · doi:10.1007/s10208-011-9093-5 · Cited by 515
Asymptotic Flocking Dynamics for the Kinetic Cucker–Smale Model
Carrillo, J. A., Fornasier, M., Rosado, J., & Toscani, G. (2010) · SIAM Journal on Mathematical Analysis · doi:10.1137/090757290 · Cited by 510
Wasserstein Barycenter and Its Application to Texture Mixing
Rabin, J., Peyré, G., Delon, J., & Bernot, M. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-24785-9_37 · Cited by 504
Convolutional wasserstein distances: efficient optimal transportation on geometric domains
Solomon, J., de Goes, F., Peyré, G., Cuturi, M., Butscher, A., Nguyen, A., Du, T., & Guibas, L. (2015) · ACM Transactions on Graphics · doi:10.1145/2766963 · Cited by 481
Sliced and Radon Wasserstein Barycenters of Measures
Bonneel, N., Rabin, J., Peyré, G., & Pfister, H. (2015) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-014-0506-3 · Cited by 467
Learning to Learn Single Domain Generalization
Qiao, F., Zhao, L., & Peng, X. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.01257 · Cited by 455
Learning to Simulate Complex Physics with Graph Networks
Sánchez‐González, Á., Godwin, J., Pfaff, T., Ying, R., Leskovec, J., & Battaglia, P. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.09405 · Cited by 413
Bank, D., Koenigstein, N., & Giryes, R. (2023) · Machine Learning for Data Science Handbook · doi:10.1007/978-3-031-24628-9_16 · Cited by 406
Desvillettes, L., & Villani, C. (2005) · Inventiones mathematicae · doi:10.1007/s00222-004-0389-9 · Cited by 383
Self-citationParticle, kinetic, and hydrodynamic models of swarming
Carrillo, J. A., Fornasier, M., Toscani, G., & Vecil, F. (2010) · Modeling and Simulation in Science, Engineering and Technology · doi:10.1007/978-0-8176-4946-3_12 · Cited by 355
Quantifying Distributional Model Risk via Optimal Transport
Blanchet, J., & Murthy, K. (2019) · Mathematics of Operations Research · doi:10.1287/moor.2018.0936 · Cited by 350
Scaling algorithms for unbalanced optimal transport problems
Chizat, L., Peyré, G., Schmitzer, B., & Vialard, F.-X. (2018) · Mathematics of Computation · doi:10.1090/mcom/3303 · Cited by 336
Probabilistic Forecasting and Bayesian Data Assimilation
Reich, S., & Cotter, C. (2015) · Cambridge University Press eBooks · doi:10.1017/cbo9781107706804 · Cited by 334
Quantile and probability curves without crossing
Fernandez-Val, I., Chernozhukov, V., & Galichon, A. (2007) · Working Paper Series · doi:10.1920/wp.cem.2007.1007 · Cited by 322
A WELL-POSEDNESS THEORY IN MEASURES FOR SOME KINETIC MODELS OF COLLECTIVE MOTION
CAÑIZO, J. A., CARRILLO, J. A., & ROSADO, J. (2011) · Mathematical Models and Methods in Applied Sciences · doi:10.1142/s0218202511005131 · Cited by 300
A Tutorial on UAVs for Wireless Networks: Applications, Challenges, and Open Problems
Mozaffari, M., Saad, W., Bennis, M., Nam, Y.-H., & Debbah, M. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2902862 · Cited by 299
Modular Forms, a Computational Approach
Stein, W. (2007) · Graduate Studies in Mathematics · doi:10.1090/gsm/079 · Cited by 297
Nitzan, M., Karaiskos, N., Friedman, N., & Rajewsky, N. (2019) · Nature · doi:10.1038/s41586-019-1773-3 · Cited by 284
Nonlinear Markov Processes and Kinetic Equations
Kolokoltsov, V. N. (2010) · Cambridge University Press eBooks · doi:10.1017/cbo9780511760303 · Cited by 279
Global-in-time weak measure solutions and finite-time aggregation for nonlocal interaction equations
Carrillo, J. A., DiFrancesco, M., Figalli, A., Laurent, T., & Slepčev, D. (2011) · Duke Mathematical Journal · doi:10.1215/00127094-2010-211 · Cited by 279
On the Relation Between Optimal Transport and Schrödinger Bridges: A Stochastic Control Viewpoint
Chen, Y., Georgiou, T. T., & Pavon, M. (2016) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-015-0803-z · Cited by 258
An introduction to deep generative modeling
Ruthotto, L., & Haber, E. (2021) · GAMM-Mitteilungen · doi:10.1002/gamm.202100008 · Cited by 258
Path-Planning for Unmanned Aerial Vehicles with Environment Complexity Considerations: A Survey
Jones, M., Djahel, S., & Welsh, K. (2023) · ACM Computing Surveys · doi:10.1145/3570723 · Cited by 258
Probability laws related to the Jacobi theta and Riemann zeta functions, and Brownian excursions
Biane, P., Pitman, J., & Yor, M. (2001) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-01-00912-0 · Cited by 254
The Bayesian Approach to Inverse Problems
Dashti, M., & Stuart, A. M. (2015) · Handbook of Uncertainty Quantification · doi:10.1007/978-3-319-11259-6_7-1 · Cited by 252
Probability measures on the space of persistence diagrams
Mileyko, Y., Mukherjee, S., & Harer, J. (2011) · Inverse Problems · doi:10.1088/0266-5611/27/12/124007 · Cited by 249
Learning single-cell perturbation responses using neural optimal transport
Bunne, C., Stark, S. G., Gut, G., del Castillo, J. S., Levesque, M., Lehmann, K.-V., Pelkmans, L., Krause, A., & Rätsch, G. (2023) · Nature Methods · doi:10.1038/s41592-023-01969-x · Cited by 202
Learning Invariant Representations for Reinforcement Learning without Reconstruction
Zhang, A., McAllister, R., Calandra, R., Gal, Y., & Levine, S. (2020) · arXiv · doi:10.48550/arxiv.2006.10742 · Cited by 165
Mohajerin Esfahani, P., & Kuhn, D. (2018) · Mathematical Programming · doi:10.1007/s10107-017-1172-1 · Cited by 136
Objective Morphological Classification of Neocortical Pyramidal Cells
Kanari, L., Ramaswamy, S., Shi, Y., Morand, S., Meystre, J., Perin, R., Abdellah, M., Wang, Y., Hess, K., & Markram, H. (2019) · Cerebral Cortex · doi:10.1093/cercor/bhy339 · Cited by 94
Optimal transport for single-cell and spatial omics
Bunne, C., Schiebinger, G., Krause, A., Regev, A., & Cuturi, M. (2024) · Nature Reviews Methods Primers · doi:10.1038/s43586-024-00334-2 · Cited by 71
Information-theoretic analysis of stability and bias of learning algorithms
Raginsky, M., Rakhlin, A., Tsao, M., Wu, Y., & Xu, A. (2016) · 2016 IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2016.7606789 · Cited by 70
Fair Regression with Wasserstein Barycenters
Chzhen, E., Denis, C., Hebiri, M., Oneto, L., & Pontil, M. (2020) · arXiv · doi:10.48550/arxiv.2006.07286 · Cited by 46
“The next result establishes that as long as one of the measures in the definition of the Wasserstein-2 distance admits a density, then the optimal coupling in the infimum in Definition 2.1 is deterministic (see e.g., [41, Theorem 2.18] or [38, Theorems 2.5 and 2.9]).”
BackgroundMethodInfluentialLow responsiveness of machine learning models to critical or deteriorating health conditions
Pias, T. S., Afrose, S., Tuli, M. D., Trisha, I. H., Deng, X., Nemeroff, C. B., & Yao, D. D. (2025) · Communications Medicine · doi:10.1038/s43856-025-00775-0 · Cited by 10
Metadata
- Authors
- Villani, C.
- Venue
- Graduate Studies in Mathematics
- Publisher
- American Mathematical Society
- Published
- 2003-03-25
- ISSN
- 1065-7339 (ISSN-L)
- OpenAlex
- W1585160083
- Cited by
- 4,412
- References
- 0
- FWCI
- 24.32
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.