Related papers: Spectral Properties of Matrices Associated with So…

Here, the structural symmetries of a hypergraph are represented through equivalence relations on the vertex set of the hypergraph. A matrix associated with the hypergraph may not reflect a specific structural symmetry. In the context of a…

The hierarchical product of two graphs represents a natural way to build a larger graph out of two smaller graphs with less regular and therefore more heterogeneous structure than the Cartesian product. Here we study the eigenvalue spectrum…

In this paper we express the eigenvalues of a sort of real heptadiagonal symmetric matrices as the zeros of explicit rational functions establishing upper and lower bounds for each of them. From these prescribed eigenvalues we compute also…

This paper considers $N\times N$ matrices of the form $A_\gamma =A+ \gamma B$, where $A$ is self-adjoint, $\gamma \in C$ and $B$ is a non-self-adjoint perturbation of $A$. We obtain some monodromy-type results relating the spectral…

Let $D$ be an oriented graph with skew adjacency matrix $S(D)$. Two oriented graphs $D$ and $C$ are said to share the same generalized skew spectrum if $S(D)$ and $S(C)$ have the same eigenvalues, and $J-S(D)$ and $J-S(C)$ also have the…

Stochastic network influences complicate graph filter design by producing uncertainty in network iteration matrix eigenvalues, the points at which the graph filter response is defined. While joint statistics for the eigenvalues typically…

In this paper, we investigate spectral properties of the adjacency tensor, Laplacian tensor and signless Laplacian tensor of general hypergraphs (including uniform and non-uniform hypergraphs). We obtain some bounds for the spectral radius…

In the first part of this paper, the main concern is with smoothness properties of the boundary of the pseudospectrum of a matrix polynomial. In the second part, results are obtained concerning the number of connected components of…

The eccentricity matrix of a simple connected graph is obtained from the distance matrix by only keeping the largest distances for each row and each column, whereas the remaining entries become zero. This matrix is also called the…

This paper is concerned with the spectral properties of matrices associated with linear filters for the estimation of the underlying trend of a time series. The interest lies in the fact that the eigenvectors can be interpreted as the…

We define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L^2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we…

An expansion of the Weyl function of a $H$-selfadjoint random matrix with one negative square is provided. It is shown that the coefficients converge to a certain generalization of Catlan numbers. Properties of this generalization are…

Arrangement graphs were introduced for their connection to computational networks and have since generated considerable interest in the literature. In a pair of recent articles by Chen, Ghorbani and Wong, the eigenvalues for the adjacency…

We study the spectral properties of bounded and unbounded Jacobi matrices whose entries are bounded operators on a complex Hilbert space. In particular, we formulate conditions assuring that the spectrum of the studied operators is…

We consider selfadjoint operators obtained by pasting a finite number of boundary relations with one-dimensional boundary space. A typical example of such an operator is the Schr\"odinger operator on a star-graph with a finite number of…

We introduce a hypergraph matrix, named the unified matrix, and use it to represent the hypergraph as a graph. We show that the unified matrix of a hypergraph is identical to the adjacency matrix of the associated graph. This enables us to…

We study the eigenvectors and eigenvalues of random matrices with iid entries. Let $N$ be a random matrix with iid entries which have symmetric distribution. For each unit eigenvector $\mathbf{v}$ of $N$ our main results provide a small…

We study spectral properties of bounded and unbounded complex Jacobi matrices. In particular, we formulate conditions assuring that the spectrum of the studied operators is continuous on some subsets of the complex plane and we provide…

In finite group theory, studying the prime graph of a group has been an important topic for almost the past half-century. Recently, prime graphs of solvable groups have been characterized in graph theoretical terms only. This now allows the…

Any directed graph G with N vertices and J edges has an associated line-graph L(G) where the J edges form the vertices of L(G). We show that the non-zero eigenvalues of the adjacency matrices are the same for all graphs of such a family…