Computing Expected Motif Counts for Exchangeable Graph Generative Models

Abstract

Estimating the expected value of a graph statistic is an important inference task for using and learning graph models. This note presents a scalable estimation procedure for expected motif counts, a widely used type of graph statistic. The procedure applies for generative mixture models of the type used in neural and Bayesian approaches to graph data.

Tasks

Reproductions