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 language | English (US) |
---|---|
Pages (from-to) | 983-1001 |
Number of pages | 19 |
Journal | Annales de l'institut Henri Poincare (B) Probability and Statistics |
Volume | 56 |
Issue number | 2 |
DOIs | |
State | Published - 2020 |
All Science Journal Classification (ASJC) codes
- Statistics and Probability
- Statistics, Probability and Uncertainty
Keywords
- Contingency table
- Cutoff
- Mixing time
- Random graphs