论文信息 - Almost Sure Convergence of the Minimum Bipartite Matching Functional in Euclidean Space

Almost Sure Convergence of the Minimum Bipartite Matching Functional in Euclidean Space

Let LN = LMBM(X1, . . .,XN;Y1, . . . , YN) be the minimum length of a bipartite matching between two sets of points in Rd, where X1,...,XN, . . . and Y1, . . . , YN, . . . are random points independently and uniformly distributed in [0, 1]d. We prove that for d ≥ 3, LN/N1−1/d converges with probability one to a constant βMBM(d) > 0 as N → ∞.

J. H. Boutet de Monvel | O. C. Martin

[1] J. Steele. Probability theory and combinatorial optimization , 1987 .

[2] J. Yukich,et al. Limit Theorems and Rates of Convergence for Euclidean Functionals , 1994 .

[3] M. Mézard,et al. On the solution of the random link matching problems , 1987 .

[5] O. Martin,et al. Comparing mean field and Euclidean matching problems , 1998, cond-mat/9803195.

[6] Michel Talagrand,et al. Matching Random Samples in Many Dimensions , 1992 .

[7] Kazuoki Azuma. WEIGHTED SUMS OF CERTAIN DEPENDENT RANDOM VARIABLES , 1967 .

[8] J. Steele. Subadditive Euclidean Functionals and Nonlinear Growth in Geometric Probability , 1981 .

[9] D. Bertsimas,et al. An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability , 1990 .

[10] Warren D. Smith. Studies in computational geometry motivated by mesh generation , 1989 .

[11] D. Aldous. The ζ(2) limit in the random assignment problem , 2000, Random Struct. Algorithms.

[12] J. Beardwood,et al. The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[13] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.