Related papers: Spectral Analysis for Non-Hermitian Matrices and D…
We present a spectral analysis for matrix scaling and operator scaling. We prove that if the input matrix or operator has a spectral gap, then a natural gradient flow has linear convergence. This implies that a simple gradient descent…
Examples are given of non-Hermitian Hamiltonian operators which have a real spectrum. Some of the investigated operators are expressed in terms of the generators of the Weil-Heisenberg algebra. It is argued that the existence of an…
A mixed graph is obtained from a graph by orienting some of its edges. The Hermitian adjacency matrix of a mixed graph with the vertex set $ \{v_{1}, \ldots , v_{n}\} $, is the matrix $ H=[h_{ij}]_{n \times n} $, where $ h_{ij}=-h_{ji}=i $…
A set of Hamiltonians that are not self-adjoint but have the spectrum of the harmonic oscillator is studied. The eigenvectors of these operators and those of their Hermitian conjugates form a bi-orthogonal system that provides a…
Eigenspectra that fill regions in the complex plane have been intriguing to many, inspiring research from random matrix theory to esoteric semi-infinite bounded non-Hermitian lattices. In this work, we propose a simple and robust ansatz for…
We establish bounds on the spectral radii for a large class of sparse random matrices, which includes the adjacency matrices of inhomogeneous Erd\H{o}s-R\'enyi graphs. Our error bounds are sharp for a large class of sparse random matrices.…
We provide upper bounds on the perturbation of invariant subspaces of normal matrices measured using a metric on the space of vector subspaces of $\mathbb{C}^n$ in terms of the spectrum of both the unperturbed \& perturbed matrices, as well…
For large dimensional non-Hermitian random matrices $X$ with real or complex independent, identically distributed, centered entries, we consider the fluctuations of $f(X)$ as a matrix where $f$ is an analytic function around the spectrum of…
The traditional adjacency matrix of a mixed graph is not symmetric in general, hence its eigenvalues may be not real. To overcome this obstacle, several authors have recently defined and studied various Hermitian adjacency matrices of…
A $\mathbb{T}$-gain graph is a simple graph in which a unit complex number is assigned to each orientation of an edge, and its inverse is assigned to the opposite orientation. The associated adjacency matrix is defined canonically, and is…
Classical spectral theory gives a complete description of a single normal operator, but it fails for noncommuting operators, where no canonical joint spectrum or simultaneous diagonalization exists. Existing approaches provide only partial…
In this letter, we study how the spectrum of pseudo-Hermitian systems is influenced by the ambiguity in the choice of the pseudo-metric operator. In particular, we analyze the case when different parameter-independent choices of…
Nonlinear spectral graph theory is an extension of the traditional (linear) spectral graph theory and studies relationships between spectral properties of nonlinear operators defined on a graph and topological properties of the graph…
In a previous paper (arXiv:math-ph/0604055) we introduced a very simple PT-symmetric non-Hermitian Hamiltonian with real spectrum and derived a closed formula for the metric operator relating the problem to a Hermitian one. In this note we…
A non-Hermitian generalisation of the Marsden--Weinstein reduction method is introduced to construct families of quantum $\mathcal{PT}$-symmetric superintegrable models over an $n$-dimensional sphere $S^n$. The mechanism is illustrated with…
The applicability of the optical theorem in the models with the non-Hermitian Hamiltonian is studied. By way of example we consider the $n\bar{n}$ transition in a medium followed by annihilation. It is shown that an application of optical…
We show various upper bounds for the order of a digraph (or a mixed graph) whose Hermitian adjacency matrix has an eigenspace of prescribed codimension. In particular, this generalizes the so-called absolute bound for (simple) graphs first…
A non-Hermitian Hamiltonian that has an unbroken PT symmetry can be converted by means of a similarity transformation to a physically equivalent Hermitian Hamiltonian. This raises the following question: In which form of the quantum theory,…
We consider a random quantum channel obtained by taking a selection of $d$ independent and Haar distributed $N$ dimensional unitaries. We follow the argument of Hastings to bound the spectral gap in terms of eigenvalues and adapt it to give…
The feasibility conditions obtained in a previous report are refined, and used to determine several infinite families of feasible parameters for strongly regular graphs with no triangles. The methods are also used to improve the lower bound…