Mixing of the Aldous-Fill crossover chain via random switching networks

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(K\log L)$ steps and ask for $O(\log K\cdot\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_2\min(K,L)-3$ and, for fixed K ≥ 4, a constant times $\log L$.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-15
DOI
https://doi.org/10.5281/zenodo.24257129
Primary Topic
Markov Chains and Monte Carlo Methods
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Mixing of the Aldous-Fill crossover chain via random switching networks

Yitzchak Shmalo
Zenodo (CERN European Organization for Nuclear Research)
Markov Chains and Monte Carlo Methods
preprint

Mixing of the Aldous-Fill crossover chain via random switching networks

Yitzchak Shmalo
preprint en

Abstract

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(K\log L)$ steps and ask for $O(\log K\cdot\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_2\min(K,L)-3$ and, for fixed K ≥ 4, a constant times $\log L$.

Zenodo (CERN European Organization for Nuclear Research)
Hebrew University of Jerusalem (IL)
Markov Chains and Monte Carlo Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Mixing of the Aldous-Fill crossover chain via random switching networks — Yitzchak Shmalo · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS