Seminario Grafos:”Characterizing Randomness in Large Networks”.
Abstract: The theory of combinatorial limits was developed in the early 2000s as a framework for studying sequences of increasingly large combinatorial structures. In the case of graphs, this theory associates such sequences with analytic limit objects that capture many of their asymptotic properties. Since then, the theory has been extended to several other combinatorial settings, including permutations, hypergraphs, Latin squares, and directed graphs.
In this talk, we will introduce the theory of graph limits through graphons and explore the structure of the space they form. We will then discuss quasirandomness and its connection with graph limits, leading to the problem of quasirandom forcing: which conditions are sufficient to guarantee quasirandomness? Finally, we will briefly discuss extensions of quasirandom forcing to other combinatorial structures, together with some of their properties and applications.