Related papers: Spectrum of some arrow-bordered circulant matrix

The properties of the spectrum of the overlap Dirac operator and their relation to random matrix theory are studied. In particular, the predictions from chiral random matrix theory in topologically non-trivial gauge field sectors are…

The spectrum of a graph is closely related to many graph parameters. In particular, the spectral gap of a regular graph which is the difference between its valency and second eigenvalue, is widely seen an algebraic measure of connectivity…

In this work, we consider the periodic impulse control of a system modeled as a set of linear differential equations. We define a matrix that governs the qualitative behavior of the controlled system. This matrix depends on the period and…

Quantum graphs have attracted attention from mathematicians for some time. A quantum graph is defined by having a Laplacian on each edge of a metric graph and imposing boundary conditions at the vertices to get an eigenvalue problem. A…

We consider perturbations of a large Jordan matrix, either random and small in norm or of small rank. In both cases we show that most of the eigenvalues of the perturbed matrix are very close to a circle with centre at the origin. In the…

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 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…

Hypergraphs require higher-dimensional representations, which makes it more difficult to compute and interpret their spectral properties. This survey article uses the framework of hypermatrices to give an in-depth overview of the spectral…

A square matrix of order $n$ with $n\geq 2$ is called a \textit{permutative matrix} or permutative when all its rows (up to the first one) are permutations of precisely its first row. In this paper, the spectra of a class of permutative…

We consider the problem of finding the spectrum of an operator taking the form of a low-rank (rank one or two) non-normal perturbation of a well-understood operator, motivated by a number of problems of applied interest which take this…

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…

Let G be a simple connected graph of order n with degree sequence d_1, d_2, ..., d_n in non-increasing order. The spectral radius rho(G) of G is the largest eigenvalue of its adjacency matrix. For each positive integer L at most n, we give…

For a graph with largest normalized Laplacian eigenvalue $\lambda_N$ and (vertex) coloring number $\chi$, it is known that $\lambda_N\geq \chi/(\chi-1)$. Here we prove properties of graphs for which this bound is sharp, and we study the…

We carry the index theory for manifolds with boundary of B\"ar and Ballmann over to first order differential operators on metric graphs. This approach results in a short proof for the index of such operators. Then the self-adjoint…

The eigenvalue spectrum of the adjacency matrix of a network is closely related to the behavior of many dynamical processes run over the network. In the field of robotics, this spectrum has important implications in many problems that…

We compute spectra of symmetric random matrices defined on graphs exhibiting a modular structure. Modules are initially introduced as fully connected sub-units of a graph. By contrast, inter-module connectivity is taken to be incomplete.…

Using methods from random matrix theory researchers have recently calculated the full spectra of random networks with arbitrary degrees and with community structure. Both reveal interesting spectral features, including deviations from the…

We consider a versatile matrix model of the form ${\bf A}+i {\bf B}$, where ${\bf A}$ and ${\bf B}$ are real random circulant matrices with independent but, in general, nonidentically distributed Gaussian entries. For this model, we derive…

The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this…

We study random normal matrix models whose eigenvalues tend to be distributed within a narrow "band" around the unit circle of width proportional to $\frac1n$, where $n$ is the size of matrices. For general radially symmetric potentials…