Related papers: Matrix Kloosterman Sums, Random Matrix Statistics,…

Random feature maps are ubiquitous in modern statistical machine learning, where they generalize random projections by means of powerful, yet often difficult to analyze nonlinear operators. In this paper, we leverage the "concentration"…

By combining the one-way coupled chaotic map lattice system with a bit-reverse operation, we construct a new cryptosystem which is extremely sensitive to the system parameters even for low-dimensional systems. The security of this new…

Riemannian Gaussian distributions were initially introduced as basic building blocks for learning models which aim to capture the intrinsic structure of statistical populations of positive-definite matrices (here called covariance…

We study planted problems---finding hidden structures in random noisy inputs---through the lens of the sum-of-squares semidefinite programming hierarchy (SoS). This family of powerful semidefinite programs has recently yielded many new…

Exact evaluation of $<{\rm Tr} S^p>$ is here performed for real symmetric matrices $S$ of arbitrary order $n$, up to some integer $p$, where the matrix entries are independent identically distributed random variables, with an arbitrary…

Given a random quantum state of multiple distinguishable or indistinguishable particles, we provide an effective method, rooted in symplectic geometry, to compute the joint probability distribution of the eigenvalues of its one-body reduced…

We return to some past studies of hyperkloosterman sums ([9,10]) via $p$-adic cohomology with an aim to improve earlier results. In particular, we work here with Dwork's $\theta_\infty$-splitting function and a better choice of basis for…

We study $\textit{sparse singular value certificates}$ for random rectangular matrices. If $M$ is an $n \times d$ matrix with independent Gaussian entries, we give a new family of polynomial-time algorithms which can certify upper bounds on…

This paper considers the problem of testing for latent structure in large symmetric data matrices. The goal here is to develop statistically principled methodology that is flexible in its applicability, computationally efficient, and…

The well known Erdos-Turan law states that the logarithm of an order of a random permutation is asymptotically normally distributed. The aim of this work is to estimate convergence rate in this theorem and also to prove analogous result for…

Random matrix theory has played an important role in recent work on statistical network analysis. In this paper, we review recent results on regimes of concentration of random graphs around their expectation, showing that dense graphs…

In this short note we collect together known results on the use of Random Matrix Theory in lattice statistical mechanics. The purpose here is two fold. Firstly the RMT analysis provides an intrinsic characterization of integrability, and…

We investigate concentration properties of spectral measures of Hermitian random matrices with partially dependent entries. More precisely, let $X_n$ be a Hermitian random matrix of size $n\times n$ that can be split into independent blocks…

We prove that if $\omega$ is uniformly distributed on $[0,1]$, then as $T\to\infty$, $t\mapsto \zeta(i\omega T+it+1/2)$ converges to a non-trivial random generalized function, which in turn is identified as a product of a very well behaved…

Let $c_q(n)$ be the Ramanujan sums and let $S(m,n;q)$ be the Kloosterman sums. We study the eigenvalues of $q \times q$ matrices whose $(m,n)$ entry is $c_q (m-n)$ or $S(m,n;q)$ where $q$ is a fixed positive integer. We also study the…

The paper studies the spectral properties of large Wigner, band and sample covariance random matrices with heavy tails of the marginal distributions of matrix entries.

In this paper we prove the concavity of the $k$-trace functions, $A\mapsto (\text{Tr}_k[\exp(H+\ln A)])^{1/k}$, on the convex cone of all positive definite matrices. $\text{Tr}_k[A]$ denotes the $k_{\mathrm{th}}$ elementary symmetric…

For a positive integer $m$ and a subgroup $\Lambda$ of the unit group $(\mathbb{Z}/m\mathbb{Z})^\times$, the corresponding generalized Kloosterman sum is the function $K(a,b,m,\Lambda) = \sum_{u \in \Lambda}e(\frac{au + bu^{-1}}{m})$.…

For fixed $l,m \ge 1$, let $\mathbf{X}_n^{(0)},\mathbf{X}_n^{(1)},\dots,\mathbf{X}_n^{(l)}$ be independent random $n \times n$ matrices with independent entries, let $\mathbf{F}_n^{(0)} := \mathbf{X}_n^{(0)} (\mathbf{X}_n^{(1)})^{-1} \cdots…

Many aspects of the asymptotics of Plancherel distributed partitions have been studied in the past fifty years, in particular the limit shape, the distribution of the longest rows, connections with random matrix theory and characters of the…