Related papers: On the Gaussian approximation of vector-valued mul…
We consider a random matrix whose entries are independent Gaussian variables taking values in the field of quaternions with variance $1/n$. Using logarithmic potential theory, we prove the almost sure convergence, as the dimension $n$ goes…
Choose n random, independent points in R^d according to a fixed distribution. The convex hull of these points is a random polytope. In some cases, central limit theorems have been proven for the components of f-vectors of random polytopes…
Our article considers a Gaussian variational approximation of the posterior density in a high-dimensional state space model. The variational parameters to be optimized are the mean vector and the covariance matrix of the approximation. The…
While Bayesian methods are extremely popular in statistics and machine learning, their application to massive datasets is often challenging, when possible at all. Indeed, the classical MCMC algorithms are prohibitively slow when both the…
We prove that the determinant of a Gaussian-correlation matrix V of n evenly spaced points has leading power n(n-1) in the nearest-neighbor distance between points. The proof uses Neville elimination to determine all elements of the upper…
Optimal transport has found widespread applications in signal processing and machine learning. Among its many equivalent formulations, optimal transport seeks to reconstruct a random variable/vector with a prescribed distribution at the…
A finite quantum system evolving unitarily equilibrates in a probabilistic fashion. In the general many-body setting the time-fluctuations of an observable \mathcal{A} are typically exponentially small in the system size. We consider here…
Bayesian inference has many advantages for complex models, but standard Monte Carlo methods for summarizing the posterior can be computationally demanding, and it is attractive to consider optimization-based variational methods. Our work…
We give a necessary and sufficient condition for symmetric infinitely divisible distribution to have Gaussian component. The result can be applied to approximation the distribution of finite sums of random variables. Particularly, it shows…
Consider a doubly-infinite array of iid centered variables with moment conditions, from which one can extract a finite number of rectangular, overlapping submatrices, and form the corresponding Wishart matrices. We show that under basic…
We show that the multiple divisor functions of integers in invertible residue classes modulo a prime number, as well as the Fourier coefficients of GL(N) Maass cusp forms for all N larger than 2, satisfy a central limit theorem in a…
Random hyperspherical harmonics are Gaussian Laplace eigenfunctions on the unit $d$-dimensional sphere ($d\ge 2$). We study the convergence in Total Variation distance for their nonlinear statistics in the high energy limit, i.e., for…
We consider versions of the FIND algorithm where the pivot element used is the median of a subset chosen uniformly at random from the data. For the median selection we assume that subsamples of size asymptotic to $c \cdot n^\alpha$ are…
Let $G$ be an $N \times N$ real matrix whose entries are independent identically distributed standard normal random variables $G_{ij} \sim \mathcal{N}(0,1)$. The eigenvalues of such matrices are known to form a two-component system…
Nearest neighbor cells in $R^d,d\in\mathbb{N}$, are used to define coefficients of divergence ($\phi$-divergences) between continuous multivariate samples. For large sample sizes, such distances are shown to be asymptotically normal with a…
We consider the problem of estimating the mean of a random vector based on $N$ independent, identically distributed observations. We prove the existence of an estimator that has a near-optimal error in all directions in which the variance…
In this note, we give a simple derivation of the formula obtained in Dowson and Landau (1982), Olkin and Pukelsheim (1982) and Givens and Shortt (1984) for the quadratic Wasserstein distance between two Gaussian distributions on $\R^d$ with…
This paper addresses the question of when projections of a high-dimensional random vector are approximately Gaussian. This problem has been studied previously in the context of high-dimensional data analysis, where the focus is on…
Let $X_1,\dots, X_n,\dots$ be i.i.d.\ $d$-dimensional random vectors with common distribution $F$. Then $S_n = X_1+\dots+X_n$ has distribution $F^n$ (degree is understood in the sense of convolution). Let $$ \rho_{\mathcal{C}_d}(F,G) =…
Suppose X is a random vector, that is distributed uniformly in some n-dimensional convex set. It was conjectured that when the dimension n is very large, there exists a non-zero vector u, such that the distribution of the real random…