Placeholder for random measures on the special orthogonal group, which encodes random -dimensional rotations. A special type of matrix random variate if you’d like.
Tiny random rotations
Notation: is the block direct sum.
Random Givens rotation
Givens rotations are useful. We can parameterize a Givens rotation by either an angle or a magnitude . The latter is slightly easier. Formally, a Givens rotation can be defined in any dimension by padding it with zeros and adding it to an identity matrix, but all the action happens over 4 entries, so we can learn how it works by examining a minimal rotation as a perturbation of the identity.
For fixed, let us define a rotation where is a deterministic constant and
Informally (because I do not have space or will to track lots of boring remainder terms) we note that for some fixed we have
If we want this to work in a higher dimension, we pad it like this:
Now, let us consider how to randomise these. If we fix two axes and a random we can construct a random Givens rotation. Suppose , small, and proceeding to do a sloppy Taylor expansion (which will, I assert, not matter in practice when take limits as but one should check this to be rigorous).
Doubly Random Givens rotation
If each Givens rotation is over a pair of distinct axes drawn uniformly at random, this will also give us a random rotation. Bookkeeping for these could be irritating, but let us see. wlog we can generate these by choosing the axes
Random rotation in an isotropic direction
Suppose is a Haar-distributed (i.e. uniform) random rotation. Then we can make a tiny incremental rotation using a construction of Chatterjee and Meckes (2008), by applying a small Given rotation in a randomly rotated coordinate frame. The result is a rotation in a random direction, but not far in that direction.
Then is a small random rotation. What can we say about this guy? Let be the matrix made of the first two columns of and . Then and .
Once again referring to Chatterjee and Meckes (2008) we see that the matrix satisfies For all , By the lemma on expectations of random rotations, .
\[\begin{aligned}
\mathrm{Q}^{\varepsilon}-\mathrm{I}
&\approx
\mathrm{Q}\left(
\mathrm{I}_{d}
+\left[\right] \oplus 0_{d-2}
\right)\mathrm{Q}^\top-\mathrm{I\
&=\mathrm{Q}\mathrm{Q}^\top
+\mathrm{Q}\left(\left[\right]
\oplus 0_{d-2}\right)\mathrm{Q}^\top -\mathrm{I\
&=\mathrm{Q}\left(\left[\right]
\oplus 0_{d-2}\right)\mathrm{Q}^\top\
&=\text{TBD}
\end{aligned}\]
TBC.
Sparse
We could desire a random rotation be sparse in a few senses, e.g. “ a random rotation in dimensions described by Givens rotations.” Things that fit this description are fairly easy to generate: we generate a small, possibly random, number of Givens rotations.
A useful context for me is to take something that is expected to be a rotation, but whose realisations are sparse.