Figure A1:

Recall violin plots for retrieving the most changing nodes between two graphs. We intervene by permuting the community probabilities of a single community to simulate changing connections but not degree, and then updating the second adjacency matrix accordingly. We generate 2000 pairs of graphs by randomly applying this intervention and adding Gaussian noise. The goal is to retrieve the nodes of the intervened community as the top most changing. The number of nodes increases along the columns, while the number of communities increases along the rows. For a random subset of 100(5%) sampled graph pairs we connect the corresponding method recall estimates. The solid and dotted lines in the violins correspond to the median and mean, respectively.