Extra heads and invariant allocations
Alexander E. Holroyd, Yuval Peres
Abstract
Let Πbe an ergodic simple point process on Rd and let Π* be its Palm version. Thorisson [Ann. Probab. 24 (1996) 2057-2064] proved that there exists a shift coupling of Πand Π*; that is, one can select a (random) point Y of Πsuch that translating Πby -Y yields a configuration whose law is that of Π*. We construct shift couplings in which Y and Π* are functions of Π, and prove that there is no shift coupling in which Πis a function of Π*. The key ingredient is a deterministic translation-invariant rule to allocate sets of equal volume (forming a partition of Rd) to the points of Π. The construction is based on the Gale-Shapley stable marriage algorithm [Amer. Math. Monthly 69 (1962) 9-15]. Next, let Γbe an ergodic random element of 0,1Zd and let Γ* be Γconditioned on Γ(0)=1. A shift coupling X of Γand Γ* is called an extra head scheme. We show that there exists an extra head scheme which is a function of Γif and only if the marginal E[Γ(0)] is the reciprocal of an integer. When the law of Γis product measure and d≥3, we prove that there exists an extra head scheme X satisfying E c\|X\|d<∞; this answers a question of Holroyd and Liggett [Ann. Probab. 29 (2001) 1405-1425].
Create a lesson
Related papers
Sublinear multi-type preferential attachment
Anna Ben-Hamou, Nicolas Broutin, Camille Cazaux
Uniform Central Limit Theorems for Degree Distributions of Sparse Graphon Models
Robert Lunde, Soumendra Lahiri
Matching Random Point Sets with Minimum Distortion
Itai Benjamini, Mark Braverman, Elad Tzalik et al.
Uniqueness and full coverage in k-neighbor graphs
David Coupier, Benoît Henry, Benedikt Jahnel et al.
Bass martingales need not stretch
Mathias Beiglböck, Manuel Hasenbichler, Gudmund Pammer
Universality of smallest singular values of random row submatrices and phase retrieval problems
Shu Wen, Christian E. Häggblom, Xiufan Yang