A probability score is propagated through a network structure starting from an initial starting node (sn). In lines 4–13, probability is split preferentially between unvisited network neighbors of the
A probability score is propagated through a network structure starting from an initial starting node (sn). In lines 4–13, probability is split preferentially between unvisited network neighbors of the
A network walker uses a probability diffusion algorithm described in Table 2 to decide which nodes to visit in a network. Starting from a given node, snext, the network walker’s steps are recorded in
