Probabilistic Analysis of the Random Spectral Radius for a Matrix Family
Francesco Paolo Maiale, Anastasiia Trofimova, Nicola Guglielmi
TL;DR
This work introduces the random spectral radius (RSR) as a probabilistic growth rate for products of matrices drawn from a finite family. By modeling length-$n$ products with IID sampling, the authors establish Law of Large Numbers and Central Limit Theorems for commuting and triangular matrix families, deriving explicit limiting values $\rho_\infty$ and Gaussian fluctuations with scale $n^{-1/2}$ (and Edgeworth refinements). They extend the analysis to small perturbations of diagonal matrices via perturbation theory and demonstrate robustness of the LLN/CLT under perturbations, while numerical experiments suggest similar typical-behavior generalizes to unconstrained matrix families. The results provide a probabilistic framework bridging deterministic extremal measures (JSR/LSR) and average-case dynamics, with implications for stability analysis of switching systems and refinement equations. The work also outlines future directions for nonnegative matrices and broader generalizations, linking to Lyapunov exponents and Perron–Frobenius theory.
Abstract
We investigate joint spectral characteristics of a family of matrices $\mathcal{F}$, associated with products in the semigroup generated by $\mathcal{F}$. In the literature, extremal measures such as the well-known joint spectral radius and the lower spectral radius have been extensively studied. However, these measures fail to capture the typical growth rate of matrix products, focusing instead on the worst and best-case scenarios. Nevertheless, when examining, for instance, a switching dynamical system, a probabilistic rate of growth, which characterizes typical trajectories, emerges as a highly intriguing and significant measure. In this article, we present, to the best of our knowledge, the first rigorous analysis of the random spectral radius. This joint spectral characteristic is computed on the set of length-$n$ products from a semigroup by random sampling according to a given probability measure. We establish asymptotic results-including a Law of Large Numbers and a Central Limit Theorem-for cases where the matrices are either diagonal (equivalently, commuting), upper- or lower-triangular, or small perturbations of diagonal matrices. Subsequently, we provide numerical evidence that the random spectral radius of arbitrary (that is structurally unconstrained) families of matrices exhibits asymptotic behavior similar to that of diagonal or nearly diagonal matrix families.
