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.
More info: Random Graphs and Complex Networks – Eurandom (tue.nl)