“…Consequently, similarity indices may be local (like the Adamic-Adar index, common neighbors index, hub promoted index, hub suppressed index, Jaccard index, Leicht-Holme-Newman index, preferential attachment index, resource allocation index, Salton index, or the Sørensen index) mesoscopic (like the local path index or the local random walk index), or global (like the average commute time index, cosine-based index, Katz index, Leicht-Holme-Newman index, matrix forest index, random walk with restart index, or the SimRank index). Edge neighborhood may be compared by using the network degree, preferential attachment methods, fitness values, community structure, network hierarchy, a stochastic bloc model, a probabilistic model, or by using hypergraphs (Albert & Albert, 2004; Liben-Novell & Kleinberg 2007; Yan et al, 2007a; Guimerà & Sales-Pardo, 2009; Lü et al, 2009; Zhou et al, 2009; Chen et al, 2012a; Eronen & Toivonen, 2012; Hu et al, 2012; Musmeci et al, 2012; Yan & Gregory, 2012; Liu et al, 2013). It is important to note that methods may perform differently, if the missing edge is in a dense network core or in a sparsely connected network periphery (Zhu et al, 2012a).…”