Poisson Matching

Suppose that red and blue points occur as independent homogeneous Poisson processes in Rd. We investigate translation-invariant schemes for perfectly matching the red points to the blue points. For any such scheme in dimensions d = 1, 2, the matching distance X from a typical point to its partner must have infinite d/2-th moment, while in dimensions d ≥ 3 there exist schemes where X has finite exponential moments. The Gale-Shapley stable marriage is one natural matching scheme, obtained by iteratively matching mutually closest pairs. A principal result of this paper is a power law upper bound on the matching distance X for this scheme. A power law lower bound holds also. In particular, stable marriage is close to optimal (in tail behavior) in d = 1, but far from optimal in d ≥ 3. For the problem of matching Poisson points of a single color to each other, in d = 1 there exist schemes where X has finite exponential moments, but if we insist that the matching is a deterministic factor of the point process then X must have infinite mean.

[1]  L. Shapley,et al.  College Admissions and the Stability of Marriage , 1962 .

[2]  János Komlós,et al.  On optimal matchings , 1984, Comb..

[3]  J. Michael Steele,et al.  Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching , 1988, Probability in the Engineering and Informational Sciences.

[4]  Alan M. Frieze,et al.  Greedy Matching on the Line , 1990, SIAM J. Comput..

[5]  M. Talagrand.  THE TRANSPORTATION COST FROM THE UNIFORM MEASURE TO THE EMPIRICAL MEASURE IN DIMENSION > 3 , 1994 .

[6]  Kenneth S. Alexander,et al.  Percolation and minimal spanning forests in infinite graphs , 1995 .

[7]  Olle Häggström,et al.  Nearest neighbor and hard sphere models in continuum percolation , 1996, Random Struct. Algorithms.

[8]  O. Kallenberg.  Foundations of Modern Probability , 2021, Probability Theory and Stochastic Modelling.

[9]  Russell Lyons,et al.  Group-invariant Percolation on Graphs , 1999 .

[10]  T. Liggett,et al.  How to Find an extra Head: Optimal Random Shifts of Bernoulli and Poisson Random Fields , 2001 .

[11]  Thomas M. Liggett,et al.  Tagged Particle Distributions or How to Choose a Head at Random , 2002 .

[12]  W. Gasarch,et al.  Stable Marriage and its Relation to Other Combinatorial Problems : An Introduction to Algorithm Analysis , 2002 .

[13]  Alexander E. Holroyd,et al.  Trees and Matchings from Point Processes , 2002, math/0211455.

[14]  Poisson trees, succession lines and coalescing random walks , 2002, math/0209395.

[15]  Alexander E. Holroyd,et al.  Extra heads and invariant allocations , 2003, math/0306402.

[16]  Y. Peres,et al.  A Stable Marriage of Poisson and Lebesgue , 2005, math/0505668.

[17]  Dan Romik,et al.  Gravitational allocation to Poisson points , 2006, math/0611886.

[18]  Adam Timar.  Invariant matchings of exponential tail on coin flips in $\Z^d$ , 2009 .

[19]  Y. Peres,et al.  Tail Bounds for the Stable Marriage of Poisson and Lebesgue , 2005, Canadian Journal of Mathematics.

[20]  Terry Soo.  Translation-invariant Matchings of Coin-flips on Z , 2022 .