ProPPR allows a fast approximate proof procedure, in which only a small subset of the full proof graph is generated.
if α upper-bounds the reset probability, and d upperbounds the degree of nodes in the graph, then one can efficiently find a subgraph with O( 1 α ) nodes which approximates the weight for every node within an error of d (Wang et al., 2013), using a variant of the PageRank-Nibble algorithm of Andersen et al (2008).