Skip to main content
Fig. 3 | Computational Social Networks

Fig. 3

From: Measuring the value of accurate link prediction for network seeding

Fig. 3

Increasing link-prediction error in a small-world network (\(\text {OAS}_{\text {tg}}\)). The experiment from Fig. 2 is replicated with the traditional greedy algorithm. \(\text {OAS}_{\text {tg}}\) is depicted as a function of false negative rate in a small-world network. Traditional greedy allocation of \(b\) seeds causes a complete cascade in \(G'\) (300 nodes). Budgets are (9, 43, 114, 202). Since budgets required by traditional greedy are higher than those required by modified greedy, the average performance of a random seed set in \(G\) (shown in red) is higher here than for each corresponding subplot in Fig. 2

Back to article page