Oxford Events, the new replacement for OxTalks, will launch on 16th March. The two-week OxTalks freeze period starts on Monday 2nd March. During this time, there will be no facility to publish or edit events. The existing OxTalks site will remain available to view during this period. Once Oxford Events launches, you will need a Halo login to submit events. Full details are available on the Staff Gateway.
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.
