skip to content

Bayesian ERGMs -- computational and modelling challenges

Presented by: 
Alberto Caimo
Thursday 28th July 2016 - 09:15 to 10:15
INI Seminar Room 2
Recent research in statistical social network analysis has demonstrated the advantages and effectiveness of Bayesian approaches to network data. In fact, Bayesian exponential random graph models (BERGMs) are becoming increasingly popular as techniques for modelling relational data in wide range of research areas. However, the applicability of these models in real-world settings is limited by computational complexity. In this seminar we review some of the most recent computational methods for estimating BERGMs as well as extended ERGM-based modelling frameworks for dynamic and heterogenous social networks.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons