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

Abstract

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 ∞ .

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…