For inhomogeneous random graphs with a graphon variance profile, the traces of powers of the adjacency matrix, suitably rescaled, converge to Gaussian processes with covariances expressible as graphon homomorphism densities.
Large deviations for macroscopic observables of heavy-tailed matrices
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We consider a finite collection of independent Hermitian heavy-tailed random matrices of growing dimension. Our model includes the L\'evy matrices proposed by Bouchaud and Cizeau, as well as sparse random matrices with O(1) non-zero entries per row. By representing these matrices as weighted graphs, we derive a large deviations principle for key macroscopic observables. Specifically, we focus on the empirical distribution of eigenvalues, the joint neighborhood distribution, and the joint traffic distribution. As an application, we define a notion of microstates entropy for traffic distributions which is additive for free traffic convolution.
citation-role summary
citation-polarity summary
fields
math.PR 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Central limit theorems for linear spectral statistics of inhomogeneous random graphs with graphon limits
For inhomogeneous random graphs with a graphon variance profile, the traces of powers of the adjacency matrix, suitably rescaled, converge to Gaussian processes with covariances expressible as graphon homomorphism densities.