Distances between Random Orthogonal Matrices and Independent Normals

Abstract

Let n be an n× n Haar-invariant orthogonal matrix. Let Zn be the p× q upper-left submatrix of n, where p=pn and q=qn are two positive integers. Let Gn be a p× q matrix whose pq entries are independent standard normals. In this paper we consider the distance between n Zn and Gn in terms of the total variation distance, the Kullback-Leibler distance, the Hellinger distance and the Euclidean distance. We prove that each of the first three distances goes to zero as long as pq/n goes to zero, and not so this rate is sharp in the sense that each distance does not go to zero if (p, q) sits on the curve pq=σ n, where σ is a constant. However, it is different for the Euclidean distance, which goes to zero provided pq2/n goes to zero, and not so if (p,q) sits on the curve pq2=σ n. A previous work by Jiang Jiang06 shows that the total variation distance goes to zero if both p/n and q/n go to zero, and it is not true provided p=cn and q=dn with c and d being constants. One of the above results confirms a conjecture that the total variation distance goes to zero as long as pq/n 0 and the distance does not go to zero if pq=σ n for some constant σ.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…