OxTalks will soon move to the new Halo platform and will become 'Oxford Events.' There will be a need for an OxTalks freeze. This was previously planned for Friday 14th November – a new date will be shared as soon as it is available (full details will be available on the Staff Gateway).
In the meantime, the OxTalks site will remain active and events will continue to be published.
If staff have any questions about the Oxford Events launch, please contact halo@digital.ox.ac.uk
Graph limit theory studies the convergence of sequences of graphs as the number of vertices grows, providing an effective framework for representing large networks. In this talk, I will give a brief introduction to graph limits and report on recent extensions to weighted graphs and multiplex networks (probability graphons and P-variables). As an application of this theory I will present a large deviation principle (LDP) for random weighted graphs that generalizes the LDP for Erdős-Rényi random graphs by Chatterjee and Varadhan (2011), based on joint work with Pierfrancesco Dionigi.
