probability-statistics / Markov chain mixing
Kac's walk on the rotation group, introduced by Hastings in 1970, is a central high-dimensional Markov chain in statistical physics and computational science. The paper proves it mixes in $n^2 \log n$ steps, the conjectured optimal rate, closing the gap left by a long line of successive improvements.
Temporal state
No reconciled state yet.
Append-only history
Kac's walk on the rotation group, introduced by Hastings in 1970, is a central high-dimensional Markov chain in statistical physics and computational science. The paper proves it mixes in $n^2 \log n$ steps, the conjectured optimal rate, closing the gap left by a long line of successive improvements.
Research memory
Kac's walk on the rotation group, introduced by Hastings in 1970, is a central high-dimensional Markov chain in statistical physics and computational science. The paper proves it mixes in $n^2 \log n$ steps, the conjectured optimal rate, closing the gap left by a long line of successive improvements.
Evidence graph
No public relationships recorded yet.