Asymptotics for transportation cost in high dimensions
暂无分享,去创建一个
[1] J. Beardwood,et al. The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.
[2] A. Kolmogorov,et al. Entropy and "-capacity of sets in func-tional spaces , 1961 .
[3] R. Dudley. The Sizes of Compact Subsets of Hilbert Space and Continuity of Gaussian Processes , 1967 .
[4] R. Dudley. The Speed of Mean Glivenko-Cantelli Convergence , 1969 .
[5] A. Stroud. Approximate calculation of multiple integrals , 1973 .
[6] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[7] J. Steele. Subadditive Euclidean Functionals and Nonlinear Growth in Geometric Probability , 1981 .
[8] János Komlós,et al. On optimal matchings , 1984, Comb..
[9] Peter W. Shor. The average-case analysis of some on-line algorithms for bin packing , 1986, Comb..
[10] J. Steele. Growth Rates of Euclidean Minimal Spanning Trees With Power Weighted Edges , 1988 .
[11] Alan F. Karr,et al. Point Processes and Their Statistical Inference , 1991 .
[12] M. Talagrand,et al. Probability in Banach spaces , 1991 .
[13] Michel Talagrand,et al. Matching Random Samples in Many Dimensions , 1992 .
[14] M. Talagrand. Matching theorems and empirical discrepancy computations using majorizing measures , 1994 .
[15] J. Yukich,et al. Limit Theorems and Rates of Convergence for Euclidean Functionals , 1994 .