English

Distances between Random Orthogonal Matrices and Independent Normals

Probability 2017-04-19 v1

Abstract

Let Γn\Gamma_n be an n×nn\times n Haar-invariant orthogonal matrix. Let Zn Z_n be the p×qp\times q upper-left submatrix of Γn,\Gamma_n, where p=pnp=p_n and q=qnq=q_n are two positive integers. Let GnG_n be a p×qp\times q matrix whose pqpq entries are independent standard normals. In this paper we consider the distance between nZn\sqrt{n} Z_n and Gn G_n 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/npq/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)(p, q) sits on the curve pq=σnpq=\sigma n, where σ\sigma is a constant. However, it is different for the Euclidean distance, which goes to zero provided pq2/npq^2/n goes to zero, and not so if (p,q)(p,q) sits on the curve pq2=σn.pq^2=\sigma n. A previous work by Jiang \cite{Jiang06} shows that the total variation distance goes to zero if both p/np/\sqrt{n} and q/nq/\sqrt{n} go to zero, and it is not true provided p=cnp=c\sqrt{n} and q=dnq=d\sqrt{n} with cc and dd being constants. One of the above results confirms a conjecture that the total variation distance goes to zero as long as pq/n0pq/n\to 0 and the distance does not go to zero if pq=σnpq=\sigma n for some constant σ\sigma.

Keywords

Cite

@article{arxiv.1704.05205,
  title  = {Distances between Random Orthogonal Matrices and Independent Normals},
  author = {Tiefeng Jiang and Yutao Ma},
  journal= {arXiv preprint arXiv:1704.05205},
  year   = {2017}
}

Comments

42 pages

R2 v1 2026-06-22T19:19:44.155Z