Related papers: Spectral Analysis for Non-Hermitian Matrices and D…
We investigate traces of powers of random matrices whose distributions are invariant under rotations (with respect to the Hilbert--Schmidt inner product) within a real-linear subspace of the space of $n\times n$ matrices. The matrices we…
A condition to have a real spectrum for a non-Hermitian Hamiltonian is given. As special cases, it is shown that the condition is reduced to Hermiticity and PT symmetric conditions.
Graph clustering is a fundamental technique in data analysis with applications in many different fields. While there is a large body of work on clustering undirected graphs, the problem of clustering directed graphs is much less understood.…
For non-Hermitian equilateral q-pointed star-shaped quantum graphs of paper I [Can. J. Phys. 90, 1287 (2012), arXiv 1205.5211] we show that due to certain dynamical aspects of the model as controlled by the external, rotation-symmetric…
For general large non-Hermitian random matrices $X$ and deterministic normal deformations $A$, we prove that the local eigenvalue statistics of $A+X$ close to the critical edge points of its spectrum are universal. This concludes the proof…
We study the equivalence between bipartiteness and symmetry of spectra of mixed graphs, for $\theta$-Hermitian adjacency matrices defined by an angle $\theta \in (0, \pi]$. We show that this equivalence holds when, for example, an angle…
We study the connection between *-representations of algebras associated with graphs, locally-scalar graph representations and the problem about the spectrum of a sum of two Hermitian operators. For algebras associated with Dynkin graphs we…
One of the great miracles of random matrix theory is that, in the $N \to \infty$ limit, many otherwise intractable matrix problems with horrendously complicated finite-$N$ expressions admit remarkably simple and elegant asymptotic…
Pseudo-hermitian matrices are matrices hermitian with respect to an indefinite metric. They can be thought of as the truncation of pseudo-hermitian operators, defined over some Krein space, together with the associated metric, to a finite…
Graph representation matrices are essential tools in graph data analysis. Recently, Hermitian adjacency matrices have been proposed to investigate directed graph structures. Previous studies have demonstrated that these matrices can extract…
Non-Hermitian matrices are ubiquitous in the description of nature ranging from classical dissipative systems, including optical, electrical, and mechanical metamaterials, to scattering of waves and open quantum many-body systems. Seminal…
In this work we present a general formalism to treat non-Hermitian and noncommutative Hamiltonians. This is done employing the phase-space formalism of quantum mechanics, which allows to write a set of robust maps connecting the Hamitonians…
In some previous works, the analytic structure of the spectrum of a quantum graph operator as a function of the vertex conditions and other parameters of the graph was established. However, a specific local coordinate chart on the…
There is a connection between *-representations of algebras associated with graphs and the problem about the spectrum of a sum of Hermitian operators (spectral problem). For algebras associated with extended Dynkin graphs we give an…
We use tools from free probability to study the spectra of Hermitian operators on infinite graphs. Special attention is devoted to universal covering trees of finite graphs. For operators on these graphs we derive a new variational formula…
Let $G$ be a finite connected graph on two or more vertices and $G^{[N,k]}$ the distance $k$-graph of the $N$-fold Cartesian power of $G$. For a fixed $k\ge1$, we obtain explicitly the large $N$ limit of the spectral distribution (the…
Let $R$ be a Hermitian matrix. The energy of $R$, $\mathcal{E}(R)$, corresponds to the sum of the absolute values of its eigenvalues. In this work it is obtained two lower bounds for $\mathcal{E}(R).$ The first one generalizes a lower bound…
A signed directed graph is a graph with sign and direction information on the edges. Even though signed directed graphs are more informative than unsigned or undirected graphs, they are more complicated to analyze and have received less…
A non-Hermitean extension of paradigmatic Wishart random matrices is introduced to set up a theoretical framework for statistical analysis of (real, complex and real quaternion) stochastic time series representing two "remote" complex…
We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…