Papers
Topics
Authors
Recent
Search
2000 character limit reached

Sparse Random Block Matrices

Published 18 Jun 2021 in math-ph, cond-mat.stat-mech, math.CO, math.MP, and math.PR | (2106.10125v1)

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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.