# Extra heads and invariant allocations

@article{Holroyd2005ExtraHA, title={Extra heads and invariant allocations}, author={Alexander E. Holroyd and Yuval Peres}, journal={Annals of Probability}, year={2005}, volume={33}, pages={31-52} }

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 can select a (random) point Y of n such that translating n 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 n is a function of Π*. The key ingredient is a deterministic translation… Expand

#### 66 Citations

Invariant matchings of exponential tail on coin flips in $\Z^d$

- Mathematics
- 2009

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 to… Expand

A Stable Marriage of Poisson and Lebesgue

- Mathematics
- 2006

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 the… Expand

PR ] 1 4 O ct 2 00 5 A Stable Marriage of Poisson and Lebesgue

- 2005

Let Ξ be a discrete set in Rd. Call the elements of Ξ centers. The well-known Voronoi tessellation partitions Rd into polyhedral regions (of varying sizes) by allocating each site of Rd to the… Expand

A Poisson allocation of optimal tail

- Mathematics
- 2011

The allocation problem for a $d$-dimensional Poisson point process is to find a way to partition the space to parts of equal size, and to assign the parts to the configuration points in a measurable,… Expand

Point processes, cost, and the growth of rank in locally compact groups

- Mathematics
- 2021

Let G be a locally compact, second countable, unimodular group that is nondiscrete and noncompact. We explore the theory of invariant point processes on G. We show that every free probability measure… Expand

Poisson matching 1

- 2009

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… Expand

Stable transports between stationary random measures

- Mathematics
- 2016

We give an algorithm to construct a translation-invariant transport kernel between ergodic stationary random measures $\Phi$ and $\Psi$ on $\mathbb R^d$, given that they have equal intensities. As a… Expand

Poisson Matching

- Mathematics
- 2007

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… Expand

Unbiased shifts of Brownian motion

- Mathematics
- 2014

Let B = (B(t) :t∈R) be a two-sided standard Brownian motion. An unbiased shift of B is a random time T , which is a measurable function of B, such that (B(T +t) − B(T) :t∈R) is a Brownian motion… Expand

Shift-coupling of random rooted graphs and networks

- Mathematics
- 2017

In this paper, we present a result similar to the shift-coupling result of Thorisson (1996) in the context of random graphs and networks. The result is that a given random rooted network can be… Expand

#### References

SHOWING 1-10 OF 17 REFERENCES

How to Find an extra Head: Optimal Random Shifts of Bernoulli and Poisson Random Fields

- Mathematics
- 2001

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 are… Expand

A Stable Marriage of Poisson and Lebesgue

- Mathematics
- 2006

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 the… Expand

Group-invariant Percolation on Graphs

- Mathematics
- 1999

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 processes… Expand

Tagged Particle Distributions or How to Choose a Head at Random

- Mathematics
- 2002

Thorisson and others have proved results that imply the following: given an i.i.d. family of Bernoulli random variables indexed byZ d there exists an occupied siteX ∈Z d with the property that… Expand

Trees and Matchings from Point Processes

- Mathematics
- 2002

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 d… Expand

Transforming random elements and shifting random fields

- Mathematics
- 1996

Consider a locally compact second countable topological
transformation group acting measurably on an arbitrary space. We show that the
distributions of two random elements X and $X'$ in this space… Expand

Infinite clusters in dependent automorphism invariant percolation on trees

- Mathematics
- 1997

We study dependent bond percolation on the homogeneous tree T n of order n ≥ 2 under the assumption of automorphism invariance. Excluding a trivial case, we find that the number of infinite clusters… Expand

On time- and cycle-stationarity

- Mathematics
- 1995

Consider processes split into cycles by a sequence of random times (called points). The standard Palm relationship between stationary processes with cycles and processes with stationary cycles is… Expand

Foundations of modern probability

- Mathematics
- 1997

* Measure Theory-Basic Notions * Measure Theory-Key Results * Processes, Distributions, and Independence * Random Sequences, Series, and Averages * Characteristic Functions and Classical Limit… Expand

College Admissions and the Stability of Marriage

- Sociology
- 1962

A procedure for assigning applicants to colleges which removes all uncertainties and, assuming there are enough applicants, assigns to each college precisely its quota.