Efficient, local and symmetric Markov chains that generate one-factorizations

M. Dotan, N. Linial, Y. Peled*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

It is well known that for every even integer n, the complete graph Kn has a one-factorization, namely a proper edge coloring with n- 1 colors. Unfortunately, not much is known about the possible structure of large one-factorizations. Also, at present we have only woefully few explicit constructions of large one-factorizations. In particular, we know essentially nothing about the typical properties of one-factorizations for large n. In this view, it is desirable to find rapidly mixing Markov chains that generate one-factorizations uniformly and efficiently. No such Markov chain is currently known, and here we take a step this direction.We construct a Markov chain whose states are all edge colorings of Kn by n- 1 colors. This chain is invariant under arbitrary renaming of the vertices or the colors. It reaches a one factorization in polynomial(n) steps from every starting state. In addition, at every transition only O(n) edges change their color. We also raise some related questions and conjectures, and present results of numerical simulations of simpler variants of this Markov chain.

Original languageAmerican English
Pages (from-to)557-568
Number of pages12
JournalActa Mathematica Hungarica
Volume161
Issue number2
DOIs
StatePublished - 1 Aug 2020

Bibliographical note

Publisher Copyright:
© 2020, Akadémiai Kiadó, Budapest, Hungary.

Keywords

  • Markov chain
  • one-factorization

Fingerprint

Dive into the research topics of 'Efficient, local and symmetric Markov chains that generate one-factorizations'. Together they form a unique fingerprint.

Cite this