Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE ( © 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: 22 September 2019

Abstract and Keywords

This article discusses the interaction between random matrix theory (RMT) and integrable theory, leading to ordinary and partial differential equations (PDEs) for the eigenvalue distribution of random matrix models of size n and the transition probabilities of non-intersecting Brownian motion models, for finite n and for n → ∞. It first provides an overview of the connection between the theory of orthogonal polynomials and the KP-hierarchy in integrable systems before examining matrix models and the Virasoro constraints. It then considers multiple orthogonal polynomials, taking into account non-intersecting Brownian motions on ℝ (Dyson’s Brownian motions), a moment matrix for several weights, Virasoro constraints, and a PDE for non-intersecting Brownian motions. It also analyses critical diffusions, with particular emphasis on the Airy process, the Pearcey process, and Airy process with wanderers. Finally, it describes the Tacnode process, along with kernels and p-reduced KP-hierarchy.

Keywords: random matrix theory (RMT), integrable theory, Brownian motion, orthogonal polynomial, KP-hierarchy, random matrix model, Virasoro constraints, critical diffusion, Airy process, Pearcey process

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.