Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Cut-off phenomenon in the uniform plane Kac walk (1211.2031v2)

Published 9 Nov 2012 in math.PR, math.CV, and math.RT

Abstract: We consider an analogue of the Kac random walk on the special orthogonal group $SO(N)$, in which at each step a random rotation is performed in a randomly chosen 2-plane of $\bRN$. We obtain sharp asymptotics for the rate of convergence in total variance distance, establishing a cut-off phenomenon in the large $N$ limit. In the special case where the angle of rotation is deterministic this confirms a conjecture of Rosenthal \cite{Rosenthal}. Under mild conditions we also establish a cut-off for convergence of the walk to stationarity under the $L2$ norm. Depending on the distribution of the randomly chosen angle of rotation, several surprising features emerge. For instance, it is sometimes the case that the mixing times differ in the total variation and $L2$ norms. Our estimates use an integral representation of the characters of the special orthogonal group together with saddle point analysis.

Citations (14)

Summary

We haven't generated a summary for this paper yet.