# UWashington Mathematics Colloquium: Ronen Eldan

## Topic

Localization Schemes: A Framework for proving mixing bounds in Markov chains

## Details

A useful way of producing samples from a given measure ν on a state space Ω is by providing a Markov chain whose stationary measure in ν. In order to be able to sample efficiently, one needs to show that the chain "mixes" quickly in terms of the rate of convergence of the measure induced by running k steps of the chain to the stationary measure. In this talk we will present a framework which combines ideas from two seemingly-unrelated recent techniques for proving such mixing bounds: (i) the framework of "Spectral Independence", introduced by Anari, Liu and Oveis Gharan, based on high-dimensional expanders, which have given rise to several breakthroughs in the analysis of mixing times of discrete Markov chains and (ii) the Stochastic Localization technique which has proven useful in establishing mixing and expansion bounds for both log-concave measures and for measures on the discrete hypercube. Our framework aims to both unify and extend those techniques, thus providing an approach that gives bounds for sampling algorithms in both discrete and continuous settings. In its center is the concept of a "localization process" which is a martingale taking values in the space of probability measures on Ω. As it turns out, many Markov chains of interest (such as Glauber dynamics) appear naturally in this framework, and this viewpoint provides tools for deriving mixing bounds for the dynamics through the analysis of a corresponding localization process. Generalizations of the concept of Spectral Independence naturally arise from our definitions, and in particular we will show how to recover the main theorems in the spectral independence framework via simple martingale arguments (completely bypassing the need to use the theory of high-dimensional expanders). We demonstrate how to apply our machinery towards simple proofs to many mixing bounds in the recent literature. We will briefly discuss some applications, among which are obtaining the first O(n log n) bound for mixing time of the hardcore-model (of arbitrary degree) in the tree-uniqueness regime. Based on a joint work with Yuansi Chen.

## Additional Information

**Time**: 3:30pm Pacific

**Room**: ECE 125

Ronen Eldan, Microsoft Research

This is a Past Event

Event Type

**Scientific, Distinguished Lecture**

Date

**February 18, 2023**

Time

**-**

Location

University of Washington