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
In the talk I will present the class of random graphs based on exchangeable random measures. Such class allows to model networks which are either dense or sparse, that is where the number of edges scales subquadratically with the number of nodes. For some values of its parameters, it generates scale-free networks with power-law exponent between 1 and 2. I will present the general construction, a representation theorem for such construction due to Kallenberg, and discuss its sparsity, power-law and transitivity properties. Then I will introduce a specific model within this framework that allows to capture sparsity/heavy-tailed degree distributions as well as latent overlapping community structure, and a Markov chain Monte Carlo algorithm for posterior inference with this model. Experiments are done on two real-world networks, showing the usefulness of the approach for network analysis.
Based on joint work with Emily Fox, Adrien Todeschini, Xenia Miscouridou, Judith Rousseau, Francesca Panero.
