In order to approximate the outer expectation, we use Markov Chain Monte Carlo sampling over untagged graphs as described by (Sumalvico, 2017).
the sampling algorithm will need some modifications, as contrary to the original approach, the edge probabilities are not independent of the graph structure.