Skip to content

Mallows Permutations and Finite Dependence

Research output: Contribution to journalArticle

Original languageEnglish
JournalAnnals of Probability
DateAccepted/In press - 30 Jan 2019

Abstract

We use the Mallows permutation model to construct a new family of stationary finitely dependent proper colorings of the integers. We prove that these colorings can be expressed as finitary factors of i.i.d. processes with finite mean coding radii. They are the first colorings known to have these properties. Moreover, we prove that the coding radii have exponential tails, and that the colorings can also be expressed as functions of countable-state Markov chains. We deduce analogous existence statements concerning shifts of finite type and higher-dimensional colorings.

Documents

Documents

  • Full-text PDF (accepted author manuscript)

    Rights statement: This is the accepted author manuscript (AAM). The final published version (version of record) is available online via Institute of Mathematical Statistics at [INSERT HYPERLINK] . Please refer to any applicable terms of use of the publisher.

    Accepted author manuscript, 783 KB, PDF document

    Embargo ends: 1/01/99

    Request copy

Links

View research connections

Related faculties, schools or groups