Hostname: page-component-cb9f654ff-9knnw Total loading time: 0 Render date: 2025-08-21T21:41:44.362Z Has data issue: false hasContentIssue false
  • English
  • Français

Translation-Equivariant Matchings of Coin Flips on ℤd

Part of: Stochastic processes Special processes

Published online by Cambridge University Press:  01 July 2016

Terry Soo
Terry Soo*
Affiliation:
University of British Columbia
*
∗ Postal address: Department of Mathematics, University of British Columbia, Vancouver BC, V6T 1Z2, Canada. Email address: tsoo@math.ubc.ca
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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, for every d ≥ 2, there exists a translation-equivariant perfect matching rule Φ such that EZ Φ 2/3-ε < ∞ for every ε > 0.

Keywords

MatchingBernoulli random field

MSC classification

Primary: 60G55: Point processes 60G60: Random fields
Secondary: 60K35: Interacting random processes; statistical mechanics type models; percolation theory

Information

Type
Stochastic Geometry and Statistical Applications
Information
Advances in Applied Probability , Volume 42 , Issue 1 , March 2010 , pp. 69 - 82
Copyright
Copyright © Applied Probability Trust 2010 

References

Benjamini, I., Lyons, R., Peres, Y. and Schramm, O. (1999). Group-invariant percolation on graphs. Geom. Funct. Anal. 9, 29–66.Google Scholar
Ferrari, P. A., Landim, C. and Thorisson, H. (2004). Poisson trees, succession lines and coalescing random walks. Ann. Inst. H. Poincaré Prob. Statist. 40, 141–152.Google Scholar
Häggström, O. (1997). Infinite clusters in dependent automorphism invariant percolation on trees. Ann. Prob. 25, 1423–1436.Google Scholar
Hoffman, C., Holroyd, A. E. and Peres, Y. (2006). A stable marriage of Poisson and Lebesgue. Ann. Prob. 34, 1241–1272.CrossRefGoogle Scholar
Hoffman, C., Holroyd, A. E. and Peres, Y. (2009). Tail bounds for the stable marriage of Poisson and Lebesgue. Canad. J. Math. 61, 1279–1299.Google Scholar
Holroyd, A. E. and Liggett, T. M. (2001). How to find an extra head: optimal random shifts of Bernoulli and Poisson random fields. Ann. Prob. 29, 1405–1425.Google Scholar
Holroyd, A. E. and Peres, Y. (2003). Trees and matchings from point processes. Electron. Commun. Prob. 8, 17–27.CrossRefGoogle Scholar
Holroyd, A. E. and Peres, Y. (2005). Extra heads and invariant allocations. Ann. Prob. 33, 31–52.Google Scholar
Holroyd, A. E., Pemantle, R., Peres, Y. and Schramn, O. (2009). Poisson matching. Ann. Inst. H. Poincaré Prob. Statist. 45, 266–287.CrossRefGoogle Scholar
Meshalkin, L. (1959). A case of isomorphism of Bernouli schemes. Dokl. Akad. Nauk. SSSR 128, 41–44.Google Scholar
Nazarov, F., Sodin, M. and Volberg, A. (2007). Transportation to random zeroes by the gradient flow. Geom. Funct. Anal. 17, 887–935.Google Scholar
Timár, A. (2009). Invariant matchings of exponential tail on coin flips in Z d . Preprint. Available at http://arxiv.org/abs/0909.1009v1.Google Scholar
Timár, A. (2004). Trees and grid factors for general point processes. Electron. Commun. Prob. 9, 53–59.CrossRefGoogle Scholar