Answers are grounded in this paper and cite their sources.
Aldous and Fill consider a chain on K binary words of length L: at each step the words are paired at random, and within each pair every letter position is exchanged with probability 1/2. They prove that it mixes in O(Klog L) steps and ask for O(log K·log L). We show that it mixes in O(log K+log L) steps. Given the pairings, the letter positions evolve independently, each pushed through the same random switching network, and Czumaj proved that almost every such network of logarithmic depth shuffles every 0–1 vector almost uniformly. We also prove the lower bounds log₂min(K,L)-3 and, for fixed K ≥ 4, a constant times log L.
No takes yet. Share an insight, caveat, or question.
Yitzchak Shmalo (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: