Figure 3
From: On the complexity of quantum link prediction in complex networks
Probability of sampling a correct link in QLP compared to \(A^2\) and \(A^3\). We compare the precision of QLP with \(A^2\) and \(A^3\) by comparing the probability of sampling a correct prediction given that the sample was useful for four example networks. The results indicate that a value \(t=O(1)\) can be chosen such that \(p_{C|G}^\text {even}(t)\ge p_{C|G}^\text {A2}\) and \(p_{C|G}^\text {odd}(t)\ge p_{C|G}^\text {A3}\) while maintaining a small useful sample overhead given by \(1/p_\text {G}\). The plots for \(p_{C|G}^\text {even}(t)\) and \(p_{C|G}^\text {odd}(t)\) start at \(t\approx 0.1\) to avoid the region of small \(p_\text {G}\) where the divisions in Eq. 42 are numerically unstable. Further results for more networks are provided in Fig. 3 of the Supplementary Material.
