arXiv · 2106.10125
Sparse Random Block Matrices
Abstract
The spectral moments of ensembles of sparse random block matrices are analytically evaluated in the limit of large order. The structure of the sparse matrix corresponds to the Erd\"os-Renyi random graph. The blocks are i.i.d. random matrices of the classical ensembles GOE or GUE. The moments are evaluated for finite or infinite dimension of the blocks. The correspondences between sets of closed walks on trees and classes of irreducible partitions studied in free probability together with functional relations are powerful tools for analytic evaluation of the limiting moments. They are helpful to identify probability laws for the blocks and limits of the parameters which allow the evaluation of all the spectral moments and of the spectral density.
Explore related subjects
Keep this discovery
Giovanni M. Cicuta, Mario Pernici. 2021-06-18. Sparse Random Block Matrices. https://doi.org/10.1088/1751-8121%2Fac3468
Cite the original work for its findings. Save a collection to share your selection of sources.