Fall 2022

Graph Limits, Non-Parametric Models and Estimation

Sep 26, 2022 to Sep 30, 2022 

Add to Calendar


Christian Borgs (UC Berkeley), Souvik Dhara (Massachusetts Institute of Technology), László Lovász (Eötvös Loránd University), Sofia Olhede (University College London), Remco van der Hofstad (Eindhoven University of Technology)

This workshop is organized in collaboration with EURANDOM, the Netherlands.


Graph limits and graphons emerged as a subfield of graph theory about 15 years ago, and immediately spurred wide interest due to the connections with statistical physics, extremal combinatorics, and non-parametric statistical analysis on networks. While inspired by applications to real-world networks such as the World-Wide Web, the original theory did not apply to many of these networks, since the theory dealt with dense graphs while real-world networks tend to be sparser. Several ideas for sparse graph limits, and the extent of their applicability, have since been proposed and studied. This workshop aims to bring together researchers from around the world, working on both theoretical and applied aspects of graph limit theory, coming from fields as diverse as probability theory, statistics, combinatorics, and computer science. The topics will cover extensions of graphon theory, as well as fundamentally different concepts such as local-weak convergence. The applications will include large deviations of random graphs, non-parametric graphon estimation, and differential privacy.

Registration is required to attend this workshop. Space may be limited, and you are advised to register early. The link to the registration form will appear on this page approximately 10 weeks before the boot camp. To submit your name for consideration, please register and await confirmation of your acceptance before booking your travel.

Further details about this workshop will be posted in due course. I

If you are interested in joining this workshop, please see the Participate page.