On 28th November OxTalks will move to the new Halo platform and will become 'Oxford Events' (full details are available on the Staff Gateway).
There will be an OxTalks freeze beginning on Friday 14th November. This means you will need to publish any of your known events to OxTalks by then as there will be no facility to publish or edit events in that fortnight. During the freeze, all events will be migrated to the new Oxford Events site. It will still be possible to view events on OxTalks during this time.
If you have any questions, 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.
