Related papers: Spectrum of some arrow-bordered circulant matrix
In this article, we are going to introduce the weighted numerical range which is a further generalization both the c-numerical range and the rank k numerical range. If the boundaries of weighted numerical ranges of two matrices (possibly of…
The $\alpha$-spectral radius of a connected graph $G$ is the spectral radius of $A_\alpha$-matrix of $G$. In this paper, we discuss the methods for comparing $\alpha$-spectral radius of graphs. As applications, we characterize the graphs…
We investigate the relation between the spectrum of a non-normal matrix and the norm of its resolvent. We provide spectral estimates for the resolvent of matrices whose largest singular value is bounded by $1$ (so-called Hilbert space…
The subject of time-band-limiting, originating in signal processing, is dominated by the miracle that a naturally appearing integral operator admits a commuting differential one allowing for a numerically efficient way to compute its…
Solving a longstanding problem on equiangular lines, we determine, for each given fixed angle and in all sufficiently large dimensions, the maximum number of lines pairwise separated by the given angle. Fix $0 < \alpha < 1$. Let…
We propose an alternative variational principle whose critical point is the algebraic plane curve associated to a matrix model (the spectral curve, i.e. the large $N$ limit of the resolvent). More generally, we consider a variational…
It is known that a unitary matrix can be decomposed into a product of reflections, one for each dimension, and the Haar measure on the unitary group pushes forward to independent uniform measures on the reflections. We consider the sequence…
In this paper we deal with circulant and partitioned into $n$-by-$n$ circulant blocks matrices and introduce spectral results concerning this class of matrices. The problem of finding lists of complex numbers corresponding to a set of…
We consider a sequence of matrices that are associated to Markov dynamical systems and use determinant-free linear algebra techniques (as well as some algebra and complex analysis) to rigorously estimate the eigenvalues of every matrix…
We study the dependence of the quantum graph Hamiltonian, its resolvent, and its spectrum on the vertex conditions and graph edge lengths. In particular, several results on the interlacing (bracketing) of the spectra of graphs with…
We revisit the relative perturbation theory for invariant subspaces of positive definite matrix pairs. As a prototype model problem for our results we consider parameter dependent families of eigenvalue problems. We show that new estimates…
A nonnegative matrix A is said to be strongly robust if its max-algebraic eigencone is universally reachable, i.e., if the orbit of any initial vector ends up with a max-algebraic eigenvector of A. Consider the case when the initial vector…
We place ourselves in the setting of high-dimensional statistical inference where the number of variables $p$ in a dataset of interest is of the same order of magnitude as the number of observations $n$. We consider the spectrum of certain…
This note introduces a result on the location of eigenvalues, i.e., the spectrum, of the Laplacian for a family of undirected graphs with self-loops. We extend on the known results for the spectrum of undirected graphs without self-loops or…
Given a real, symmetric matrix S, we define the slice through S as being the connected component containing S of two orbits under conjugation: the first by the orthogonal group, and the second by the upper triangular group. We describe some…
We study numerically and analytically the spectrum of incidence matrices of random labeled graphs on N vertices : any pair of vertices is connected by an edge with probability p. We give two algorithms to compute the moments of the…
We numerically analyze the random matrix ensembles of real-symmetric matrices with column/row constraints for many system conditions e.g. disorder type, matrix-size and basis-connectivity. The results reveal a rich behavior hidden beneath…
We give the first specific conjectures on how frequently graphs satisfy sufficient conditions for being uniquely characterized by spectral information. These conjectures arise from a theoretical framework that we developed based on…
The paper considers the spectral determinant of quantum graph families with chaotic classical limit and no symmetries. The secular coefficients of the spectral determinant are found to follow distributions with zero mean and variance…
The spectral problem for matrices with a block-hierarchical structure is often considered in context of the theory of complex systems. In the present article, a new class of matrices with a block-rectangular non-symmetric hierarchical…