ترغب بنشر مسار تعليمي؟ اضغط هنا

Application de la recurrence topologique aux integrales de matrices aleatoires et aux syst`emes integrables

104   0   0.0 ( 0 )
 نشر من قبل Olivier Marchal
 تاريخ النشر 2017
  مجال البحث فيزياء
والبحث باللغة English
 تأليف Olivier Marchal




اسأل ChatGPT حول البحث

The goal of this Habilitation `a diriger des recherches is to present two different applications, namely computations of certain partition functions in probability and applications to integrable systems, of the topological recursion developed by B. Eynard and N. Orantin in 2007. Since its creation, the range of applications of the topological recursion has been growing and many results in different fields have been obtained. The first aspect that I will develop deals with the historical domain of the topological recursion: random matrix integrals. I will review the formalism of the topological recursion as well as how it can be used to obtain asymptotic $frac{1}{N}$ series expansion of various matrix integrals. In particular, a key feature of the topological recursion is that it can recover from the leading order of the asymptotic all sub-leading orders with elementary computations. This method is particularly well known and fruitful in the case of hermitian matrix integrals, but I will also show that the general method can be used to cover integrals with hard edges, integrals over unitary matrices and much more. In the end, I will also briefly mention the generalization to $beta$-ensembles. In a second chapter, I will review the connection between the topological recursion and the study of integrable systems having a Lax pair representation. Most of the results presented there will be illustrated by the case of the famous six Painleve equations. Though the formalism used in this chapter may look completely disconnected from the previous one, it is well known that the local statistics of eigenvalues in random matrix theory exhibit a universality phenomenon and that the encountered universal systems are precisely driven by some solutions of the Painlev{e} equations. As I will show, the connection can be made very explicit with the topological recursion formalism.

قيم البحث

اقرأ أيضاً

99 - Aziz Elghazouani 2021
On this thesis we present the fuzzy sets, fuzzy numbers, the fractional derivative and also we discuss the solution of the first order of fuzzy hybrid equation.
Let X be a complex analytic manifold and D subset X a free divisor. Integrable logarithmic connections along D can be seen as locally free {cal O}_X-modules endowed with a (left) module structure over the ring of logarithmic differential operators {c al D}_X(log D). In this paper we study two related results: the relationship between the duals of any integrable logarithmic connection over the base rings {cal D}_X and {cal D}_X(log D), and a differential criterion for the logarithmic comparison theorem. We also generalize a formula of Esnault-Viehweg in the normal crossing case for the Verdier dual of a logarithmic de Rham complex.
We propose a formula expressing Perron - Frobenius eigenvectors of Cartan matrices in terms of products of values of the Gamma function.
Nous montrons que les equations du rep`ere mobile des surfaces de Bonnet conduisent `a une paire de Lax matricielle isomonodromique dordre deux pour la sixi`eme equation de Painleve. We show that the moving frame equations of Bonnet surfaces can be extrapolated to a second order, isomonodromic matrix Lax pair of the sixth Painleve equation.
56 - Robin Genuer 2016
Two algorithms proposed by Leo Breiman : CART trees (Classification And Regression Trees for) introduced in the first half of the 80s and random forests emerged, meanwhile, in the early 2000s, are the subject of this article. The goal is to provide e ach of the topics, a presentation, a theoretical guarantee, an example and some variants and extensions. After a preamble, introduction recalls objectives of classification and regression problems before retracing some predecessors of the Random Forests. Then, a section is devoted to CART trees then random forests are presented. Then, a variable selection procedure based on permutation variable importance is proposed. Finally the adaptation of random forests to the Big Data context is sketched.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا