This talk will give an introduction to the theory of dense graph limits, as initiated by Lovsz and Szegedy. We say that a sequence of dense graphs Gn converges if for every fixed graph F, the density of copies of F in Gn converges. In this case there is a natural limiting object, namely a symmetric measurable function W : [0, 1]2 → [0, 1], which determines all...