相关论文: Universality in Random Matrix Theory for orthogona…

Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…

We give a formula for the universal R-matrix of the quantized universal enveloping algebra $U_q(\g).$ This is similar to a previous formula due to Kirillov-Reshetikhin and Levendorskii-Soibelman, except that where they use the action of the…

It is shown that a $N\times N$ real symmetric [complex hermitian] positive definite matrix $V$ is congruent to a diagonal matrix modulo a pseudo-orthogonal [pseudo-unitary] matrix in $SO(m,n)$ [ $SU(m,n)$], for any choice of partition…

We consider non-Gaussian extensions of the elliptic Ginibre ensemble of complex non-Hermitian random matrices by fixing the trace $\operatorname{Tr}(XX^*)$ of the matrix $X$ with a hard or soft constraint. These ensembles have correlated…

We establish asymptotic formulae for general joint moments of characteristic polynomials and their higher-order derivatives associated with matrices drawn randomly from the groups $\mathrm{USp}(2N)$ and $\mathrm{SO}(2N)$ in the limit as…

In this paper, we provide an $O(n \mathrm{polylog} n)$ bound on the expected complexity of the randomly weighted Voronoi diagram of a set of $n$ sites in the plane, where the sites can be either points, interior-disjoint convex sets, or…

We show that the monotonicity conjecture of Merriss and Watkins is true in average when taking the set of matrices of given non negative spectra as probability space with respect to the Haar measure of the unitarian group .

We propose a gauge model where quark-lepton universality is an accidental symmetry which is only approximate, in analogy to the well-accepted notion that strong isospin is accidental and approximate. This is a natural framework for…

We find a sharp combinatorial bound for the metric entropy of sets in R^n and general classes of functions. This solves two basic combinatorial conjectures on the empirical processes. 1. A class of functions satisfies the uniform Central…

We study shallow and deep neural networks whose inputs range over a general topological space. The model is built from a prescribed family of continuous feature maps and reduces to multilayer feedforward networks in the Euclidean case. We…

This work is a companion paper of Gamboa, Nagel, Rouault (J. Funct. Anal. 2016). We continue to explore the connections between large deviations for random objects issued from random matrix theory and sum rules. Here, we are concerned…

Products and sums of random matrices have seen a rapid development in the past decade due to various analytical techniques available. Two of these are the harmonic analysis approach and the concept of polynomial ensembles. Very recently, it…

We obtain Plancherel-Rotach type asymptotics valid in all regions of the complex plane for orthogonal polynomials with varying weights of the form $e^{-NV(x)}$ on the real line, assuming that $V$ has only two Lipschitz continuous…

We prove a \emph{query complexity} lower bound on rank-one principal component analysis (PCA). We consider an oracle model where, given a symmetric matrix $M \in \mathbb{R}^{d \times d}$, an algorithm is allowed to make $T$ \emph{exact}…

We consider the eigenvalues of non-Hermitian random matrices in the symmetry class of the symplectic Ginibre ensemble, which are known to form a Pfaffian point process in the plane. It was recently discovered that the limiting correlation…

In this paper, we prove a necessary and sufficient condition for Tracy-Widom law of Wigner matrices. Consider $N \times N$ symmetric Wigner matrices $H$ with $H_{ij} = N^{-1/2} x_{ij}$, whose upper right entries $x_{ij}$ $(1\le i< j\le N)$…

We calculate connected correlators in Gaussian orthogonal, unitary and symplectic random matrix ensembles by the replica method in the 1/N-expansion. We obtain averaged one-point Green's functions up to the next-to-leading order O(1/N) and…

We demonstrate the convergence of the characteristic polynomial of several random matrix ensembles to a limiting universal function, at the microscopic scale. The random matrix ensembles we treat are classical compact groups and the…

Spectral correlations in unitary invariant, non-Gaussian ensembles of large random matrices possessing an eigenvalue gap are studied within the framework of the orthogonal polynomial technique. Both local and global characteristics of…

We consider operator-valued polynomials in Gaussian Unitary Ensemble random matrices and we show that its $L^p$-norm can be upper bounded, up to an asymptotically small error, by the operator norm of the same polynomial evaluated in free…