Disentangling giant component and finite cluster contributions in sparse random matrix spectra.
basic_science · Level V
Where this comes from
- Record sourced from PubMed, PMID 27176257.
- Also identified by DOI 10.1103/PhysRevE.93.042110.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
We describe a method for disentangling giant component and finite cluster contributions to sparse random matrix spectra, using sparse symmetric random matrices defined on Erdős-Rényi graphs as an example and test bed. Our methods apply to sparse matrices defined in terms of arbitrary graphs in the configuration model class, as long as they have finite mean degree.