Logo

Mathematical Sciences Research Institute

Home » GFA Main Seminar: Gaussian-width complexity of functions on the discrete cube and mean-field behavior of random graphs and interacting particle systems

Seminar

GFA Main Seminar: Gaussian-width complexity of functions on the discrete cube and mean-field behavior of random graphs and interacting particle systems October 31, 2017 (03:30 PM PDT - 04:30 PM PDT)
Parent Program:
Location: MSRI: Simons Auditorium
Speaker(s) Ronen Eldan (Weizmann Institute of Science)
Description No Description
Video
No Video Uploaded
Abstract/Media


We will use familiar notions from geometric functional analysis (e.g., concentration inequalities and the good ol' Gaussian width) to prove a structure theorem for measures on the discrete hypercube which allows us to understand phenomena related to random graphs, interacting particle systems and random subsets of integers.

One motivating question for this talk is: What does an Erd\"os-R\'enyi random graph, conditioned to have twice the number of triangles than the expected number, typically look like? Motivated by this question, Chatterjee and Dembo ['14] introduced a framework for obtaining Large Deviation Principles (LDP) for nonlinear functions of Bernoulli random variables (this followed an earlier work of Chatterjee-Varadhan which used limit graph theory to answer this question in the dense regime). The aforementioned framework relies on a notion of "low complexity" functions on the discrete cube, defined in terms of the covering numbers of their gradient. The central lemma used in their proof provides a method of estimating the log-normalizing constant $\log \sum_{x \in \{-1,1\}^n} e^{f(x)}$ by a corresponding mean-fieldfunctional.

In this talk, we will introduce a new notion of complexity for measures on the discrete cube, namely the mean-width of the gradient of the log-density. We prove a general structure theorem for such measures which goes beyond the discrete cube. In particular, we show that a measure $\nu$ attaining low complexity (with no extra smoothness assumptions needed) are close to a product measure in the following sense: there exists a measure $\tilde \nu$ a small "tilt" of $\nu$ in the sense that their log-densities differ by a linear function with small slope, such that $\tilde \nu$ is close to a product measure in transportation distance. An easy corollary of our result is a strengthening of the framework of Chatterjee-Dembo, which in particular simplifies the derivation of LDPs for subgraph counts, and improves the attained bounds. 

We will demonstrate how our framework can be used to study the behavior of low-complexity measures beyond the approximation of the partition function. As an example application, we prove that exponential random graphs behave roughly like mixtures of stochastic block models.

No Notes/Supplements Uploaded No Video Files Uploaded