Random walks and local cuts in graphs

72 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters (2008, methodology): “We will also extensively use Local Spectral Algorithm of Andersen, Chung, and Lang [13] to find node sets of low conductance, i.e., good communities, around a seed node.”
Continuous-Time Dynamic Network Embeddings (2018, background): “Our work is also related to uniform and nonuniform random walks on graphs [17, 40].”
Statistical properties of community structure in large social and information networks (2008, methodology): “Similar results were originally proven by Spielman and Teng [147, 148], who analyzed local random walks on a graph; see Chung [34, 36, 35] for an exposition of the relationship between these methods.”