φ(A)) when the target set A has conductance φ(A) ∈ [0, 1]. In this paper, we improve it to

Motivated by applications of large-scale graph clustering, we study random-walk-based local algorithms whose running times depend only on the size of the output cluster, rather than the entire graph. All previously known such algorithms guarantee an output conductance o