Random rotations

May 17, 2021 — December 1, 2021

algebra
functional analysis
geometry
high d
linear algebra
measure
probability
signal processing
sparser than thou
spheres
Figure 1

Placeholder for random measures on the special orthogonal group, which encodes random d-dimensional rotations. A special type of matrix random variate if you’d like.

1 Uniform random rotations

Key word: Haar measure.

Chatterjee and Meckes () gives us a useful lemma describing the moments of a random rotation:

If U=[uij]i,j=1n is an orthogonal matrix distributed according to Haar measure, then E[uijkij] is non-zero if and only if the number of entries from each row and from each column is even. Second and fourth-degree moments are as follows:

  1. For all i,j, E[uij2]=1n
  2. For all i,j,r,s,α,β,λ,μ, E[uijursuαβuλμ]=1(n1)n(n+2)[δirδαλδjβδsμ+δirδαλδjμδsβ+δiαδrλδjsδβμ+δiαδrλδjμδβs+δiλδrαδjsδβμ+δiλδrαδjβδsμ]+n+1(n1)n(n+2)[δirδαλδjsδβμ+δiαδrλδjβδsμ+δiλδrαδjμδsβ]

Let HOn be distributed according to Haar measure. Then E[hijhklhmnhpq] is only non-zero if there are an even number of entries from each row and each column. Fourth-order mixed moments are as follows. (i) E[h112h122]=1n(n+2) (ii) E[h112h222]=n+1(n1)n(n+2) (iii) E[h11h12h21h22]=1(n1)n(n+2), and (iv) E[(hi1hi2hi2hi1)(hj1hj2hj2hj1)]=2n(n1)[δijδijδijδij], where ii and jj

2 Tiny random rotations

Notation: is the block direct sum.

2.1 Random Givens rotation

Givens rotations are useful. We can parameterize a Givens rotation A(t) by either an angle t=θ or a magnitude t=ϵ=sinθ. The latter is slightly easier. Formally, a Givens rotation can be defined in any dimension d2 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 2×2 rotation as a perturbation of the identity.

For 1t1 fixed, let us define a rotation A(t)=[1t2tt1t2]=I2+[t22+δttt22+δ] where δ is a deterministic constant and δ=O(t4).

Informally (because I do not have space or will to track lots of boring remainder terms) we note that for some fixed x=[x1x2] we have A(t)xxA(t)(x12+2tx1x2+t2(x12+x22)x1x22t2x1x2+t(x12+x22)x1x22t2x1x2+t(x12+x22)2tx1x2+x22+t2(x12x22))=xx+(2x1x2x12+x22x12+x222x1x2)t+(x12+x222x1x22x1x2x12x22)t2

If we want this to work in a higher dimension, we pad it like this: A(t)=[1t2tt1t2]Id2=Id+[t22+δttt22+δ]0d2

Now, let us consider how to randomise these. If we fix two axes and a random t we can construct a random Givens rotation. Suppose E[t]=0, var(t)=ε2 small, and proceeding to do a sloppy Taylor expansion (which will, I assert, not matter in practice when take limits as t0 but one should check this to be rigorous). E[A(t)x]E[(x1+tx2t2x12x2tx1t2x22)]=xE[t2]x.

E[A(t)xxA(t)]E[xx+(2x1x2x12+x22x12+x222x1x2)t+(x12+x222x1x22x1x2x12x22)t2]=xx+(x12+x222x1x22x1x2x12x22)E[t2]

2.2 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 iU({1,2,,n1},jU({i+1,i,,n}.

2.3 Random rotation in an isotropic direction

Suppose Q is a Haar-distributed (i.e. uniform) random rotation. Then we can make a tiny incremental rotation using a construction of Chatterjee and Meckes (), 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 Qε:=QAεQ is a small random rotation. What can we say about this guy? Let Q1:2 be the d×2 matrix made of the first two columns of Q and C2=[0110]. Then Qε=ϵ[(ϵ2+ϵ1δ)Q1:2Q1:2+Q1:2C2Q1:2] and ϵ1δ=O(ϵ3).

Once again referring to Chatterjee and Meckes () we see that the matrix M=[mij]i,j=1n=M1:2C2M1:2 satisfies mij=ui1uj2ui2uj1. For all i,j,,p, E[mijmp]=2n(n1)[δiδjpδipδj] By the lemma on expectations of random rotations, E[Q1:2Q1:2]=2nI.

\[\begin{aligned} \mathrm{Q}^{\varepsilon}-\mathrm{I} &\approx \mathrm{Q}\left( \mathrm{I}_{d} +\left[ε22εεε22\right] \oplus 0_{d-2} \right)\mathrm{Q}^\top-\mathrm{I\ &=\mathrm{Q}\mathrm{Q}^\top +\mathrm{Q}\left(\left[ε22εεε22\right] \oplus 0_{d-2}\right)\mathrm{Q}^\top -\mathrm{I\ &=\mathrm{Q}\left(\left[ε22εεε22\right] \oplus 0_{d-2}\right)\mathrm{Q}^\top\ &=\text{TBD} \end{aligned}\]

TBC.

3 Sparse

We could desire a random rotation be sparse in a few senses, e.g. “ a random rotation in D dimensions described by ND 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.

4 References

Barthe, Guedon, Mendelson, et al. 2005. A Probabilistic Approach to the Geometry of the pn-Ball.” The Annals of Probability.
Chatterjee, and Meckes. 2008. Multivariate Normal Approximation Using Exchangeable Pairs.” arXiv:math/0701464.
Chikuse. 2003. High Dimensional Asymptotic Theorems.” In Statistics on Special Manifolds.
Chikuse, and 筑瀬. 2003. Statistics on Special Manifolds.
Christensen. 1970. On Some Measures Analogous to Haar Measure. MATHEMATICA SCANDINAVICA.
Kaneko, Fiori, and Tanaka. 2013. Empirical Arithmetic Averaging Over the Compact Stiefel Manifold.” IEEE Transactions on Signal Processing.
Kar, and Karnick. 2012. Random Feature Maps for Dot Product Kernels.” In Artificial Intelligence and Statistics.
Meckes. 2012. Approximation of Projections of Random Vectors.” Journal of Theoretical Probability.
Stam. 1982. Limit Theorems for Uniform Distributions on Spheres in High-Dimensional Euclidean Spaces.” Journal of Applied Probability.