Probability density estimation for sets of large graphs with respect to spectral information using stochastic block models

Code

• github.com/zhaokg/rbeast
  none★ 353

Abstract

For graph-valued data sampled iid from a distribution , the sample moments are computed with respect to a choice of metric. In this work, we equip the set of graphs with the pseudo-metric defined by the _2 norm between the eigenvalues of the respective adjacency matrices. We use this pseudo metric and the respective sample moments of a graph valued data set to infer the parameters of a distribution and interpret this distribution as an approximation of . We verify experimentally that complex distributions can be approximated well taking this approach.

Tasks

Reproductions