- This event has passed.
Random Graphs and Complex Networks
Sep 2, 09:30 - Sep 4, 16:00
The field of mathematical foundations of complex networks has been flourishing in the past two decades. Complex networks are often modelled using random graphs, while stochastic processes on, and algorithms for, them are key to modelling network functionality. Real-world complex networks are generally sparse, and highly inhomogeneous. Local convergence has proved to be a key methodology to study such networks, with many properties being dictated by the local limit.
This workshop focusses on recent results on the structure of random graphs, and touches upon processes on, and algorithms for, them. It also celebrates the recent publication of a book on the topic. The speakers have been selected for their influential role in the field.
Organiser: Remco van der Hofstad
Confirmed speakers:
Christian Borgs | UC Berkeley |
Mia Deijfen | Stockholm University |
Steffen Dereich | University of Münster |
Cristian Giardinà | University of Modena and Reggio Emilia |
Rajat Hazra | University of Leiden |
Frank den Hollander | University of Leiden |
Svante Janson | Uppsala University |
Lasse Leskelä | Aalto University |
Nelly Litvak | Eindhoven University of Technology |
Michel Mandjes | University of Amsterdam |
Piet Van Mieghem | Delft University of Technology |
Christian Mönch | Johannes Gutenberg University Mainz |
Peter Mörters | University of Cologne |
Clara Stegehuis | University of Twente |
Program | |
OA200812 Abstracts | |
Registration for participants (non-speakers):
Important: hotel bookings will only be booked by Eurandom workshop support. You may receive phishing mails (Travel.org or other) who offer to assist you in making bookings. Please ignore this.
Registration for SPEAKERS: