Skip to main content
Log in

Asymptotics for transportation cost in high dimensions

  • Published:
Journal of Theoretical Probability Aims and scope Submit manuscript

Abstract

LetX 1,...,X n ,Y 1,...,Y n be i.i.d. with the law μ on the cube [0, 1]d,d⩾3. LetL n (μ)=infπΣ n i=1 ||X i Y π(i)|| denote the optimal bipartite matching of theX andY points, where π ranges over all permutations of the integers 1, 2,...,n, and where ‖·‖ is a norm on ℝd. If μ is Lebesgue measure it is shown that

$$\mathop {\lim }\limits_{n \to \infty } L_n (\mu )/n^{(d - 1)/d} = \alpha {\text{a}}{\text{.s}}{\text{.}}$$

where α is a finite constant depending on ‖ ‖ andd only. More generally, for arbitrary μ it is shown that

$$\mathop {\lim }\limits_{n \to \infty } L_n (\mu )/n^{(d - 1)/d} = \alpha \int {(f{\text{(}}x{\text{)}})^{(d - 1)/d} dxa.s.} $$

wheref is the density of the absolutely continuous part of μ. We also find the rate of convergence.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Ajtai, M., Komlós, J., and Tusnády, G. (1984). On optimal matchings,Combinatorica 4, 259–264.

    Google Scholar 

  2. Alexander, K. S. (preprint). Rates of convergence for distance minimizing subadditive Euclidean functionals.

  3. Bakhvalov, N. S. (1959). On approximate calculation of multiple integrals,Vestnik Mosk. Ser. Mat. Mekh. Astron. Fiz. Khim. 4, 3–18. (Russian)

    Google Scholar 

  4. Beardwood, J., Halton, J. H., and Hammersley, J. M. (1959). The shortest path through many points,Proc. Cambridge Philos. Soc. pp. 291–327.

  5. Dudley, R. M. (1969). The speed of mean Glivenko-Cantelli convergence,Ann. Math. Stat. 40, 40–50.

    Google Scholar 

  6. Dudley, R. M. (1967). The sizes of compact subsets of Hilbert space and continuity of Gaussian processes,J. Funct. Anal. 1, 290–330.

    Google Scholar 

  7. Karr, Alan F. (1986).Point Processes and Their Statistical Inference, Marcel Dekker, Inc..

  8. Kolmogorov, A. N. and Tikhomirov, V. M. (1961). ε-entropy and ε-capacity of sets in function spaces,Amer. Math. Soc. Transl. (Ser. 2)17, 277–364.

    Google Scholar 

  9. Ledoux, M. and Talagrand, M. (1991).Probability in Banach Spaces, Springer-Verlag, New York.

    Google Scholar 

  10. Papadimitriou, C. H. and Steiglitz, K. (1982).Combinatorial Optimization, Algorithms and Complexity, Prentice Hall, New Jersey.

    Google Scholar 

  11. Redmond, C., and Yukich, J. E. (1994). Limit theorems and rates of convergence for Euclidean functionals,Annals of Appl. Prob. 4, 1057–1073.

    Google Scholar 

  12. Shor, P. W. (1986). The average-case analysis of some on-line algorithms for bin packing,Combinatorica 6, 179–200.

    Google Scholar 

  13. Steele, J. M. (1981). Subadditive Euclidean functionals and nonlinear growth in geometric probability,Ann. Prob. 9, 365–376.

    Google Scholar 

  14. Steele, J. M. (1988). Growth rates of Euclidean minimal spanning trees with power weighted edges,Ann. Prob. 16, 1767–1787.

    Google Scholar 

  15. Talagrand, M. (1992). Matching random samples in many dimensions,Annals of Appl. Prob. 2, 846–856.

    Google Scholar 

  16. Talagrand, M. (1994). Matching theorems and empirical discrepancy computations using majorizing measures,J. of the Am. Math. Soc. 7, 455–537.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Research supported in part by Reidler Foundation.

Research supported in part by N.S.F. Grant DMS-92000656.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dobrić, V., Yukich, J.E. Asymptotics for transportation cost in high dimensions. J Theor Probab 8, 97–118 (1995). https://doi.org/10.1007/BF02213456

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02213456

Key Words

Navigation