Related papers: Self-interlacing polynomials II: Matrices with sel…
We investigate the properties of positive definite and positive semi-definite symmetric matrices within the framework of symmetrized tropical algebra, an extension of tropical algebra adapted to ordered valued fields. We focus on the…
The graphs with all equal negative or positive eigenvalues are special kind in the spectral graph theory. In this article, several iterated line graphs $\mathcal{L}^k(G)$ with all equal negative eigenvalues $-2$ are characterized for $k\ge…
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.…
In this short note, we present a novel method for computing exact lower and upper bounds of eigenvalues of a symmetric tridiagonal interval matrix. Compared to the known methods, our approach is fast, simple to present and to implement, and…
In this paper we consider Wigner random matrices -- symmetric n by n random matrices whose entries are independent identically distributed real random variables. We prove that the probability distribution of one or several eigenvalues close…
M.Levitin and E.Shargorodsky purposed in a recent article, [math.SP/0212087], the use of the so called ``second order relative spectrum'', to find eigenvalues of self-adjoint operators in gaps of the essential spectrum. Let $M$ be a…
Let $\mathcal{M}$ be a square matrix over a commutative ring and let $\mathcal{A}$ be a principal submatrix. We give relations between the determinants of $\mathcal{M}$ and $\mathcal{A}$ based on an annihilating polynomial for one of them.…
Consider two types of products of independent random matrices, including products of Ginibre matrices and inverse Ginibre matrices and products of truncated Haar unitary matrices and inverse truncated Haar matrices. Each product matrix has…
Eigenvalue interlacing is a useful tool in linear algebra and spectral analysis. In its simplest form, the interlacing inequality states that a rank-one positive perturbation shifts each eigenvalue up, but not further than the next…
Consider the product of $m$ independent $n\times n$ random matrices from the spherical ensemble for $m\ge 1$. The empirical distribution based on the $n$ eigenvalues of the product is called the empirical spectral distribution. Two recent…
We study the spectra and eigenvectors of the adjacency matrices of scale-free networks when bi-directional interaction is allowed, so that the adjacency matrix is real and symmetric. The spectral density shows an exponential decay around…
A real symmetric n times n matrix is called copositive if the corresponding quadratic form is non-negative on the closed first orthant. If the matrix fails to be copositive there exists some non-negative certificate for which the quadratic…
We study spectral properties of unbounded Jacobi matrices with periodically modulated or blended entries. Our approach is based on uniform asymptotic analysis of generalized eigenvectors. We determine when the studied operators are…
Let $A$ be a square complex matrix and $z$ a complex number. The distance, with respect to the spectral norm, from $A$ to the set of matrices which have $z$ as an eigenvalue is less than or equal to the distance from $z$ to the spectrum of…
We discuss the discrete spectrum of the Hamiltonian describing a two-dimensional quantum particle interacting with an infinite family of point interactions. We suppose that the latter are arranged into a star-shaped graph with N arms and a…
In this work, we study the spectral properties of matrix Hamiltonians generated by linearizing the nonlinear Schr\"odinger equation about soliton solutions. By a numerically assisted proof, we show that there are no embedded eigenvalues for…
We describe some numerical experiments which determine the degree of spectral instability of medium size randomly generated matrices which are far from self-adjoint. The conclusion is that the eigenvalues are likely to be intrinsically…
We extract an exact formula relating the number of lattice points in an expanding region of a complex semi-simple symmetric space and the automorphic spectrum from a spectral identity, which is obtained by producing two expressions for the…
The concepts of differentiation and integration for matrices are known. As far as each matrix is differentiable, it is not clear a priori whether a given matrix is integrable or not. Recently some progress was obtained for diagonalizable…
Using spectral embedding based on the signless Laplacian, we obtain bounds on the spectrum of transition matrices on graphs. As a consequence, we bound return probabilities and the uniform mixing time of simple random walk on graphs. In…