Skip to content
Bayesian inference for the exponential random graph model (Nial Friel) episode artwork

May 16, 2013 1 hr 1 min

Bayesian inference for the exponential random graph model (Nial Friel)

from StatLearn 2013 - Workshop on "Challenging problems in Statistical Learning" Hosted by UP1 Service TICE

The exponential random graph is arguably the most popular model for the statistical analysis of network data. However despite its widespread use, it is very complicated to handle from a statistical perspective, mainly because the likelihood function is intractable for all but trivially small networks. This talk will outline some recent work in this area to overcome this intractability. In particular, we will outline some approaches to carry out Bayesian parameter estimation and show how this can be extended to estimate Bayes factors between competing models.

Episode details come from the podcast's RSS feed.

Embed this episode

Ready to play

Bayesian inference for the exponential random graph model (Nial Friel)

0:00 1:01:05

No transcript yet.

Requests help us decide what to transcribe next.

Frequently asked questions

How long is this episode of StatLearn 2013 - Workshop on "Challenging problems in Statistical Learning"?

This episode is 1 hour and 1 minute long.

When was this StatLearn 2013 - Workshop on "Challenging problems in Statistical Learning" episode published?

This episode was published on May 16, 2013.

Can I download this StatLearn 2013 - Workshop on "Challenging problems in Statistical Learning" episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.