Abstract
Givenn random red points on the unit square, the transportation cost between them is tipically √n logn.
Similar content being viewed by others
References
L. R. Ford, Jr. andD. R. Fulkerson, A simple algorithm for finding maximal network flows and an application to the Hitchcock problem.Canad. J. Math. 9 (1957), 210–218.
R. Karp, Private communication (1982).
J. Komlós, P. Major andG. Tusnády, An approximation of partial sums of independent RV’s, and the sample DF.I. Z. Wahrscheinlichkeitstheorie verw. Gebiete 32 (1975), 111–131.
G. Schay, Nearest random variables with given distributions.Ann. of Probab. 2 (1974), 163–166.
G. Tusnády, A remark on the approximation of the sample DF in the multidimensional case.Periodica Mathematica Hungarica 8 (1977), 53–55.