On the mixing time of the Diaconis-Gangolli random walk on contingency tables over Z/qZ

Evita Nestoridi, Oanh Nguyen

Research output: Contribution to journalArticlepeer-review

Abstract

The Diaconis-Gangolli random walk is an algorithm that generates an almost uniform random graph with prescribed degrees. In this paper, we study the mixing time of the Diaconis-Gangolli random walk restricted on n × n contingency tables over Z/qZ. We prove that the random walk exhibits cutoff at (Equation presented) log n, when log (Equation presented).

Original languageEnglish (US)
Pages (from-to)983-1001
Number of pages19
JournalAnnales de l'institut Henri Poincare (B) Probability and Statistics
Volume56
Issue number2
DOIs
StatePublished - Jan 1 2020

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Statistics, Probability and Uncertainty

Keywords

  • Contingency table
  • Cutoff
  • Mixing time
  • Random graphs

Fingerprint Dive into the research topics of 'On the mixing time of the Diaconis-Gangolli random walk on contingency tables over Z/qZ'. Together they form a unique fingerprint.

Cite this