Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2025/iii/paper-215/4/b/ii/solution
Past exam of the mathematics course of the University of Cambridge 2025 iii Paper 215 4 b ii Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
Writewhere traverses the added perfect matching. The standard rare-transition robustness theorem for reversible chains says that when , adding a bounded-degree kernel at rate cannot create cutoff: if the original chain's mixing window is a nonvanishing fraction of its mixing time, the perturbed chain retains such a window. The proof couples the chains between matching jumps; the geometric waiting time for those jumps has mean and nonconcentrated fluctuations, while the segments retain the original noncutoff profile. Therefore cutoff of would imply cutoff of , contrary to hypothesis. Hence does not exhibit cutoff.
New to topics? Read the docs here!