Related papers: Generalization of some results concerning eigenval…
In this paper, we study a particular class of block matrices placing an emphasis on their spectral properties. Some related applications are then presented.
We study a general class of recurrence relations that appear in the application of a matrix diagonalization procedure. We find general closed formula and determine analytical properties of the solutions. We finally apply these findings in…
In this paper, we study spectral properties of generalized weighted Hilbert matrices. In particular, we establish results on the spectral norm, determinant, as well as various relations between the eigenvalues and eigenvectors of such…
The properties of eigenvalues of large dimensional random matrices have received considerable attention. One important achievement is the existence and identification of the limiting spectral distribution of the empirical spectral…
In the first part of this manuscript a relationship between the spectrum of self-adjoint operator matrices and the spectra of their diagonal entries is found. This leads to enclosures for spectral points and in particular, enclosures for…
We study the spectral properties of certain non-self-adjoint matrices associated with large directed graphs. Asymptotically the eigenvalues converge to certain curves, apart from a finite number that have limits not on these curves.
Much effort has been spent on characterizing the spectrum of the non-backtracking matrix of certain classes of graphs, with special emphasis on the leading eigenvalue or the second eigenvector. Much less attention has been paid to the…
The generalized distance matrix of a graph is the matrix whose entries depend only on the pairwise distances between vertices, and the generalized distance spectrum is the set of eigenvalues of this matrix. This framework generalizes many…
We explore the block nature of the matrix representation of multiplex networks, introducing a new formalism to deal with its spectral properties as a function of the inter-layer coupling parameter. This approach allows us to derive…
We describe some aspects of spectral theory that involve algebraic considerations but need no analysis. Some of the important applications of the results are to the algebra of $n\times n$ matrices with entries that are polynomials or more…
This review presents an account of the major works done on spectra of adjacency matrices drawn on networks and the basic understanding attained so far. We have divided the review under three sections: (a) extremal eigenvalues, (b) bulk part…
We consider a symmetric block operator spectral problem with two spectral parameters. Under some reasonable restrictions, we state localisation theorems for the pair-eigenvalues and discuss relations to a class of non-self-adjoint spectral…
We study some spectral properties of a matrix that is constructed as a combination of a Laplacian and an adjacency matrix of simple graphs. The matrix considered depends on a positive parameter, as such we consider the implications in…
We derive inclusion regions for the eigenvalues of matrix polynomials expressed in a general polynomial basis, which can lead to significantly better results than traditional bounds. We present several applications to engineering problems.
How does coarsening affect the spectrum of a general graph? We provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph Laplacian matrices are close. The achieved approximation is shown to…
In the present paper, we are concerned with the study of the spectral distribution of matrix-sequences showing a non-Hermitian block structure with Toeplitz blocks. We use the notion of geometric mean of matrices and the theory of…
We investigate the spectrum of the non-backtracking matrix of a graph. In particular, we show how to obtain eigenvectors of the non-backtracking matrix in terms of eigenvectors of a smaller matrix. Furthermore, we find an expression for the…
We survey some of the known results on eigenvalues of Cayley graphs and their applications, together with related results on eigenvalues of Cayley digraphs and generalizations of Cayley graphs.
Graph matrices are a type of matrix which has played a crucial role in analyzing the sum of squares hierarchy on average case problems. However, except for rough norm bounds, little is known about graph matrices. In this paper, we take a…
We study the spectral properties of the transfer matrix for a gonihedric random surface model on a three-dimensional lattice. The transfer matrix is indexed by generalized loops in a natural fashion and is invariant under a group of motions…