Hirofumi Shiba ретвитнул

Just posted a paper (with Aaron Smith) that solves the mixing time of Kac's walk on the rotation group; this walk was introduced by Hastings in his seminal paper in 1970 that started the MCMC revolution and is used in statistics, statistical physics, and cryptography, to name a few. Its mixing time has been open for decades. Even just a few months ago, I thought this problem was impossible! This problem has been studied by many people over the last 30 years. The main difficulty was that, as a community, we don't have the tools to study mixing time in continuous state spaces.
AI influence was key (GPT 5.4 pro) in our solution: it acted as a Rosetta Stone, translating ideas from another part of probability (Malliavin calculus) to Markov chains, and also pointed out a specific lemma from the literature that makes this translation work! Of course, the hard work was in verification. This also gives a genuinely new tool to study the mixing times of such constrained systems.
Very satisfying and grateful to be able to prove this result and be a part of this journey. I am more optimistic than ever about what's possible as the tools continue to get better. arxiv.org/abs/2604.23828
English




















