How many entries of a typical orthogonal matrix can be approximated by independent normals?

From MaRDI portal
Publication:850976

DOI10.1214/009117906000000205zbMATH Open1107.15018arXivmath/0601457OpenAlexW2089817321MaRDI QIDQ850976FDOQ850976


Authors: Tiefeng Jiang Edit this on Wikidata


Publication date: 8 November 2006

Published in: The Annals of Probability (Search for Journal in Brave)

Abstract: We solve an open problem of Diaconis that asks what are the largest orders of pn and qn such that Zn, the pnimesqn upper left block of a random matrix which is uniformly distributed on the orthogonal group O(n), can be approximated by independent standard normals? This problem is solved by two different approximation methods. First, we show that the variation distance between the joint distribution of entries of Zn and that of pnqn independent standard normals goes to zero provided pn=o(sqrtn) and qn=o(sqrtn). We also show that the above variation distance does not go to zero if pn=[xsqrtn] and qn=[ysqrtn] for any positive numbers x and y. This says that the largest orders of pn and qn are o(n1/2) in the sense of the above approximation. Second, suppose is generated by performing the Gram--Schmidt algorithm on the columns of , where yij;1leqi,jleqn are i.i.d. standard normals. We show that epsilonn(m):=max1leqileqn,1leqjleqm|sqrtncdotgammaijyij| goes to zero in probability as long as m=mn=o(n/logn). We also prove that epsilonn(mn)o2sqrtalpha in probability when mn=[nalpha/logn] for any alpha>0. This says that mn=o(n/logn) is the largest order such that the entries of the first mn columns of can be approximated simultaneously by independent standard normals.


Full work available at URL: https://arxiv.org/abs/math/0601457




Recommendations




Cites Work


Cited In (37)





This page was built for publication: How many entries of a typical orthogonal matrix can be approximated by independent normals?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q850976)