English

Almost sure convergence of the minimum bipartite matching functional in Euclidean space

Combinatorics 2007-05-23 v1 Optimization and Control Probability

Abstract

Let LN=LMBM(X1,...,XN;Y1,...,YN)L_N = L_{MBM}(X_1,..., X_N; Y_1,..., Y_N) be the minimum length of a bipartite matching between two sets of points in Rd\mathbf{R}^d, where X1,...,XN,...X_1,..., X_N,... and Y1,...,YN,...Y_1,..., Y_N,... are random points independently and uniformly distributed in [0,1]d[0,1]^d. We prove that for d3d \ge 3, LN/N11/dL_N/N^{1-1/d} converges with probability one to a constant βMBM(d)>0\beta_{MBM}(d)>0 as NN\to \infty .

Cite

@article{arxiv.math/0205140,
  title  = {Almost sure convergence of the minimum bipartite matching functional in Euclidean space},
  author = {J. H. Boutet de Monvel and O. C. Martin},
  journal= {arXiv preprint arXiv:math/0205140},
  year   = {2007}
}

Comments

To appear in Combinatorica