Poisson Matching

  title={Poisson Matching},
  author={A. Holroyd and R. Pemantle and Y. Peres and O. Schramm},
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… Expand

Figures from this paper

A factor matching of optimal tail between Poisson processes
Consider two independent Poisson point processes of unit intensity in the Euclidean space of dimension d at least 3. We construct a perfect matching between the two point sets that is a factor (i.e.,Expand
Geometric properties of Poisson matchings
Suppose that red and blue points occur as independent Poisson processes of equal intensity in $${\mathbb {R}^d}$$, and that the red points are matched to the blue points via straight edges in aExpand
Invariant Bipartite Random Graphs on Rd
  • Fabio Lopes
  • Mathematics
  • Journal of Applied Probability
  • 2014
Suppose that red and blue points occur in R d according to two simple point processes with finite intensities λ R and λ B , respectively. Furthermore, let ν and μ be two probability distributions onExpand
Stable matchings in high dimensions via the Poisson-weighted infinite tree
We consider the stable matching of two independent Poisson processes in $\mathbb{R}^d$ under an asymmetric color restriction. Blue points can only match to red points, while red points can match toExpand
Matchings Between Point Processes
In this thesis we study several kinds of matching problems between two point processes. First we consider the set of integers Z. We assign a color red or blue with probability 12 to each integer. WeExpand
Multicolour Poisson Matching
Consider several independent Poisson point processes on R^d, each with a different colour and perhaps a different intensity, and suppose we are given a set of allowed family types, each of which is aExpand
Minimal matchings of point processes
Suppose that red and blue points form independent homogeneous Poisson processes of equal intensity in $R^d$. For a positive (respectively, negative) parameter $\gamma$ we consider red-blue matchingsExpand
Coupling, matching, and equivariance
This thesis consists of four research papers and one expository note that study factors of point processes in the contexts of thinning and matching. In “Poisson Splitting by Factors,” we prove thatExpand
Percolation in invariant Poisson graphs with i.i.d. degrees
Let each point of a homogeneous Poisson process in ℝd independently be equipped with a random number of stubs (half-edges) according to a given probability distribution μ on the positive integers. WeExpand
Bipartite stable Poisson graphs on R
Let red and blue points be distributed on $\mathbb{R}$ according to two independent Poisson processes $\mathcal{R}$ and $\mathcal{B}$ and let each red (blue) point independently be equipped with aExpand


Invariant matchings of exponential tail on coin flips in $\Z^d$
Consider Bernoulli(1/2) percolation on $\Z^d$, and define a perfect matching between open and closed vertices in a way that is a deterministic equivariant function of the configuration. We want toExpand
A Stable Marriage of Poisson and Lebesgue
Let be a discrete set in R d . Call the elements of centers. The well-known Voronoi tessellation partitions R d into polyhedral regions (of varying sizes) by allocating each site of R d to theExpand
How to Find an extra Head: Optimal Random Shifts of Bernoulli and Poisson Random Fields
We consider the following problem: given an i.i.d. family of Bernoulli random variables indexed by Z d , find a random occupied site X ∈ Z d such that relative to X, the other random variables areExpand
Nearest neighbor and hard sphere models in continuum percolation
It is shown that if percolation occurs, then there is exactly one infinite cluster and some general properties of percolations models where balls placed at Poisson points are not allowed to overlap (but are allowed to be tangent). Expand
Trees and Matchings from Point Processes
A factor graph of a point process is a graph whose vertices are the points of the process, and which is constructed from the process in a deterministic isometry-invariant way. We prove that the dExpand
Extra heads and invariant allocations
Let n be an ergodic simple point process on E d and let n* be its Palm version. Thorisson [Ann. Probab. 24 (1996) 2057-2064] proved that there exists a shift coupling of Π and n*; that is, one canExpand
Poisson trees, succession lines and coalescing random walks
Abstract We give a deterministic algorithm to construct a graph with no loops (a tree or a forest) whose vertices are the points of a d-dimensional stationary Poisson process S⊂ R d . The algorithmExpand
Percolation and minimal spanning forests in infinite graphs
The structure of a spanning forest that generalizes the minimal spanning tree is considered for infinite graphs with a value f(b) attached to each bond b. Of particular interest are stationary randomExpand
Greedy Matching on the Line
It is shown that if $2n$ points are randomly chosen uniformly in $[0,1]$, then the expected length of the matching given by the greedy algorithm is $\theta (\log n)$. Expand
Group-invariant Percolation on Graphs
Abstract. Let G be a closed group of automorphisms of a graph X. We relate geometric properties of G and X, such as amenability and unimodularity, to properties of G-invariant percolation processesExpand