Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE (www.oxfordhandbooks.com). © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 18 September 2019

Abstract and Keywords

This article discusses some mathematical results and conjectures about random band matrix ensembles (RBM) and sparse matrix ensembles. Spectral problems of RBM and sparse matrices can be expressed in terms of supersymmetric (SUSY) statistical mechanics that provides a dual representation for disordered quantum systems. This representation offers important insights into nonperturbative aspects of the spectrum and eigenfunctions of RBM. The article first presents the definition of RBM ensembles before considering the density of states, the behaviour of eigenvectors, and eigenvalue statistics for RBM and sparse random matrices. In particular, it highlights the relations with random Schrödinger (RS) and the role of the dimension of the lattice. It also describes the connection between RBM and statistical mechanics, the spectral theory of large random sparse matrices, conjectures and theorems about eigenvectors and local spacing statistics, and the RS operator on the Cayley tree or Bethe lattice.

Keywords: random band matrix, random sparse matrix, random matrix ensemble, density of states, eigenvector, random Schrödinger, statistical mechanics, local spacing statistics, Cayley tree, Bethe lattice

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.