Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1710.06705

Application de la r\'ecurrence topologique aux int\'egrales de matrices al\'eatoires et aux syst\`emes int\'egrables

Olivier Marchal
View original source ↗Read source document ↗Export metadata ↓

Abstract

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 Painlev\'e 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.

Explore related subjects

math-phhep-thmath.MPmath.PR

Keep this discovery

BibTeXRIS

Olivier Marchal. 2017-10-18. Application de la r\'ecurrence topologique aux int\'egrales de matrices al\'eatoires et aux syst\`emes int\'egrables. https://arxiv.org/abs/1710.06705

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Why we should condition denoising diffusion generative models on windows of past observations

Data assimilation (DA) is, traditionally, a cycling process that relies on time-dependent priors to propagate information from past observations to future cycles. Using denoising diffusion generative modeling for DA is challenging because standard approaches use a fixed training data set, which in turn leads to a static prior that ignores information from past observations. Because past observations are ignored, DA systems with static priors lead to larger posterior errors than cycling DA systems. Incorporating time-dependent priors into generative models, however, requires expensive and frequent retraining. Motivated by linear systems theory - where the dependence of a prediction of a Kalman filter on past observations decays exponentially - we condition diffusion models on short windows of past observations. Specifically, we describe training procedures for two frameworks: a diffusion DA system predicting the current state given a set of past observations, and a diffusion ``direct observation prediction'' (DOP) system, predicting future observations given a set of past observations. Using a canonical linear system, we show that both systems can achieve the minimal posterior error characteristic of a fully-cycled DA/DOP system, without re-training, provided the time windows are long enough. The linear setup ensures analytical tractability, avoids confounding neural network training errors, and confirms that conditioning on windows of past observations is required for efficient and accurate diffusion-based DA or DOP.

math-ph↗
arXiv2026

The kinematic structures and the inertial geometry of a moving charge

We ask how much of the geometry a charged particle moves in is fixed by its motion, and how much a particle must bring. We ask of a symplectic structure only that it relate velocity to momentum as Hamilton's equations do, and we ask it of every energy at once. In particular, we show that the structures meeting that demand are the canonical one and its twists by a closed two-form of the base. A field provides the two-form, a particle the multiplier before it, which we identify constitutively with its charge. Thus, a single energy governs a family of structures, and each particle takes the one its charge fixes. We then ask what a particle must bring to be given a momentum, and we show that the degree of that map settles the degree at which a field enters Newton's Second Law. An antisymmetric bilinear form returns no Lorentz force, whilst a Randers metric returns one --- a length whose difference from a Riemannian one is linear in the velocity. Moreover, we find that metric already within the twisted structure, as its primitive over a level of the free energy, and its law of transport to be nonlinear, no affine connection being known to serve. Under an indefinite signature the length parts from the dynamics, and the extremals turn from shortest to longest. On the round sphere a monopole flux leaves no such metric, whilst the transport remains and prequantisation, given a unit of action, restricts the charge to a lattice. In this manner, we conclude that each charge-to-mass ratio receives a geometry of its own, so that by a functionalist criterion none of them is the spacetime of a charged particle.

math-ph↗