Statistical properties of structured random matrices
- URL: http://arxiv.org/abs/2012.14322v1
- Date: Mon, 21 Dec 2020 18:00:14 GMT
- Title: Statistical properties of structured random matrices
- Authors: Eugene Bogomolny, Olivier Giraud
- Abstract summary: Spectral properties of Hermitian Toeplitz, Hankel, and Toeplitz-plus-Hankel random matrices with independent identically distributed entries are investigated.
Our findings show that intermediate-type statistics is more ubiquitous and universal than was considered so far and open a new direction in random matrix theory.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Spectral properties of Hermitian Toeplitz, Hankel, and Toeplitz-plus-Hankel
random matrices with independent identically distributed entries are
investigated. Combining numerical and analytic arguments it is demonstrated
that spectral statistics of all these random matrices is of intermediate type,
characterized by (i) level repulsion at small distances, (ii) an exponential
decrease of the nearest-neighbor distributions at large distances, (iii) a
non-trivial value of the spectral compressibility, and (iv) the existence of
non-trivial fractal dimensions of eigenvectors in Fourier space. Our findings
show that intermediate-type statistics is more ubiquitous and universal than
was considered so far and open a new direction in random matrix theory.
Related papers
- Convergence of Score-Based Discrete Diffusion Models: A Discrete-Time Analysis [56.442307356162864]
We study the theoretical aspects of score-based discrete diffusion models under the Continuous Time Markov Chain (CTMC) framework.
We introduce a discrete-time sampling algorithm in the general state space $[S]d$ that utilizes score estimators at predefined time points.
Our convergence analysis employs a Girsanov-based method and establishes key properties of the discrete score function.
arXiv Detail & Related papers (2024-10-03T09:07:13Z) - Entrywise error bounds for low-rank approximations of kernel matrices [55.524284152242096]
We derive entrywise error bounds for low-rank approximations of kernel matrices obtained using the truncated eigen-decomposition.
A key technical innovation is a delocalisation result for the eigenvectors of the kernel matrix corresponding to small eigenvalues.
We validate our theory with an empirical study of a collection of synthetic and real-world datasets.
arXiv Detail & Related papers (2024-05-23T12:26:25Z) - Asymptotic Gaussian Fluctuations of Eigenvectors in Spectral Clustering [24.558241146742205]
It is shown that the signal $+$ noise structure of a general spike random matrix model is transferred to the eigenvectors of the corresponding Gram kernel matrix.
This CLT-like result was the last missing piece to precisely predict the classification performance of spectral clustering.
arXiv Detail & Related papers (2024-02-19T17:25:12Z) - Spectral fluctuations of multiparametric complex matrix ensembles:
evidence of a single parameter dependence [0.0]
We numerically analyze the spectral statistics of the multiparametric Gaussian ensembles of complex matrices with zero mean and variances with different decay routes away from the diagonals.
Such ensembles can serve as good models for a wide range of phase transitions e.g. localization to delocalization in non-Hermitian systems or Hermitian to non-Hermitian one.
arXiv Detail & Related papers (2023-12-13T15:21:35Z) - Quantitative deterministic equivalent of sample covariance matrices with
a general dependence structure [0.0]
We prove quantitative bounds involving both the dimensions and the spectral parameter, in particular allowing it to get closer to the real positive semi-line.
As applications, we obtain a new bound for the convergence in Kolmogorov distance of the empirical spectral distributions of these general models.
arXiv Detail & Related papers (2022-11-23T15:50:31Z) - Random matrices associated with general barrier billiards [0.0]
The paper is devoted to the derivation of random unitary matrices whose spectral statistics is the same as statistics of quantum eigenvalues of certain deterministic two-dimensional barrier billiards.
An important ingredient of the method is the calculation of $S$-matrix for the scattering in the slab with a half-plane inside by the Wiener-Hopf method.
arXiv Detail & Related papers (2021-10-30T07:26:40Z) - Minimax Estimation of Linear Functions of Eigenvectors in the Face of
Small Eigen-Gaps [95.62172085878132]
Eigenvector perturbation analysis plays a vital role in various statistical data science applications.
We develop a suite of statistical theory that characterizes the perturbation of arbitrary linear functions of an unknown eigenvector.
In order to mitigate a non-negligible bias issue inherent to the natural "plug-in" estimator, we develop de-biased estimators.
arXiv Detail & Related papers (2021-04-07T17:55:10Z) - Hilbert-space geometry of random-matrix eigenstates [55.41644538483948]
We discuss the Hilbert-space geometry of eigenstates of parameter-dependent random-matrix ensembles.
Our results give the exact joint distribution function of the Fubini-Study metric and the Berry curvature.
We compare our results to numerical simulations of random-matrix ensembles as well as electrons in a random magnetic field.
arXiv Detail & Related papers (2020-11-06T19:00:07Z) - Understanding Implicit Regularization in Over-Parameterized Single Index
Model [55.41685740015095]
We design regularization-free algorithms for the high-dimensional single index model.
We provide theoretical guarantees for the induced implicit regularization phenomenon.
arXiv Detail & Related papers (2020-07-16T13:27:47Z) - Spectral statistics of Toeplitz matrices [0.0]
Hermitian random Toeplitz matrices with independent identically distributed elements are investigated.
It is found that the eigenvalue statistics of complex Toeplitz matrices is surprisingly well approximated by the semi-Poisson distribution.
arXiv Detail & Related papers (2020-06-01T15:13:30Z) - Profile Entropy: A Fundamental Measure for the Learnability and
Compressibility of Discrete Distributions [63.60499266361255]
We show that for samples of discrete distributions, profile entropy is a fundamental measure unifying the concepts of estimation, inference, and compression.
Specifically, profile entropy a) determines the speed of estimating the distribution relative to the best natural estimator; b) characterizes the rate of inferring all symmetric properties compared with the best estimator over any label-invariant distribution collection; c) serves as the limit of profile compression.
arXiv Detail & Related papers (2020-02-26T17:49:04Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.