Department of

September 2017 October 2017 November 2017 Su Mo Tu We Th Fr Sa Su Mo Tu We Th Fr Sa Su Mo Tu We Th Fr Sa 1 2 1 2 3 4 5 6 7 1 2 3 4 3 4 5 6 7 8 9 8 9 10 11 12 13 14 5 6 7 8 9 10 11 10 11 12 13 14 15 16 15 16 17 18 19 20 21 12 13 14 15 16 17 18 17 18 19 20 21 22 23 22 23 24 25 26 27 28 19 20 21 22 23 24 25 24 25 26 27 28 29 30 29 30 31 26 27 28 29 30

Friday, October 6, 2017

**Abstract:** I will be exploring some interesting connections between graph theory and analysis through versions of Szemerédi's regularity lemma. Szemerédi's lemma states that every large enough graph can be divided into near equipartitions such that edges between the partitions behave almost randomly. In the style of a 2007 paper by Lovász and Szegedy, I generalize this problem to the setting of stepfunctions on a Hilbert space then dive into the world of graphons, analytic objects which act as the limit to a sequence of dense graphs. No particular background needed in graph theory or analysis.