English
Related papers

Related papers: Distances between Random Orthogonal Matrices and I…

200 papers

The topic of this paper is the asymptotic distribution of random orthogonal matrices distributed according to Haar measure. We examine the total variation distance between the joint distribution of the entries of $W_n$, the $p_n \times q_n$…

Probability · Mathematics 2019-02-01 Kathryn Stewart

We solve an open problem of Diaconis that asks what are the largest orders of $p_n$ and $q_n$ such that $Z_n,$ the $p_n\times q_n$ upper left block of a random matrix $\boldsymbol{\Gamma}_n$ which is uniformly distributed on the orthogonal…

Probability · Mathematics 2007-05-23 Tiefeng Jiang

In this work we study a version of the general question of how well a Haar distributed orthogonal matrix can be approximated by a random gaussian matrix. Here, we consider a gaussian random matrix $Y_n$ of order $n$ and apply to it the…

Probability · Mathematics 2016-11-11 Carlos E. González-Guillén , Carlos Palazuelos , Ignacio Villanueva

We show that the distance in total variation between $(\mathrm{Tr}\ U, \frac{1}{\sqrt{2}}\mathrm{Tr}\ U^2, \cdots, \frac{1}{\sqrt{m}}\mathrm{Tr}\ U^m)$ and a real Gaussian vector, where $U$ is a Haar distributed orthogonal or symplectic…

Probability · Mathematics 2021-03-08 Klara Courteaut , Kurt Johansson

Let $M$ be a random matrix in the orthogonal group $\O_n$, distributed according to Haar measure, and let $A$ be a fixed $n\times n$ matrix over $\R$ such that $\tr(AA^t)=n$. Then the total variation distance of the random variable…

Probability · Mathematics 2010-05-18 Elizabeth Meckes

Let ${\Gamma}_n$ be an $n\times n$ Haar-invariant orthogonal matrix. Let ${ Z}_n$ be the $p\times q$ upper-left submatrix of ${\Gamma}_n$ and ${G}_n$ be a $p\times q$ matrix whose $pq$ entries are independent standard normals, where $p$ and…

Probability · Mathematics 2025-04-16 Yutong Chen , Yutao Ma , Shuhong Xie , Zhuoya Yao

Let $V$ be an $n$-dimensional vector space over the finite field consisting of $q$ elements and let $\Gamma_{k}(V)$ be the Grassmann graph formed by $k$-dimensional subspaces of $V$, $1<k<n-1$. Denote by $\Gamma(n,k)_{q}$ the restriction of…

Combinatorics · Mathematics 2015-06-02 Mariusz Kwiatkowski , Mark Pankov

For any integer $m<n$, where $m$ can depend on $n$, we study the rate of convergence of $\frac{1}{\sqrt{m}}\mathrm{Tr} \mathbf{U}^m$ to its limiting Gaussian as $n\to\infty$ for orthogonal, unitary and symplectic Haar distributed random…

Probability · Mathematics 2022-04-08 Klara Courteaut , Kurt Johansson , Gaultier Lambert

We show that the Euclidean distance degree of a real orthogonally invariant matrix variety equals the Euclidean distance degree of its restriction to diagonal matrices. We illustrate how this result can greatly simplify calculations in…

Optimization and Control · Mathematics 2016-01-28 Dmitriy Drusvyatskiy , Hon-Leung Lee , Giorgio Ottaviani , Rekha R. Thomas

Let $X_1,X_2,\ldots$ be a sequence of i.i.d. random variables, with mean zero and variance one. Let $W_n=(X_1+\ldots+X_n)/\sqrt{n}$. An old and celebrated result of Prohorov asserts that $W_n$ converges in total variation to the standard…

Probability · Mathematics 2014-12-30 Ivan Nourdin , Guillaume Poly

The Ulam distance of two permutations on $[n]$ is $n$ minus the length of their longest common subsequence. In this paper, we show that for every $\varepsilon>0$, there exists some $\alpha>0$, and an infinite set $\Gamma\subseteq…

Information Theory · Computer Science 2024-05-14 Elazar Goldenberg , Mursalin Habib , Karthik C. S

Consider a classical system, which is in the state described by probability distribution $p$ or $q$, and embed these classical informations into quantum system by a physical map $\Gamma$, $\rho=\Gamma(p)$ and $\sigma=\Gamma(q)$.…

Quantum Physics · Physics 2025-07-03 Keiji Matsumoto

Let F be a commutative field of characteristic 0, G_n: F^n \times F^n -> F, G_n((x_1,...,x_n),(y_1,...,y_n))=(x_1-y_1)^2+...+(x_n-y_n)^2. We say that g:R^n->F^n preserves distance d>=0 if for each x,y \in R^n |x-y|=d implies…

Metric Geometry · Mathematics 2007-05-23 Apoloniusz Tyszka

Let P and Q be two probability distributions which differ only for values with non-zero probability. We show that the variational distance between the n-fold product distributions P^n and Q^n cannot grow faster than the square root of n.

Information Theory · Computer Science 2007-07-13 Renato Renner

We study the distribution of the {\it matrix product} $G_1 G_2 \cdots G_r$ of $r$ independent Gaussian matrices of various sizes, where $G_i$ is $d_{i-1} \times d_i$, and we denote $p = d_0$, $q = d_r$, and require $d_1 = d_{r-1}$. Here the…

Probability · Mathematics 2021-08-24 Yi Li , David P. Woodruff

We show how the Riemannian distance on $\mathbb{S}^n_{++}$, the cone of $n\times n$ real symmetric or complex Hermitian positive definite matrices, may be used to naturally define a distance between two such matrices of different…

Numerical Analysis · Mathematics 2018-06-06 Lek-Heng Lim , Rodolphe Sepulchre , Ke Ye

This work considers the problem of estimating the distance between two covariance matrices directly from the data. Particularly, we are interested in the family of distances that can be expressed as sums of traces of functions that are…

Machine Learning · Computer Science 2024-09-19 Roberto Pereira , Xavier Mestre , Davig Gregoratti

We study the Hermitian distance degree, a real enumerative invariant counting critical points of the squared Hermitian distance function, for matrix varieties invariant under left and right unitary actions. For such a variety \(M \subset…

Algebraic Geometry · Mathematics 2026-02-13 Nikhil Ken

We consider various notions of strains; quantitative measures for the deviation of a linear transformation from an isometry. The main approach, which is motivated by physical applications and follows the work of Patrizio Neff and co-workers…

Differential Geometry · Mathematics 2018-06-01 Raz Kupferman , Asaf Shachar

We show that computing the total variation distance between two product distributions is $\#\mathsf{P}$-complete. This is in stark contrast with other distance measures such as Kullback-Leibler, Chi-square, and Hellinger, which tensorize…

Computational Complexity · Computer Science 2024-05-15 Arnab Bhattacharyya , Sutanu Gayen , Kuldeep S. Meel , Dimitrios Myrisiotis , A. Pavan , N. V. Vinodchandran
‹ Prev 1 2 3 10 Next ›