Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs

DOI10.1007/978-3-319-13075-0_49zbMath1435.05186OpenAlexW1561091279MaRDI QIDQ2942665

Pavel Kolev, He Sun

Publication date: 11 September 2015

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13075-0_49

zbMATH Keywords

polynomial-time algorithmclusters in massive graphs

Mathematics Subject Classification ID

Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Unnamed Item
• Tight bounds for the cover time of multiple random walks
• The cover time of deterministic random walks
• Random walks and local cuts in graphs
• Discrete Green's functions
• Approximating the Permanent
• Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
• Using PageRank to Locally Partition a Graph
• Random walks in a convex body and an improved volume algorithm
• Finding sparse cuts locally using evolving sets
• Coalescing Random Walks and Voting on Connected Graphs