To participate in this seminar, please register HERE.

We provide an introduction to recent results on the large N behavior of beta-ensembles, also known as log-gases. In the first part, we focus on the rigidity property of the spectrum which provides fine estimates on the fluctuations of eigenvalues and explain how this relate to universality. In the second part, we explain how to prove the CLT for linear statistics using loop equations and mention the connection to log-correlated fields and Gaussian multiplicative chaos.

To register for this course, go to: https://www.msri.org/seminars/26228

This class aims at understanding some important classes of smooth random functions of very many variables.

What can be said about the complexity of the topology of the landscapes they define?

How efficient are the natural exploration or optimization algorithms in these landscapes?

The toolbox of Random Matrix Theory will be used for both questions.

We will concentrate on two wide classes of interesting smooth random functions of many variables.

A first source of such functions is to be found in statistical mechanics of disordered systems, i.e. the Hamiltonians of disordered models, like spin-glasses. There the randomness is assumed to model quenched disorder in the medium.

Another rich class of such functions comes from Data Science and studies the random landscapes of inference problems in high-dimensional statistical estimation. Here the randomness of these landscapes is the randomness inherent in sampling.

To participate in this seminar, please register HERE.

In this course I will present two techniques to construct Fredholm determinants starting from an integrable system. One of these techniques will be based on the Riemann-Hilbert method and the other only requires the knowledge of the associated linear system. My choice of examples will be Painlev\'e equations, although the techniques are applicable to a wide variety of problems.

To participate in this seminar, please register HERE.

For uniformly random permutations of length n, it is well known that the length of the longest increasing subsequence is very close to 2 \sqrt{n}. More generally, the Schensted shape of the permutation (under Schensted insertion) rescaled by 1/\sqrt{n} converges to a certain non-random limit shape and described by Vershik--Kerov and Logan--Shepp. When looking at a sequence of numbers which claims to be "pseudo-random", one could ask whether the longest increasing subsequence and the Schensted shape have similar limits. For most pseudo-random sequences, I do not know the answer to this question so there will be some open questions posed. For the sequence consisting of the fractional parts of multiples of an irrational number, the answer is "no", and I will discuss joint work with T. Kyle Petersen which explores the behavior of the Schensted shape, which can be described explicitly in terms arithmetic properties of the irrational number which generates the sequence.

To participate in this seminar, please register HERE.

To register for this course, go to: https://www.msri.org/seminars/26228

This class aims at understanding some important classes of smooth random functions of very many variables.

What can be said about the complexity of the topology of the landscapes they define?

How efficient are the natural exploration or optimization algorithms in these landscapes?

The toolbox of Random Matrix Theory will be used for both questions.

We will concentrate on two wide classes of interesting smooth random functions of many variables.

A first source of such functions is to be found in statistical mechanics of disordered systems, i.e. the Hamiltonians of disordered models, like spin-glasses. There the randomness is assumed to model quenched disorder in the medium.

Another rich class of such functions comes from Data Science and studies the random landscapes of inference problems in high-dimensional statistical estimation. Here the randomness of these landscapes is the randomness inherent in sampling.

To register for this course, go to: https://www.msri.org/seminars/26228

This class aims at understanding some important classes of smooth random functions of very many variables.

What can be said about the complexity of the topology of the landscapes they define?

How efficient are the natural exploration or optimization algorithms in these landscapes?

The toolbox of Random Matrix Theory will be used for both questions.

We will concentrate on two wide classes of interesting smooth random functions of many variables.

A first source of such functions is to be found in statistical mechanics of disordered systems, i.e. the Hamiltonians of disordered models, like spin-glasses. There the randomness is assumed to model quenched disorder in the medium.

Another rich class of such functions comes from Data Science and studies the random landscapes of inference problems in high-dimensional statistical estimation. Here the randomness of these landscapes is the randomness inherent in sampling.

To register for this course, go to: https://www.msri.org/seminars/26228

This class aims at understanding some important classes of smooth random functions of very many variables.

What can be said about the complexity of the topology of the landscapes they define?

How efficient are the natural exploration or optimization algorithms in these landscapes?

The toolbox of Random Matrix Theory will be used for both questions.

We will concentrate on two wide classes of interesting smooth random functions of many variables.

A first source of such functions is to be found in statistical mechanics of disordered systems, i.e. the Hamiltonians of disordered models, like spin-glasses. There the randomness is assumed to model quenched disorder in the medium.

Another rich class of such functions comes from Data Science and studies the random landscapes of inference problems in high-dimensional statistical estimation. Here the randomness of these landscapes is the randomness inherent in sampling.

To register for this course, go to: https://www.msri.org/seminars/26228

This class aims at understanding some important classes of smooth random functions of very many variables.

What can be said about the complexity of the topology of the landscapes they define?

How efficient are the natural exploration or optimization algorithms in these landscapes?

The toolbox of Random Matrix Theory will be used for both questions.

We will concentrate on two wide classes of interesting smooth random functions of many variables.

A first source of such functions is to be found in statistical mechanics of disordered systems, i.e. the Hamiltonians of disordered models, like spin-glasses. There the randomness is assumed to model quenched disorder in the medium.

Another rich class of such functions comes from Data Science and studies the random landscapes of inference problems in high-dimensional statistical estimation. Here the randomness of these landscapes is the randomness inherent in sampling.

To register for this course, go to: https://www.msri.org/seminars/26228

This class aims at understanding some important classes of smooth random functions of very many variables.

What can be said about the complexity of the topology of the landscapes they define?

How efficient are the natural exploration or optimization algorithms in these landscapes?

The toolbox of Random Matrix Theory will be used for both questions.

We will concentrate on two wide classes of interesting smooth random functions of many variables.

A first source of such functions is to be found in statistical mechanics of disordered systems, i.e. the Hamiltonians of disordered models, like spin-glasses. There the randomness is assumed to model quenched disorder in the medium.

Another rich class of such functions comes from Data Science and studies the random landscapes of inference problems in high-dimensional statistical estimation. Here the randomness of these landscapes is the randomness inherent in sampling.

To register for this course, go to: https://www.msri.org/seminars/26228

This class aims at understanding some important classes of smooth random functions of very many variables.

What can be said about the complexity of the topology of the landscapes they define?

How efficient are the natural exploration or optimization algorithms in these landscapes?

The toolbox of Random Matrix Theory will be used for both questions.

We will concentrate on two wide classes of interesting smooth random functions of many variables.

A first source of such functions is to be found in statistical mechanics of disordered systems, i.e. the Hamiltonians of disordered models, like spin-glasses. There the randomness is assumed to model quenched disorder in the medium.

Another rich class of such functions comes from Data Science and studies the random landscapes of inference problems in high-dimensional statistical estimation. Here the randomness of these landscapes is the randomness inherent in sampling.

To register for this course, go to: https://www.msri.org/seminars/26228

This class aims at understanding some important classes of smooth random functions of very many variables.

What can be said about the complexity of the topology of the landscapes they define?

How efficient are the natural exploration or optimization algorithms in these landscapes?

The toolbox of Random Matrix Theory will be used for both questions.

We will concentrate on two wide classes of interesting smooth random functions of many variables.

A first source of such functions is to be found in statistical mechanics of disordered systems, i.e. the Hamiltonians of disordered models, like spin-glasses. There the randomness is assumed to model quenched disorder in the medium.

Another rich class of such functions comes from Data Science and studies the random landscapes of inference problems in high-dimensional statistical estimation. Here the randomness of these landscapes is the randomness inherent in sampling.

To register for this course, go to: https://www.msri.org/seminars/26228

This class aims at understanding some important classes of smooth random functions of very many variables.

What can be said about the complexity of the topology of the landscapes they define?

How efficient are the natural exploration or optimization algorithms in these landscapes?

The toolbox of Random Matrix Theory will be used for both questions.

We will concentrate on two wide classes of interesting smooth random functions of many variables.

A first source of such functions is to be found in statistical mechanics of disordered systems, i.e. the Hamiltonians of disordered models, like spin-glasses. There the randomness is assumed to model quenched disorder in the medium.

Another rich class of such functions comes from Data Science and studies the random landscapes of inference problems in high-dimensional statistical estimation. Here the randomness of these landscapes is the randomness inherent in sampling.