The likelihood of a graph can be computed by integrating over all the graph parameters (with appropriate priors). Doing this by sampling from priors is very inefficient, so we use samples from the posteriors to importance sample the likelihood.
Samples of log likelihoods from the posterior distribution of the graph.
The likelihood of a graph where graph parameters are integrated out.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.