IMPA

The title of the talk corresponds to a family of interesting random processes, which includes lazy random walks on graphs and much beyond them. Often, a key step in analysing such processes is to estimate their spectral gaps (ie. the difference between two largest eigenvalues). It is thus of interest to understand what else about the chain we can know from the spectral gap. We will present a simple comparison idea that often gives us the best possible estimates. In particular, we re-obtain and improve upon several known results on hitting, meeting, and intersection times; return probabilities; and concentration inequalities for time averages. We then specialize to the graph setting, and obtain sharp inequalities in that setting. This talk is based on work that has been in progress for far too long with Yuval Peres.

A covering system of the integers is a finite collection of arithmetic progressions whose union is the set of integers $\mathbb{Z}$. The study of these objects was initiated in 1950 by Erdős, and over the following decades he asked a number of beautiful questions about them. Most famously, his so-called 'minimum modulus problem' was resolved in 2015 by Hough, who proved that in every covering system with distinct moduli, the minimum modulus is at most $10^{16}$.

In this talk I will describe a simple and general method of attacking covering problems that was inspired by Hough's proof. We expect that this technique, which we call the 'distortion method', will have further applications in combinatorics.

This talk is based on joint work with Paul Balister, Béla Bollobás, Julian Sahasrabudhe and Marius Tiba.

Since the work of Feigenbaum and Coullet-Tresser on universality in the period doubling bifurcation, it is been understood that crucial features of unimodal (one-dimensional) dynamics depend on the behavior of a renormalization (and infinite dimensional) dynamical system. While the initial analysis of renormalization was mostly focused on the proof of existence of hyperbolic fixed points, Sullivan was the first to address more global aspects, starting a program to prove that the renormalization operator has a uniformly hyperbolic (hence chaotic) attractor. Key to this program is the proof of exponential convergence of renormalization along suitable ``deformation classes'' of the complexified dynamical system. Subsequent works of McMullen and Lyubich have addressed many important cases, mostly by showing that some fine geometric characteristics of the complex dynamics imply exponential convergence.

We will describe recent work (joint with Lyubich) which moves the focus to the abstract analysis of holomorphic iteration in deformation spaces. It shows that exponential convergence does follow from rougher aspects of the complex dynamics (corresponding to precompactness features of the renormalization dynamics), which enables us to conclude exponential convergence in all cases.