Figure 6
From: Bayesian inference of transition matrices from incomplete graph data with a topological prior
Effects of constraints on the downstream task of node ranking. 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 measure performance with the Kendall τ correlation between the ranking obtained from the ground truth and the inferred transition matrices. Error bars represent the 95% confidence interval. The positive impact of constraints on network inference translates to the node ranking task