  A framework based on generalized hierarchical random graphs (GHRGs) for the
detection of change points in the structure of temporal networks has recently
been developed by Peel and Clauset [1]. We build on this methodology and extend
it to also include the versatile stochastic block models (SBMs) as a parametric
family for reconstructing the empirical networks. We use five different
techniques for change point detection on prototypical temporal networks,
including empirical and synthetic ones. We find that none of the considered
methods can consistently outperform the others when it comes to detecting and
locating the expected change points in empirical temporal networks. With
respect to the precision and the recall of the results of the change points, we
find that the method based on a degree-corrected SBM has better recall
properties than other dedicated methods, especially for sparse networks and
smaller sliding time window widths.
