English
Related papers

Related papers: Cavity Approach to the Spectral Density of Sparse …

200 papers

Gaussian time-series models are often specified through their spectral density. Such models present several computational challenges, in particular because of the non-sparse nature of the covariance matrix. We derive a fast approximation of…

Computation · Statistics 2012-11-20 Nicolas Chopin , Judith Rousseau , Brunero Liseo

Using the theory of negative association for measures and the notion of random weak limits of sparse graphs, we establish the validity of the cavity method for counting spanning subgraphs subject to local constraints in asymptotically…

Probability · Mathematics 2011-03-21 Justin Salez

We obtain a sharp convergence rate for banded covariance matrix estimates of stationary processes. A precise order of magnitude is derived for spectral radius of sample covariance matrices. We also consider a thresholded covariance matrix…

Statistics Theory · Mathematics 2015-03-19 Han Xiao , Wei Biao Wu

We consider random n\times n matrices of the form (XX*+YY*)^{-1/2}YY*(XX*+YY*)^{-1/2}, where X and Y have independent entries with zero mean and variance one. These matrices are the natural generalization of the Gaussian case, which are…

Probability · Mathematics 2015-06-05 Laszlo Erdos , Brendan Farrell

Estimating the eigenvalues of a population covariance matrix from a sample covariance matrix is a problem of fundamental importance in multivariate statistics; the eigenvalues of covariance matrices play a key role in many widely…

Statistics Theory · Mathematics 2007-06-13 Noureddine El Karoui

Using operator methods, we generally present the level densities for kinds of random matrix unitary ensembles in weak sense. As a corollary, the limit spectral distributions of random matrices from Gaussian, Laguerre and Jacobi unitary…

Mathematical Physics · Physics 2007-05-23 Zhengdong Wang , Kuihua Yan

Using the supersymmetric method of random matrix theory within the Heidelberg approach framework we provide statistical description of stationary intensity sampled in locations inside an open wave-chaotic cavity, assuming that the…

Disordered Systems and Neural Networks · Physics 2023-10-16 Yan V. Fyodorov , Elizaveta Safonova

We review the application of the notion of local convergence on locally finite randomly rooted graphs, known as Benjamini-Schramm convergence, to the calculation of the global eigenvalue density of random matrices from the beta-Gaussian and…

Probability · Mathematics 2018-05-29 Sergio Andraus

The eigendecomposition of the coupling matrix of large biological networks is central to the study of the dynamics of these networks. For neural networks, this matrix should reflect the topology of the network and conform with Dale's law…

Neurons and Cognition · Quantitative Biology 2015-09-08 Hervé Rouault , Shaul Druckmann

The scattering matrix approach is employed to determine a joint probability density function of reflection eigenvalues for chaotic cavities coupled to the outside world through both ballistic and tunnel point contacts. Derived under…

Mesoscale and Nanoscale Physics · Physics 2012-05-17 Pedro Vidal , Eugene Kanzieper

Non-Hermitian random matrices with statistical spectral characteristics beyond the standard Ginibre ensembles have recently emerged in the description of dissipative quantum many-body systems as well as in non-ergodic wave transport in…

Mathematical Physics · Physics 2025-11-27 Gernot Akemann , Yan V. Fyodorov , Dmitry V. Savin

We generally study the density of eigenvalues in unitary ensembles of random matrices from the recurrence coefficients with regularly varying conditions for the orthogonal polynomials. First we calculate directly the moments of the density.…

Mathematical Physics · Physics 2008-10-31 Dang-Zheng Liu , Zheng-Dong Wang , Kui-Hua Yan

We consider a covariance matrix composed of asymmetric and free random Levy matrices. We use the results of free random variables to derive an algebraic equation for the resolvent and solve it to extract the spectral density. For an…

Condensed Matter · Physics 2007-05-23 Z. Burda , J. Jurkiewicz , M. A. Nowak , G. Papp , I. Zahed

We study high-dimensional sample covariance matrices based on independent random vectors with missing coordinates. The presence of missing observations is common in modern applications such as climate studies or gene expression…

Probability · Mathematics 2016-03-01 Kamil Jurczak , Angelika Rohde

In this paper we consider a new normalization of matrices obtained by choosing distinct codewords at random from linear codes over finite fields and find that under some natural algebraic conditions of the codes their empirical spectral…

Information Theory · Computer Science 2018-08-29 Chin Hei Chan , Enoch Kung , Maosheng Xiong

This paper studies the asymptotic spectral properties of the sample covariance matrix for high dimensional compositional data, including the limiting spectral distribution, the limit of extreme eigenvalues, and the central limit theorem for…

Statistics Theory · Mathematics 2023-12-25 Qianqian Jiang , Jiaxin Qiu , Zeng Li

Recently, sparsity-based algorithms are proposed for super-resolution spectrum estimation. However, to achieve adequately high resolution in real-world signal analysis, the dictionary atoms have to be close to each other in frequency,…

Machine Learning · Statistics 2015-06-05 Yiyuan She , Huanghuang Li , Jiangping Wang , Dapeng Wu

We develop a theoretical framework based on the cavity and replica methods to analyze the spectral properties of sparse asymmetric correlation matrices of the form $\boldsymbol{F} = (\boldsymbol{X}\boldsymbol{Y}^\top + \omega…

Disordered Systems and Neural Networks · Physics 2025-10-21 Edgar Guzmán-González , Isaac Pérez Castillo

The eigenvalue density for members of the Gaussian orthogonal and unitary ensembles follows the Wigner semi-circle law. If the Gaussian entries are all shifted by a constant amount c/Sqrt(2N), where N is the size of the matrix, in the large…

Mathematical Physics · Physics 2009-04-21 Kevin E. Bassler , Peter J. Forrester , Norman E. Frankel

In many machine learning and data related applications, it is required to have the knowledge of approximate ranks of large data matrices at hand. In this paper, we present two computationally inexpensive techniques to estimate the…

Numerical Analysis · Computer Science 2017-06-19 Shashanka Ubaru , Yousef Saad , Abd-Krim Seghouane