PPR is a variant of the popular PageRank algorithm (Brin and Page, 1998) in which the damping probability mass is concentrated on a selected number of graph nodes, instead of being uniformly distributed across all nodes.
following  we concentrate the probability mass on the nodes (t , g ) ∈ V d for which the term t is a context word, i.e., t ∈ C d .