Translation-Equivariant Matchings of Coin Flips on ℤ d

@article{Soo2010TranslationEquivariantMO,
  title={Translation-Equivariant Matchings of Coin Flips on ℤ d},
  author={Terry Soo},
  journal={Advances in Applied Probability},
  year={2010},
  volume={42},
  pages={69 - 82}
}
  • Terry Soo
  • Published 2010
  • Mathematics
  • Advances in Applied Probability
Consider independent fair coin flips at each site of the lattice ℤ d . A translation-equivariant matching rule is a perfect matching of heads to tails that commutes with translations of ℤ d and is given by a deterministic function of the coin flips. Let Z Φ be the distance from the origin to its partner, under the translation-equivariant matching rule Φ. Holroyd and Peres (2005) asked, what is the optimal tail behaviour of Z Φ for translation-equivariant perfect matching rules? We prove that… Expand
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
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
Poisson splitting by factors
Given a homogeneous Poisson process on ℝd with intensity λ, we prove that it is possible to partition the points into two sets, as a deterministic function of the process, and in anExpand
Factors of IID on Trees
  • R. Lyons
  • Computer Science, Mathematics
  • Combinatorics, Probability and Computing
  • 2016
TLDR
This work presents some illustrative results and open questions on free groups, which are particularly interesting in combinatorics, statistical physics and probability, and includes bounds on minimum and maximum bisection for random cubic graphs that improve on all past bounds. Expand
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
Poisson allocations with bounded connected cells
Given a homogenous Poisson point process in the plane, we prove that it is possible to partition the plane into bounded connected cells of equal volume, in a translation-invariant way, with eachExpand
The orbital equivalence of Bernoulli actions and their Sinai factors
Given a countable amenable group G and 0 < L < 1, we give an elementary construction of a type-III:L Bernoulli group action. In the case where G is the integers, we show that our nonsingularExpand

References

SHOWING 1-10 OF 19 REFERENCES
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
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 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. ForExpand
Tree and Grid factors of General Point processes
We study isomorphism invariant point processes of $R^d$ whose groups of symmetries are almost surely trivial. We define a 1-ended, locally finite tree factor on the points of the process, that is, aExpand
Infinite clusters in dependent automorphism invariant percolation on trees
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 clustersExpand
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
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
Transforming random elements and shifting random fields
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 spaceExpand
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
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
...
1
2
...