Related papers: Spectral scales and linear pencils
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…
In this paper we derive novel families of inclusion sets for the spectrum and pseudospectrum of large classes of bounded linear operators, and establish convergence of particular sequences of these inclusion sets to the spectrum or…
The paper deals with spectral order isomorphisms between certain spectral sublattices of direct sums of AW*-factors. We prove that these maps consist of spectral order isomorphisms between spectral sublattices of individual direct summands.…
A graph $G = (V, E)$ of bounded degree has an adjacency operator~$A$ which acts on the Hilbert space $\ell^2(V)$. There are different kinds of measures of interest on the spectrum $\Sigma (A)$ of $A$. In particular, each vector $\xi \in…
A light ray in space is characterized by two vectors: (i) a transverse spatial-vector associated with the point where the ray intersects a given spherical cap; (ii) an angular-frequency vector which defines the ray direction of propagation.…
In this paper we propose and analyze an algorithm for identifying spectral gaps of a real symmetric matrix $A$ by simultaneously approximating the traces of spectral projectors associated with multiple different spectral slices. Our method…
We study the spectral and scattering theory of light transmission in a system consisting of two asymptotically periodic waveguides, also known as one-dimensional photonic crystals, coupled by a junction. Using analyticity techniques and…
In this paper, a quadratic pencil of Schr\"odinger type difference operator $L_{\lambda}$ is taken under investigation to give a general perspective on the spectral analysis of non-selfadjoint difference equations of second order.…
In 2003, van Dam and Haemers posed a fundamental question in spectral graph theory: does there exist a ``sensible'' matrix whose spectrum determines a random graph up to isomorphism? This paper introduces the class of {\em natural graph…
We introduce the asymptotic spectrum of graphs and apply the theory of asymptotic spectra of Strassen (J. Reine Angew. Math. 1988) to obtain a new dual characterisation of the Shannon capacity of graphs. Elements in the asymptotic spectrum…
The paper deals with some spectral properties of (mostly infinite) quantum and combinatorial graphs. Quantum graphs have been intensively studied lately due to their numerous applications to mesoscopic physics, nanotechnology, optics, and…
Distance matrices are matrices whose elements are the relative distances between points located on a certain manifold. In all cases considered here all their eigenvalues except one are non-positive. When the points are uncorrelated and…
For a simple graph $G$, the generalized adjacency matrix $A_{\alpha}(G)$ is defined as $A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G), \alpha\in [0,1]$, where $A(G)$ is the adjacency matrix and $D(G)$ is the diagonal matrix of vertex degrees of…
A unified approach to the determination of eigenvalues and eigenvectors of specific matrices associated with directed graphs is presented. Matrices studied include the distance matrix, distance Laplacian, and distance signless Laplacian, in…
Joint spectra of tuples of operators are subsets in complex projective space. The corresponding tuple of operators can be viewed as an infinite dimensional analog of a determinantal representation of the joint spectrum. We investigate the…
The Laplacian of a (weighted) Cayley graph on the Weyl group $W(B_n)$ is a $N\times N$ matrix with $N = 2^n n!$ equal to the order of the group. We show that for a class of (weighted) generating sets, its spectral gap (lowest nontrivial…
A spectral faux tree with respect to a given matrix is a graph which is not a tree but is cospectral with a tree for the given matrix. We consider the existence of spectral faux trees for several matrices, with emphasis on constructions.…
The first paper in this series introduced a new family of nonasymptotic matrix concentration inequalities that sharply capture the spectral properties of very general random matrices in terms of an associated noncommutative model. These…
Spectral methods have emerged as a simple yet surprisingly effective approach for extracting information from massive, noisy and incomplete data. In a nutshell, spectral methods refer to a collection of algorithms built upon the eigenvalues…
The two-to-two four-dimensional scattering amplitude of identical scalars obeys rigorous two-sided non-perturbative bounds derived via the modern numerical S-matrix bootstrap. These bounds carve out an allowed region with a rich boundary…