Mahya Ghandehari: Mini-course: Limits of discrete structures

Speaker
Mahya Ghandehari, University of Delaware

Abstract
The interactions between Combinatorics and Quantum Information Theory have been particularly intensive in the past decade. A prime instance is nonlocal games arising from discrete structures such as graphs and hypergraphs in which homomorphism densities play a characterizing role. At the same time, limit theories for graphs/hypergraphs have recently become a major tool in studying various types of large networks. Such theories allow us to view very large structures in combinatorics as probabilistic samples of continuous random processes. In this minicourse, I will lay the foundations of a successful instance of such limit theories, namely limits of sequences of dense graphs pioneered by Lovasz and collaborators in the 2000’s.