Related papers: Spectral scales and linear pencils
Kirchoff's matrix tree theorem of 1847 connects the number of spanning trees of a graph to the spectral determinant of the discrete Laplacian [22]. Recently an analogue was obtained for quantum graphs relating the number of spanning trees…
We completely determine the spectrum of an $I$-graph, that is, the eigenvalues of its adjacency matrix. We apply our result to prove known characterizations of connectedness and bipartiteness in $I$-graphs by using an spectral approach.…
Theoretical analysis of biological and artificial neural networks e.g. modelling of synaptic or weight matrices necessitate consideration of the generic real-asymmetric matrix ensembles, those with varying order of matrix elements e.g. a…
Analyses of stellar spectra often begin with the determination of a number of parameters that define a model atmosphere. This work presents a prototype for an automated spectral classification system that uses a 15 nm-wide region around…
The relation between the spectra of operator pencils with unbounded coefficients and of associated linear relations is investigated. It turns out that various types of spectrum coincide and the same is true for the Weyr characteristics.…
Signed graphs are graphs whose edges get a sign $+1$ or $-1$ (the signature). Signed graphs can be studied by means of graph matrices extended to signed graphs in a natural way. Recently, the spectra of signed graphs have attracted much…
In 1972, A. J. Hoffman proved his celebrated theorem concerning the limit points of spectral radii of non-negative symmetric integral matrices less than $\sqrt{2+\sqrt{5}}$. In this paper, after giving a new version of Hoffman's theorem, we…
We define a graph to be $S$-regular if it contains an equitable partition given by a matrix $S$. These graphs are generalizations of both regular and bipartite, biregular graphs. An $S$-regular matrix is defined then as a matrix on an…
The spectrum of a supernova is a summation of numerous overlapping atomic line signatures. Consequently, empirical measurements are limited in application when compound features are assumed to be due to one or two spectral lines. Here I…
We study the semigroup of the symmetric $\alpha$-stable process in bounded domains in $\R^2$. We obtain a variational formula for the spectral gap, i.e. the difference between two first eigenvalues of the generator of this semigroup. This…
We consider a $2 \times 2$ operator matrix ${\mathcal A}_\mu,$ $\mu>0$ related with the lattice systems describing two identical bosons and one particle, another nature in interactions, without conservation of the number of particles. We…
The spectral properties of a multilevel atomic system interacting with multiple electromagnetic fields, a modified inverted-Y system, have been theoretically investigated. In this study, a numerical matrix propagation method has been…
This paper investigates the algorithmic dimension spectra of lines in the Euclidean plane. Given any line L with slope a and vertical intercept b, the dimension spectrum sp(L) is the set of all effective Hausdorff dimensions of individual…
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…
Two trace formulas for the spectra of arbitrary Hermitian matrices are derived by transforming the given Hermitian matrix $H$ to a unitary analogue. In the first type the unitary matrix is $e^{i(\lambda\II - H)}$ where $\lambda$ is the…
We analyze the spectral properties of correlation matrices between distinct statistical systems. Such matrices are intrinsically non symmetric, and lend themselves to extend the spectral analyses usually performed on standard Pearson…
We consider a first order operator with a periodic 3x3 matrix potential on the real line. This operator appears in the problem of the periodic vector NLS equation. The spectrum of the operator covers the real line, it is union of the…
Semidefinite programming optimises a linear objective function over a spectrahedron, and is one of the major advances of mathematical optimisation. Spectrahedra are described by linear pencils, which are linear matrix polynomials with…
One of the aims of this paper is to solve an open problem of Lovasz about relations between graph spectra and cut-distance. The paper starts with several inequalities between two versions of the cut-norm and the two largest singular values…
Loewner matrix pencils play a central role in the system realization theory of Mayo and Antoulas, an important development in data-driven modeling. The eigenvalues of these pencils reveal system poles. How robust are the poles recovered via…