Skip to main content Accesibility Help
×
×
Home

Translation-Equivariant Matchings of Coin Flips on ℤ d

  • Terry Soo (a1)
Abstract

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.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Translation-Equivariant Matchings of Coin Flips on ℤ d
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Translation-Equivariant Matchings of Coin Flips on ℤ d
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Translation-Equivariant Matchings of Coin Flips on ℤ d
      Available formats
      ×
Copyright
Corresponding author
Postal address: Department of Mathematics, University of British Columbia, Vancouver BC, V6T 1Z2, Canada. Email address: tsoo@math.ubc.ca
References
Hide All
[1] Benjamini, I., Lyons, R., Peres, Y. and Schramm, O. (1999). Group-invariant percolation on graphs. Geom. Funct. Anal. 9, 2966.
[2] Ferrari, P. A., Landim, C. and Thorisson, H. (2004). Poisson trees, succession lines and coalescing random walks. Ann. Inst. H. Poincaré Prob. Statist. 40, 141152.
[3] Häggström, O. (1997). Infinite clusters in dependent automorphism invariant percolation on trees. Ann. Prob. 25, 14231436.
[4] Hoffman, C., Holroyd, A. E. and Peres, Y. (2006). A stable marriage of Poisson and Lebesgue. Ann. Prob. 34, 12411272.
[5] Hoffman, C., Holroyd, A. E. and Peres, Y. (2009). Tail bounds for the stable marriage of Poisson and Lebesgue. Canad. J. Math. 61, 12791299.
[6] 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, 14051425.
[7] Holroyd, A. E. and Peres, Y. (2003). Trees and matchings from point processes. Electron. Commun. Prob. 8, 1727.
[8] Holroyd, A. E. and Peres, Y. (2005). Extra heads and invariant allocations. Ann. Prob. 33, 3152.
[9] Holroyd, A. E., Pemantle, R., Peres, Y. and Schramn, O. (2009). Poisson matching. Ann. Inst. H. Poincaré Prob. Statist. 45, 266287.
[10] Meshalkin, L. (1959). A case of isomorphism of Bernouli schemes. Dokl. Akad. Nauk. SSSR 128, 4144.
[11] Nazarov, F., Sodin, M. and Volberg, A. (2007). Transportation to random zeroes by the gradient flow. Geom. Funct. Anal. 17, 887935.
[12] Timár, A. (2009). Invariant matchings of exponential tail on coin flips in Z d . Preprint. Available at http://arxiv.org/abs/0909.1009v1.
[13] Timár, A. (2004). Trees and grid factors for general point processes. Electron. Commun. Prob. 9, 5359.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Advances in Applied Probability
  • ISSN: 0001-8678
  • EISSN: 1475-6064
  • URL: /core/journals/advances-in-applied-probability
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords

MSC classification

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed