Tomas Juškevičius, Vilnius University

Abstract

In this talk we shall address anticoncentration inequalities for sums of random vectors. In particular, we shall discuss how to asymptotically establish two conjectures: one by Lee Jones (1978) and another by Leader-Radcliffe (1994). Perhaps surprisingly, the main ingredient to establish the latter result is the strong perfect graph theorem by Chudnovsky, Robertson, Seymour and Thomas (2002). Most of the talk will be centered not so much on the proofs, but more on how two seemingly different branches of mathematics can be linked in a useful way (Probability and Structural Graph Theory).
The talk is based on joint work with V. Kurauskas (Vilnius University, Lithuania). 

See: https://sites.google.com/view/rutgersdmseminar