Related papers: Vertices from replica in a random matrix theory
A feature of certain ensembles of random matrices is that the corresponding measure is invariant under conjugation by unitary matrices. Study of such ensembles realised by matrices with Gaussian entries leads to statistical quantities…
Let R be the local ring of a point on a variety X over an algebraically closed field k. We make a connection between the notion of mixed (Samuel) multiplicity of m-primary ideals in R and intersection theory of subspaces of rational…
The unitary Wilson random matrix theory is an interpolation between the chiral Gaussian unitary ensemble and the Gaussian unitary ensemble. This new way of interpolation is also reflected in the orthogonal polynomials corresponding to such…
Large random matrices appear in different fields of mathematics and physics such as combinatorics, probability theory, statistics, operator theory, number theory, quantum field theory, string theory etc... In the last ten years, they…
The technique of $Q$-polinomials are used to derive the $w$- constraints in the two-matrix and Kontsevich-like model at finite $N$. These constraints are closed and form Lie algebra. They are associated with the matrices, $\lambda…
Gaussian processes (GPs) with derivatives are useful in many applications, including Bayesian optimization, implicit surface reconstruction, and terrain reconstruction. Fitting a GP to function values and derivatives at $n$ points in $d$…
We consider the classification problem of a high-dimensional mixture of two Gaussians with general covariance matrices. Using the replica method from statistical physics, we investigate the asymptotic behavior of a general class of…
Different variants of approximate inverse iteration like the locally optimal block preconditioned conjugate gradient method became in recent years increasingly popular for the solution of the large matrix eigenvalue problems arising from…
The traditional approach of hand-crafting priors (such as sparsity) for solving inverse problems is slowly being replaced by the use of richer learned priors (such as those modeled by deep generative networks). In this work, we study the…
For symmetric random matrices with correlated entries, which are functions of independent random variables, we show that the asymptotic behavior of the empirical eigenvalue distribution can be obtained by analyzing a Gaussian matrix with…
Recently, the supersymmetry method was extended from Gaussian ensembles to arbitrary unitarily invariant matrix ensembles by generalizing the Hubbard-Stratonovich transformation. Here, we complete this extension by including arbitrary…
We discuss the use of matrices for providing sequences of rationals that approximate algebraic irrationalities. In particular, we study the regular representation of algebraic extensions, proving that ratios between two entries of the…
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…
This paper presents new probability inequalities for sums of independent, random, self-adjoint matrices. These results place simple and easily verifiable hypotheses on the summands, and they deliver strong conclusions about the…
In a recent study of large non-null sample covariance matrices, a new sequence of functions generalizing the GUE Tracy-Widom distribution of random matrix theory was obtained. This paper derives Painlev\'e formulas of these functions and…
Complex analysis is a powerful tool to study classical integrable systems, statistical physics on the random lattice, random matrix theory, topological string theory,... All these topics share certain relations, called "loop equations" or…
We use a unified framework to summarize sixteen randomized iterative methods including Kaczmarz method, coordinate descent method, etc. Some new iterative schemes are given as well. Some relationships with \textsc{mg} and \textsc{ddm} are…
We investigate the low-dimensional structure of deterministic transformations between random variables, i.e., transport maps between probability measures. In the context of statistics and machine learning, these transformations can be used…
It has been observed that the statistical distribution of the eigenvalues of random matrices possesses universal properties, independent of the probability law of the stochastic matrix. In this article we find the correlation functions of…
The generalized Rosenzweig-Porter model with real (GOE) off-diagonal entries arguably constitutes the simplest random matrix ensemble displaying a phase with fractal eigenstates, which we characterize here by using replica methods. We first…