On Gaussian-width gradient complexity and mean-field behavior of interacting particle systems and random graphs

On Gaussian-width gradient complexity and mean-field behavior of interacting particle systems and random graphs

Probability Seminar
Nov 1, 2017, 03:10 PM - 04:00 PM | 1011 Evans Hall | Happening As Scheduled
Ronen Eldan, Weizmann Institute of Science
The motivating question for this talk is: What does a sparse 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, In 2014, Chatterjee and Dembo introduced a framework for obtaining Large Deviation Principles (LDP) for nonlinear functions of Bernoulli random variables (this followed an earlier...