Related papers: Defective eigenvalues of the non-backtracking matr…

We consider certain matrix-products where successive matrices in the product belong alternately to a particular qualitative class or its transpose. The main theorems relate structural and spectral properties of these matrix-products to the…

The inverse eigenvalue problem studies the possible spectra among matrices whose off-diagonal entries have their zero-nonzero patterns described by the adjacency of a graph $G$. In this paper, we refer to the $i$-nullity pair of a matrix…

The dynamics of networks of interacting systems depends intricately on the interaction topology. When the dynamics is explored, generally the whole topology has to be considered. However, we show that there are certain mesoscale subgraphs…

We give a short proof of a recent result by Bernik, Mastnak, and Radjavi, stating that an irreducible group of complex matrices with nonnegative diagonal entries is diagonally similar to a group of nonnegative monomial matrices. We also…

We describe combinatorial approaches to the question of whether families of real matrices admit pairs of nonreal eigenvalues passing through the imaginary axis. When the matrices arise as Jacobian matrices in the study of dynamical systems,…

We consider a discrete, non-Hermitian random matrix model, which can be expressed as a shift of a rank-one perturbation of an anti-symmetric matrix. We show that, asymptotically almost surely, the real parts of the eigenvalues of the…

The comparison of graphs is a vitally important, yet difficult task which arises across a number of diverse research areas including biological and social networks. There have been a number of approaches to define graph distance however…

A discrete Schr\"odinger operator of a graph $G$ is a real symmetric matrix whose $i,j$-entry, $i \neq j$, is negative if $\{i,j\}$ is an edge and zero if it is not an edge, while diagonal entries can be any real numbers. The discrete…

We discuss the eigenvalue problem for 3x3 octonionic Hermitian matrices which is relevant to the Jordan formulation of quantum mechanics. In contrast to the eigenvalue problems considered in our previous work, all eigenvalues are real and…

Random matrices have played an important role in many fields including machine learning, quantum information theory and optimization. One of the main research focuses is on the deviation inequalities for eigenvalues of random matrices.…

In this paper we consider generalized eigenvalue problems for a family of operators with a polynomial dependence on a complex parameter. This problem is equivalent to a genuine non self-adjoint operator. We discuss here existence of non…

Here, the structural symmetries of a hypergraph are represented through equivalence relations on the vertex set of the hypergraph. A matrix associated with the hypergraph may not reflect a specific structural symmetry. In the context of a…

Markov matrices have an important role in the filed of stochastic processes. In this paper, we will show and prove a series of conclusions on Markov matrices and transformations rather than pay attention to stochastic processes although…

We establish a Harnack inequality for finite connected graphs with non-negative Ricci curvature. As a consequence, we derive an eigenvalue lower bound, extending previous results for Ricci flat graphs.

We introduce two kinds of matrix-valued dynamical processes generated by nonnormal Toeplitz matrices with the additive rank 1 perturbations $\delta J$, where $\delta \in {\mathbb{C}}$ and $J$ is the all-ones matrix. For each process, first…

Whether comparing networks to each other or to random expectation, measuring dissimilarity is essential to understanding the complex phenomena under study. However, determining the structural dissimilarity between networks is an ill-defined…

We consider a new class of non-self-adjoint matrices that arise from an indefinite self-adjoint linear pencil of matrices, and obtain the spectral asymptotics of the spectra as the size of the matrices diverges to infinity. We prove that…

In this paper, we completely characterize the graphs with third largest distance eigenvalue at most $-1$ and smallest distance eigenvalue at least $-3$. In particular, we determine all graphs whose distance matrices have exactly two…

We study the eigenvalue spectrum of a large real antisymmetric random matrix $J_{ij}$. Using a fermionic approach and replica trick, we obtain a semicircular spectrum of eigenvalues when the mean value of each matrix element is zero, and in…

We give a classification of Jordan-Chevalley decompositions of an endomorphism of a finite-dimensional vector space over a not necessarily perfect field, i.e. additive decompositions into commuting semisimple and nilpotent endomorphisms.