Related papers: Spectrum of some arrow-bordered circulant matrix

Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…

The study of complex networks has been one of the most active fields in science in recent decades. Spectral properties of networks (or graphs that represent them) are of fundamental importance. Researchers have been investigating these…

We discuss a practical method to determine the eigenvalue spectrum of the empirical correlation matrix. The method is based on the analysis of the behavior of a conformal map at a critical horizon which is defined as a border line of the…

The open problem of calculating the limiting spectrum (or its Shannon transform) of increasingly large random Hermitian finite-band matrices is described. In general, these matrices include a finite number of non-zero diagonals around their…

It is critical to understand the properties of spatial correlation matrices in massive multiple-input multiple-output (MIMO) systems. We derive new bounds on the extreme eigenvalues of a spatial correlation matrix that is characterized by…

Developed in 1999 by Akemann, Anderson, and Weaver, the spectral scale of an $n\times n$ matrix $A$, is a convex, compact subset of $\mathbb{R}^3$ that reveals important spectral information about $A$ \cite{AAW}. In this paper we present…

In this work we introduce the notion of an angular spectrum for a linear discrete time nonautonomous dynamical system. The angular spectrum comprises all accumulation points of longtime averages formed by maximal principal angles between…

In this note the following is shown. Consider the quadratic form on (complex) matrices Q(A):=tr(A^2). Let A be such a matrix. Then an ellipse can be found, with the vector from center to focus determined by the value of Q at the traceless…

In this paper, we aim to address the open questions raised in various recent papers regarding characterization of circulant graphs with three or four distinct eigenvalues in their spectra. Our focus is on providing characterizations and…

Using random matrix technique we determine an exact relation between the eigenvalue spectrum of the covariance matrix and of its estimator. This relation can be used in practice to compute eigenvalue invariants of the covariance…

We give an upper bound on the largest eigenvalue of a graph of given order, size, and girth.

The adjacency-diametrical matrix (AD matrix) of a connected graph $G$ with diameter $d$, denoted by $AD(G)$, is the matrix indexed by the vertices of $G$ in which the $(i,j)$-entry of $AD(G)$ is $1$ if $d_G(v_i,v_j)=1$, is $d$ if…

Consider a graph on the non-singular matrices over a finite field, in which two distinct non-singular matrices are joined by an edge whenever their sum is singular. We prove an upper bound for the independence number of this graph. As a…

Let A(x) be a holomorphic family of bounded self-adjoint operators on a separable Hilbert space H and let A(x)_n be the orthogonal compressions of A(x) to the span of first n elements of an orthonormal basis of H. The problem considered…

In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular graph. By using…

We discuss a random matrix model of systems with an approximate symmetry and present the spectral fluctuation statistics and eigenvector characteristics for the model. An acoustic resonator like, e.g., an aluminium plate may have an…

Macroscopic loop correlators are investigated in the hermitian one matrix model with the potential perturbed by the higher order curvature term. In the phase of smooth surfaces the model is equivalent to the minimal conformal matter coupled…

We study the spectra of mixed graphs about its Hermitian adjacency matrix of the second kind (i.e. N-matrix) introduced by Mohar [1]. We extend some results and define one new Hermitian adjacency matrix, and the entry corresponding to an…

Double circulant matrices are introduced and studied. A formula to compute the rank r of a double circulant matrix is exhibited; and it is shown that any consecutive r rows of the double circulant matrix are linearly independent. As a…

Let $a$, $b$, $p$, $q$ be integers and~$(h_n)$ defined by $h_0=a$, $h_1=b$, $h_n=ph_{n-1}+qh_{n-2}$, $n=2,3,\dots$. Complementing to certain previously known results, we study the spectral norm of the circulant matrix corresponding to…