where \(f(w)\) equals 1 if \(w\) belongs to the same community as \(u\)
and \(v\) or 0 otherwise and \(\Gamma(u)\) denotes the set of
neighbors of \(u\).
A NetworkX undirected graph.
ebunchiterable of node pairs, optional (default = None)
The score will be computed for each pair of nodes given in the
iterable. The pairs must be given as 2-tuples (u, v) where u
and v are nodes in the graph. If ebunch is None then all
non-existent edges in the graph will be used.
Default value: None.
communitystring, optional (default = ‘community’)
Nodes attribute name containing the community information.
G[u][community] identifies which community u belongs to. Each
node belongs to at most one community. Default value: ‘community’.
An iterator of 3-tuples in the form (u, v, p) where (u, v) is a
pair of nodes and p is their score.
Sucheta Soundarajan and John Hopcroft.
Using community information to improve the precision of link
In Proceedings of the 21st international conference companion on
World Wide Web (WWW ‘12 Companion). ACM, New York, NY, USA, 607-608.