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: 19 October 2019

Abstract and Keywords

This article considers phase transitions in matrix models that are invariant under a symmetry group as well as those that occur in some matrix ensembles with preferred basis, like the Anderson transition. It first reviews the results for the simplest model with a nontrivial set of phases, the one-matrix Hermitian model with polynomial potential. It then presents a view of the several solutions of the saddle point equation. It also describes circular models and their Cayley transform to Hermitian models, along with fixed trace models. A brief overview of models with normal, chiral, Wishart, and rectangular matrices is provided. The article concludes with a discussion of the curious single-ring theorem, the successful use of multi-matrix models in describing phase transitions of classical statistical models on fluctuating two-dimensional surfaces, and the delocalization transition for the Anderson, Hatano-Nelson, and Euclidean random matrix models.

Keywords: phase transition, Hermitian model, polynomial potential, saddle point equation, circular model, fixed trace model, single-ring theorem, multi-matrix model, delocalization transition, random matrix model

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.