Link Prediction in Complex Network via Penalizing Noncontribution Relations of Endpoints

Figure 1

Illustration of noncontribution relations and valid influence diffusion. With the same valid influence degree of 1 and smaller connectivity chance of than 1 in subgraph (a), link likelihood in (b) is less than (a) because of two noncontribution relations attached on and ; meanwhile, subgraph (c) with the highest valid influence degree of 3 and the same connectivity chance in (a) obtains the greatest link likelihood. Totally, we rank (c) > (a) > (b) according to reasonable link likelihood.

(a)

(b)

(c)