Corpus ID: 1130645

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

@article{Timr2009InvariantMO,
  title={Invariant matchings of exponential tail on coin flips in \$\Z^d\$},
  author={{\'A}d{\'a}m Tim{\'a}r},
  journal={arXiv: Probability},
  year={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 find such matching rules that make the probability that the pair of the origin is at distance greater than $r$ decay as fast as possible. For two dimensions, we give a matching of decay $cr^{1/2}$, which is optimal. For dimension at least 3 we give a matching rule that has an exponential tail. This… Expand

Figures from this paper

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 matching 1
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
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
Translation-Equivariant Matchings of Coin Flips on ℤ d
  • Terry Soo
  • Mathematics
  • Advances in Applied Probability
  • 2010
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 isExpand
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
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
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
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
Finitary codings for spatial mixing Markov random fields
It has been shown by van den Berg and Steif that the sub-critical and critical Ising model on $\mathbb{Z}^d$ is a finitary factor of an i.i.d. process (ffiid), whereas the super-critical model isExpand
Factor of iid Schreier decoration of transitive graphs
A Schreier decoration is a combinatorial coding of an action of the free group Fd on the vertex set of a 2d-regular graph. We investigate whether a Schreier decoration exists on various countablyExpand
...
1
2
...

References

SHOWING 1-10 OF 22 REFERENCES
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
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
Translation-invariant Matchings of Coin-flips on Z
Consider independent fair coin flips at each site of the lattice Z d. We study non-randomized translation-invariant perfect matching rules of occupied sites to unoccupied sites and determine boundsExpand
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
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
Optimal Flow through the Disordered Lattice 1
Consider routing traffic on the N × N torus, simultaneously between all source-destination pairs, to minimize the cost e c(e)f 2 (e), where f (e) is the volume of flow across edge e and the c(e) formExpand
Characterization of Palm measures via bijective point-shifts
The paper considers a stationary point process N in R d . A point-map picks a point of N in a measurable way. It is called bijective [Thorisson, H. (2000). Coupling, Stationarity, and Regeneration.Expand
Matching theorems and empirical discrepancy computations using majorizing measures
We give explicit constructions of certain majorizing measures. These constructions allow us to give a unified proof of deep matching theorems of Ajtai, Komlbs, and Tusnady, of Leighton and Shor, andExpand
Gravitational allocation to Poisson points
For d ≥ 3, we construct a non-randomized, fair and translationequivariant allocation of Lebesgue measure to the points of a standard Poisson point process in R d , defined by allocating to each ofExpand
Optimal flow through the disordered lattice
Author(s): Aldous, D | Abstract: Consider routing traffic on the N × N torus, simultaneously between all source-destination pairs, to minimize the cost ∑ec(e)f 2(e). where f(e) is the volume of flowExpand
...
1
2
3
...