Figure 9
From: Bayesian inference of transition matrices from incomplete graph data with a topological prior
Number of detected clusters by each method for a given number of sampled edges. The left panel shows results on Erdős Rényi graphs, the middle panel shows results on geometric Euclidean random graphs, and the right panel shows results on geometric hyperbolic random graphs. We show the number of communities detected by each method against the horizontal band indicating the interval between 2.5-th and the 97.5-th percentiles of the ground truth number of communities (shaded gray area). Error bars represent the 95% confidence interval. The positive impact of constraints on network inference translates to the clustering task