arXiv Analytics

Sign in

arXiv:0811.3531 [math-ph]AbstractReferencesReviewsResources

Algebraic methods in random matrices and enumerative geometry

Bertrand Eynard, Nicolas Orantin

Published 2008-11-21Version 1

We review the method of symplectic invariants recently introduced to solve matrix models loop equations, and further extended beyond the context of matrix models. For any given spectral curve, one defined a sequence of differential forms, and a sequence of complex numbers Fg . We recall the definition of the invariants Fg, and we explain their main properties, in particular symplectic invariance, integrability, modularity,... Then, we give several example of applications, in particular matrix models, enumeration of discrete surfaces (maps), algebraic geometry and topological strings, non-intersecting brownian motions,...

Comments: review article, Latex, 139 pages, many figures
Categories: math-ph, hep-th, math.MP
Related articles: Most relevant | Search more
arXiv:1009.1945 [math-ph] (Published 2010-09-10, updated 2011-10-07)
Large deviations of the maximal eigenvalue of random matrices
arXiv:math-ph/0505003 (Published 2005-05-02)
Semicircle law and freeness for random matrices with symmetries or correlations
arXiv:1804.06166 [math-ph] (Published 2018-04-17)
Regular expansion for the characteristic exponent of a product of $2 \times 2$ random matrices