scispace - formally typeset
Search or ask a question
Topic

Spectrum of a matrix

About: Spectrum of a matrix is a research topic. Over the lifetime, 1064 publications have been published within this topic receiving 19841 citations. The topic is also known as: matrix spectrum.


Papers
More filters
Journal ArticleDOI
TL;DR: In this paper, the authors use RMT to identify correlated behavior between different firms in the economy by applying methods of random matrix theory (RMT) to analyze the cross-correlation matrix of price changes of the largest 1000 US stocks for the 2-year period 1994-1995.
Abstract: We address the question of how to precisely identify correlated behavior between different firms in the economy by applying methods of random matrix theory (RMT) Specifically, we use methods of random matrix theory to analyze the cross-correlation matrix of price changes of the largest 1000 US stocks for the 2-year period 1994–1995 We find that the statistics of most of the eigenvalues in the spectrum of agree with the predictions of random matrix theory, but there are deviations for a few of the largest eigenvalues To prove that the rest of the eigenvalues are genuinely random, we test for universal properties such as eigenvalue spacings and eigenvalue correlations We demonstrate that shares universal properties with the Gaussian orthogonal ensemble of random matrices In addition, we quantify the number of significant participants, that is companies, of the eigenvectors using the inverse participation ratio, and find eigenvectors with large inverse participation ratios at both edges of the eigenvalue spectrum — a situation reminiscent of results in localization theory

14 citations

Journal ArticleDOI
TL;DR: In this paper, a simple method is presented to compute the eigenvalues and the Eigenfunctions of second-order linear differential operators, with homogeneous boundary conditions, both in a finite interval and on the semi-line.
Abstract: In this paper a simple method is presented to compute the eigenvalues and the eigenfunctions of second-order linear differential operators, with homogeneous boundary conditions, both in a finite interval and on the semi-line. Our technique overcomes the drawbacks of the method proposed by Calogero to compute the eigenvalues of Sturm-Liouville problems in a finite interval. An estimate of the convergence for the eigenvalues is given in the finite case and numerical tests are performed, exhibiting a very fast rate of convergence for the eigenvalues both for the finite interval and the semi-line cases. An excellent convergence for the eigenfunctions is also obtained in both cases.

14 citations

Book ChapterDOI
01 Jan 1997
TL;DR: In this article, the n(≥ 2)th order difference equation is considered and the boundary conditions (28.5) and 28.4) for α, β, γ, δ and δ are satisfied.
Abstract: Here, we shall consider the n(≥ 2)th order difference equation $${\Delta ^n}y(k) + \lambda Q(k,y(k)), \cdots ,{\Delta ^{n - 2}}y(k))\, = \,\lambda P(k,y(k),\Delta y(k), \cdots ,{\Delta ^{n - 1}}y(k)),\,k \in N(0,J - 1)$$ (29.1) together with the boundary conditions (28.2) – (28.4), where the constants α, β, γ and δ satisfy the conditions (28.5) and (28.6). In (29.1), λ > 0, Q: N(0, J − 1) × ℝn−1 → ℝ, and P : N(0, J − 1) × ℝn → ℝ.

13 citations

Journal ArticleDOI
TL;DR: The eigenvalue spectrum of the transition matrix of a network encodes important information about its structural and dynamical properties and is used to evaluate the closed-form solution to the eigentime for random walks on the networks under consideration.
Abstract: The eigenvalue spectrum of the transition matrix of a network encodes important information about its structural and dynamical properties. We study the transition matrix of a family of fractal scale-free networks and analytically determine all the eigenvalues and their degeneracies. We then use these eigenvalues to evaluate the closed-form solution to the eigentime for random walks on the networks under consideration. Through the connection between the spectrum of transition matrix and the number of spanning trees, we corroborate the obtained eigenvalues and their multiplicities.

13 citations

Journal ArticleDOI
TL;DR: Various methods of approximating the eigenvalues and invariant subspaces of nonself-adjoint differential and integral operators are unified in a general theory.

13 citations


Network Information
Related Topics (5)
Eigenvalues and eigenvectors
51.7K papers, 1.1M citations
81% related
Bounded function
77.2K papers, 1.3M citations
80% related
Linear system
59.5K papers, 1.4M citations
80% related
Differential equation
88K papers, 2M citations
80% related
Matrix (mathematics)
105.5K papers, 1.9M citations
79% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20238
20229
20202
20193
20187
201731