Graph Limits

The workshop will address both the basic theory and the applications of graph limits, focussing on graphons and graphexes, as well as various applications.


In the last few years several beautiful and exciting developments have taken place in this area. It is therefore time to bring together researchers from different fields, including probability theory, combinatorics, statistics and algorithmics.



Christian Borgs Microsoft Research
Jennifer Chayes Microsoft Research
Souvik Dhara MIT Mathematics and Microsoft Research
Remco van der Hofstad NETWORKS (TU Eindhoven)
Frank den Hollander NETWORKS (Leiden University)
Viresh Patel NETWORKS (University of Amsterdam



Siva Athreya Indian Statistical Institute, Bangalore
Morgane Austern Microsoft Research
Agnes Backhausz Eötvös Loránd University
Sourav Chatterjee Stanford University
Péter Csikvári Eötvös Loránd University
Jan Hladky Czech Academy of Sciences
Dan Kral Masaryk University
László Lovász Eötvös Loránd University
László Miklós Lovász Massachusetts Institute of Technology
Asaf Nachmias Tel Aviv University
Samantha Petti Georgia Tech
Sofia Olhede University College London
Kavita Ramanan Brown University
Adrian Roellin National University of Singapore
Subhabrata Sen Harvard University
Joel Spencer New York University
Katalin Vesztergombi Eötvös Loránd University
Christina Lee Yu Cornell University


More information and registration form: Graph Limits


When: April 6-7-8-9, 2020

Where: Eurandom






Eindhoven University of Technology

MetaForum Building, 4th floor

De Groene Loper 5

55612 AZ Eindhoven