Assertion: algorithm | /r/CapableOf | round with high probability
Facets:
value: on any graph
type: LOCATION
Source sentences:
text: One algorithm takes O ( log ⁡ n / ϵ ) {\displaystyle O(\log n/\epsilon )} rounds with high probability on any graph (directed or undirected), where n is the network size and ϵ {\displaystyle \epsilon } is the reset probability ( 1 − ϵ {\displaystyle 1-\epsilon } , which is called the damping factor) used in the PageRank computation.