Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T09:01:11.349Z Has data issue: false hasContentIssue false

Translation-Equivariant Matchings of Coin Flips on ℤd

Published online by Cambridge University Press:  01 July 2016

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.

Information

Type
Stochastic Geometry and Statistical Applications
Copyright
Copyright © Applied Probability Trust 2010