Table of Contents
Fetching ...

On the spectral radius and the characteristic polynomial of a random matrix with independent elements and a variance profile

Walid Hachem, Michail Louvaris

TL;DR

This work analyzes the spectral radius of large non-Hermitian random matrices with a general variance profile. By studying the reverse characteristic polynomial $q_n(z)$ and establishing its asymptotic equivalence to a random analytic function $\kappa_n(z)\exp(-F_n(z))$, the authors derive a high-probability confinement $\rho(X^{(n)}) \le \sqrt{\rho(S^{(n)})}$ (under suitable normalizations) and extend the analysis to sparse and continuous variance profiles. The approach, inspired by Bordenave–Chafaï–García-Zelada, requires only minimal moment assumptions and yields examples including block profiles, continuous kernels, and inhomogeneous directed Erdős–Rényi models, with robust results under both dense and sparse regimes. These findings link the spectral properties of random matrices to the geometry of their variance profiles, enabling applications to dynamical systems, networks, and related stochastic models where inhomogeneity and sparsity are essential features.

Abstract

In this paper, it is shown that with large probability, the spectral radius of a large non-Hermitian random matrix with a general variance profile does not exceed the square root of the spectral radius of the variance profile matrix. A minimal moment assumption is considered and sparse variance profiles are covered. Following an approach developed recently by Bordenave, Chafa{ï} and Garc{í}a-Zelada, the key theorem states the asymptotic equivalence between the reverse characteristic polynomial of the random matrix at hand and a random analytic function which depends on the variance profile matrix. The result is applied to the case of a non-Hermitian random matrix with a variance profile given by a piecewise constant or a continuous non-negative function, the inhomogeneous (centered) directed Erdős-R{é}nyi model, and more.

On the spectral radius and the characteristic polynomial of a random matrix with independent elements and a variance profile

TL;DR

This work analyzes the spectral radius of large non-Hermitian random matrices with a general variance profile. By studying the reverse characteristic polynomial and establishing its asymptotic equivalence to a random analytic function , the authors derive a high-probability confinement (under suitable normalizations) and extend the analysis to sparse and continuous variance profiles. The approach, inspired by Bordenave–Chafaï–García-Zelada, requires only minimal moment assumptions and yields examples including block profiles, continuous kernels, and inhomogeneous directed Erdős–Rényi models, with robust results under both dense and sparse regimes. These findings link the spectral properties of random matrices to the geometry of their variance profiles, enabling applications to dynamical systems, networks, and related stochastic models where inhomogeneity and sparsity are essential features.

Abstract

In this paper, it is shown that with large probability, the spectral radius of a large non-Hermitian random matrix with a general variance profile does not exceed the square root of the spectral radius of the variance profile matrix. A minimal moment assumption is considered and sparse variance profiles are covered. Following an approach developed recently by Bordenave, Chafa{ï} and Garc{í}a-Zelada, the key theorem states the asymptotic equivalence between the reverse characteristic polynomial of the random matrix at hand and a random analytic function which depends on the variance profile matrix. The result is applied to the case of a non-Hermitian random matrix with a variance profile given by a piecewise constant or a continuous non-negative function, the inhomogeneous (centered) directed Erdős-R{é}nyi model, and more.
Paper Structure (18 sections, 18 theorems, 123 equations)