1992
DOI: 10.1007/bf02096594
|View full text |Cite
|
Sign up to set email alerts
|

The isomonodromy approach to matric models in 2D quantum gravity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

7
681
0
8

Year Published

1999
1999
2009
2009

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 529 publications
(696 citation statements)
references
References 17 publications
7
681
0
8
Order By: Relevance
“…This provides the first main step towards a rigorous analysis of the N → ∞, N = O(1) limit of the partition function and the Fredholm kernels determining the spectral statistics of coupled random matrices (essential, e.g., to the question of universality in 2-matrix models). Such an analysis should follow similar lines to those previously successfully applied to ordinary orthogonal polynomials in the 1-matrix case [6,17,19,20,10,11]. The main difference in the 2-(or more) matrix case is that in the double-scaling limit the functional dependence of the free energy on the eigenvalue distributions is not as explicit as in the 1-matrix models [23,18].…”
Section: Summary and Comments On Large N Asymptotics In Multimatrix Mmentioning
confidence: 68%
“…This provides the first main step towards a rigorous analysis of the N → ∞, N = O(1) limit of the partition function and the Fredholm kernels determining the spectral statistics of coupled random matrices (essential, e.g., to the question of universality in 2-matrix models). Such an analysis should follow similar lines to those previously successfully applied to ordinary orthogonal polynomials in the 1-matrix case [6,17,19,20,10,11]. The main difference in the 2-(or more) matrix case is that in the double-scaling limit the functional dependence of the free energy on the eigenvalue distributions is not as explicit as in the 1-matrix models [23,18].…”
Section: Summary and Comments On Large N Asymptotics In Multimatrix Mmentioning
confidence: 68%
“…We prove our results by characterizing the orthogonal polynomials via the well-known 2 × 2 matrix valued Fokas-Its-Kitaev Riemann-Hilbert (RH) problem [17] and applying the Deift/Zhou steepest descent method [13] to analyze this RH problem asymptotically. This approach has been used many times before, see e.g.…”
Section: Outline Of the Rest Of The Papermentioning
confidence: 76%
“…For each fixed n, s, and t, we consider the Fokas-Its-Kitaev Riemann-Hilbert problem [17] characterizing the orthogonal polynomials p (n,s,t) k with respect to the weight functions e −nVs,t . We seek a 2 × 2 matrix-valued function Y (z) = Y (z; n, s, t) (we suppress the n, s, and t dependence for brevity) that satisfies the following conditions.…”
Section: Rh Problem For Orthogonal Polynomialsmentioning
confidence: 99%
“…An application of particular interest for us is the appearance of the first and second Painlevé equation in the theory of random matrices, see e.g. [21,18,3,6,7]. In random matrix ensembles with certain unitary invariant probability measures, the eigenvalues accumulate on a finite union of intervals when the dimension of the matrices grows [8,9,10].…”
Section: Introduction and Statement Of Resultsmentioning
confidence: 99%