English
Related papers

Related papers: Real symmetric random matrices and paths counting

200 papers

We study limit distributions of independent random matrices as well as limit joint distributions of their blocks under normalized partial traces composed with classical expectation. In particular, we are concerned with the ensemble of…

Operator Algebras · Mathematics 2014-07-25 Romuald Lenczewski

We analyze the spectral distribution of symmetric random matrices with correlated entries. While we assume that the diagonals of these random matrices are stochastically independent, the elements of the diagonals are taken to be correlated.…

Probability · Mathematics 2012-05-31 Olga Friesen , Matthias Löwe

Consider an $n \times p$ data matrix $X$ whose rows are independently sampled from a population with covariance $\Sigma$. When $n,p$ are both large, the eigenvalues of the sample covariance matrix are substantially different from those of…

Numerical Analysis · Mathematics 2017-10-03 Edgar Dobriban

We consider ensembles of real symmetric band matrices with entries drawn from an infinite sequence of exchangeable random variables, as far as the symmetry of the matrices permits. In general the entries of the upper triangular parts of…

Probability · Mathematics 2020-01-22 Werner Kirsch , Thomas Kriecherbauer

A method to generate new classes of random matrix ensembles is proposed. Random matrices from these ensembles are Lax matrices of classically integrable systems with a certain distribution of momenta and coordinates. The existence of an…

Chaotic Dynamics · Physics 2011-09-26 E. Bogomolny , O. Giraud , C. Schmit

We study the singularity probability of random integer matrices. Concretely, the probability that a random $n \times n$ matrix, with integer entries chosen uniformly from $\{-m,\ldots,m\}$, is singular. This problem has been well studied in…

Computational Complexity · Computer Science 2021-09-01 Sankeerth Rao Karingula , Shachar Lovett

This paper studies sparse elliptic random matrix models which generalize both the classical elliptic ensembles and sparse i.i.d. matrix models by incorporating correlated entries and a tunable sparsity parameter $p_n$. Each $n\times n$…

Probability · Mathematics 2025-08-08 Jackson Carpenter , Sean O'Rourke

We consider the joint density distribution of the elements of certain random matrix models which are example of globally correlated and asymptotically scale-invariant distributions. It is shown that in their cases, the nonadditive entropy…

Statistical Mechanics · Physics 2011-10-14 A. C. Bertuola , M. P. Pato

We give a simpler proof of an earlier result giving an asymptotic estimate for the number of integral matrices, in large balls, with a given monic integral irreducible polynomial as their common characteristic polynomial. The proof uses…

Representation Theory · Mathematics 2011-11-10 Nimish A. Shah

Given a real symmetric positive semi-definite matrix E, and an approximation S that is a sum of n independent matrix-valued random variables, we present bounds on the relative error in S due to randomization. The bounds do not depend on the…

Numerical Analysis · Mathematics 2018-01-03 John T. Holodnak , Ilse C. F. Ipsen , Ralph C. Smith

Given a large real symmetric, positive semidefinite m-by-m matrix, the goal of this paper is to show how a numerical approximation of the entropy, given by the sum of the entropies of the individual eigenvalues, can be computed in an…

Numerical Analysis · Mathematics 2014-06-13 Thomas P. Wihler , Bänz Bessire , André Stefanov

This paper considers the empirical spectral measure of a power of a random matrix drawn uniformly from one of the compact classical matrix groups. We give sharp bounds on the $L_p$-Wasserstein distances between this empirical measure and…

Probability · Mathematics 2013-09-26 Elizabeth Meckes , Mark Meckes

Non-asymptotic theory of random matrices strives to investigate the spectral properties of random matrices, which are valid with high probability for matrices of a large fixed size. Results obtained in this framework find their applications…

Probability · Mathematics 2013-08-02 Mark Rudelson

The Matrix-based Renyi's entropy enables us to directly measure information quantities from given data without the costly probability density estimation of underlying distributions, thus has been widely adopted in numerous statistical…

Machine Learning · Statistics 2022-05-17 Yuxin Dong , Tieliang Gong , Shujian Yu , Chen Li

Random matrix ensembles are introduced that respect the local tensor structure of Hamiltonians describing a chain of $n$ distinguishable spin-half particles with nearest-neighbour interactions. We prove a central limit theorem for the…

Mathematical Physics · Physics 2017-06-19 J. P. Keating , N. Linden , H. J. Wells

A structured random matrix ensemble that maintains constant modulus entries and unit-norm columns, often called a random phase-rotated (RPR) matrix, is considered in this paper. We analyze the coherence statistics of RPR measurement…

Signal Processing · Electrical Eng. & Systems 2019-10-23 Qiyou Duan , Taejoon Kim , Lin Dai , Erik Perrins

Recently much effort has been made towards the introduction of non-Hermitian random matrix models respecting $PT$-symmetry. Here we show that there is a one-to-one correspondence between complex $PT$-symmetric matrices and split-complex and…

Mathematical Physics · Physics 2015-09-17 Eva-Maria Graefe , Steve Mudute-Ndumbe , Matthew Taylor

We consider the eigenvalue problem for the case where the input matrix is symmetric and its entries perturb in some given intervals. We present a characterization of some of the exact boundary points, which allows us to introduce an inner…

Robotics · Computer Science 2011-02-22 Milan Hladik , David Daney , Elias Tsigaridas

We consider the moment space $\mathcal{M}_n$ corresponding to $p \times p$ real or complex matrix measures defined on the interval $[0,1]$. The asymptotic properties of the first $k$ components of a uniformly distributed vector $(S_{1,n},…

Probability · Mathematics 2011-05-18 Jan Nagel , Holger Dette

We show that positivity on $\mathbb{R}_+^n$ and on $\mathbb{R}^n$ of real symmetric polynomials of degree at most $p$ in $n\ge2$ variables is solvable by algorithms running in $\mathrm{poly}(n)$ time. For real symmetric quartics, we find…

Algebraic Geometry · Mathematics 2020-11-10 Vlad Timofte , Aida Timofte