Related papers: Spectral scales and linear pencils
The process of alternately row scaling and column scaling a positive $n \times n$ matrix $A$ converges to a doubly stochastic positive $n \times n$ matrix $S(A)$, often called the \emph{Sinkhorn limit} of $A$. The main result in this paper…
Some arithmetic properties of spectral curves are discussed: the spectral curve, for example, of a charge $n\ge2$ Euclidean BPS monopole is not defined over $\overline{\mathbb{Q}}$ if smooth.
Graph matrices are a type of matrix which has played a crucial role in analyzing the sum of squares hierarchy on average case problems. However, except for rough norm bounds, little is known about graph matrices. In this paper, we take a…
A complete analysis of the essential spectrum of matrix-differential operators $\mathcal A$ of the form \begin{align} \begin{pmatrix} -\displaystyle{\frac{\rm d}{\rm d t}} p \displaystyle{\frac{\rm d}{\rm d t}} + q &…
In an attempt to progress towards proving the conjecture the numerical range W (A) is a 2--spectral set for the matrix A, we propose a study of various constants. We review some partial results, many problems are still open. We describe our…
A 1989 result of Duarte asserts that for a given tree T on n vertices, a fixed vertex i, and two sets of distinct real numbers L, M of sizes n and n-1, respectively, such that M strictly interlaces L, there is a real symmetric matrix A such…
We present a spectral theory of hypergraphs that closely parallels Spectral Graph Theory. A number of recent developments building upon classical work has led to a rich understanding of "hyperdeterminants" of hypermatrices, a.k.a.…
We establish spectral enclosures and spectral approximation results for the inhomogeneous lossy Drude-Lorentz system with purely imaginary poles, in a possibly unbounded Lipschitz domain of $\mathbb{R}^3$. Under the assumption that the…
Let $A$ be a Banach algebra. By $\sigma(x)$ and $r(x)$ we denote the spectrum and the spectral radius of $x\in A$, respectively. We consider the relationship between elements $a,b\in A$ that satisfy one of the following two conditions: (1)…
We consider the spectrum of random Laplacian matrices of the form $L_n=A_n-D_n$ where $A_n$ is a real symmetric random matrix and $D_n$ is a diagonal matrix whose entries are equal to the corresponding row sums of $A_n$. If $A_n$ is a…
The spectrum of a network or graph $G=(V,E)$ with adjacency matrix $A$, consists of the eigenvalues of the normalized Laplacian $L= I - D^{-1/2} A D^{-1/2}$. This set of eigenvalues encapsulates many aspects of the structure of the graph,…
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…
The spectral symbols are useful tools to analyse the eigenvalue distribution when dealing with high dimensional linear systems. Given a matrix sequence with an asymptotic symbol, the last one depends only on the spectra of the individual…
Many common methods for data analysis rely on linear algebra. We provide new results connecting data analysis error to numerical accuracy, which leads to the first meaningful stopping criterion for two way spectral partitioning. More…
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.…
Motivated by questions of present interest in nuclear and condensed matter physics we consider the superposition of a diagonal matrix with independent random entries and a GUE. The relative strength of the two contributions is determined by…
We show that for a given set $\Lambda$ of $nk$ distinct real numbers $\lambda_1, \lambda_2, \ldots, \lambda_{nk}$ and $k$ graphs on $n$ nodes, $G_0, G_1,\ldots,G_{k-1}$, there are real symmetric $n\times n$ matrices $A_s$, $s=0,1,\ldots,…
We study the asymptotic behavior of the spectrum of a random matrix where a non-linearity is applied entry-wise to a Wigner matrix perturbed by a rank-one spike with independent and identically distributed entries. In this setting, we show…
The paper gives a thorough introduction to spectra of digraphs via its Hermitian adjacency matrix. This matrix is indexed by the vertices of the digraph, and the entry corresponding to an arc from $x$ to $y$ is equal to the complex unity…
In this work, we develop a spectral theory for hypergraph limits. We prove the convergence of the spectra of adjacency and Laplacian matrices for hypergraph sequences converging in the $1$-cut metric. On the other hand, we give examples of…