On the spectrum of random anti-symmetric and tournament matrices

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 non-Hermitian matrix around any fixed index are interlaced with those of the anti-symmetric matrix. Along the way, we show that some tools recently developed to study the eigenvalue distributions of Hermitian matrices extend to the anti-symmetric setting.

Square roots of doubly regular tournament matrices

Fletcher asked whether there is a (0, 1)-matrix of order greater than 3 whose square is a regular tournament matrix. We give a negative answer for a special class of regular tournament matrices: There is no (0, 1)-matrix of order greater than 3 whose square is a doubly regular tournament matrix.

Pseudo-Tournament Matrices and Their Eigenvalues

A tournament matrix and its corresponding directed graph both arise as a record of the outcomes of a round robin competition. An n × n complex matrix A is called h-pseudo-tournament if there exists a complex or real nonzero column vector h such that A + A* = hh* − I. This class of matrices is a generalisation of well-studied tournament-like matrices such as h-hypertournament matrices, generalised tournament matrices, tournament matrices, and elliptic matrices. We discuss the eigen-properties of an h-pseudo-tournament matrix, and obtain new results when the matrix specialises to one of these tournament-like matrices. Further, several results derived in previous articles prove to be corollaries of those reached here.