Fetching the paper…
Reading the bibliography…
Local graph clustering and the closely related seed set expansion problem are primitives on graphs that are central to a wide range of analytic and learning tasks such as local clustering, community detection, nodes ranking and feature inference.
The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume
L. Lovász and M. Simonovits · 1990
Earlier work this paper cites.
Random walks in a convex body and an improved volume algorithm
László Lovász and Miklós Simonovits · 1993
Earlier work this paper cites.
On the quality of spectral separators
S. Guattery and G.L. Miller · 1998
Earlier work this paper cites.
The pagerank citation ranking: Bringing order to the web
Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd · 1999
Earlier work this paper cites.
On spectral clustering: Analysis and an algorithm
A.Y. Ng, M.I. Jordan, and Y. Weiss · 2001
Earlier work this paper cites.
Eigenvalues of the discrete p-laplacian for graphs
S. Amghibech · 2003
Earlier work this paper cites.
A spectral clustering approach to finding communities in graphs
S. White and P. Smyth · 2005
Earlier work this paper cites.
Local graph partitioning using pagerank vectors
R. Andersen, F. Chung, and K. Lang · 2006
Earlier work this paper cites.
A gold standard set of mechanistically diverse enzyme superfamilies
Shoshana D Brown, John A Gerlt, Jennifer L Seffernick, and Patricia C Babbitt · 2006
Earlier work this paper cites.
A tutorial on spectral clustering
U. von Luxburg · 2006
Earlier work this paper cites.
The heat kernel as the PageRank of a graph
F. Chung · 2007
Earlier work this paper cites.
Random walks and local cuts in graphs
Fan Chung · 2007
Earlier work this paper cites.
An algorithm for improving graph partitions
R. Andersen and K. J. Lang · 2008
Earlier work this paper cites.
Benchmark graphs for testing community detection algorithms
Andrea Lancichinetti, Santo Fortunato, and Filippo Radicchi · 2008
Earlier work this paper cites.
Finding sparse cuts locally using evolving sets
Reid Andersen and Yuval Peres · 2009
Cited alongside, same era.
Spectral clustering based on the graph p-laplacian
T. Bühler and M. Hein · 2009
Cited alongside, same era.
A local graph partitioning algorithm using heat kernel pagerank
F. R. K. Chung · 2009
Cited alongside, same era.
Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters
J. Leskovec, K.J. Lang, A. Dasgupta, and M.W. Mahoney · 2009
Cited alongside, same era.
A local spectral method for graphs: with applications to improving graph partitions and exploring data graphs locally
M. W. Mahoney, L. Orecchia, and N. K. Vishnoi · 2012
Cited alongside, same era.
Social structure of facebook networks
A. L. Traud, P. J. Mucha, and M. A. Porter · 2012
PageRank beyond the web
D. F. Gleich · 2015
Later among the works it cites.
Think locally, act locally: Detection of small, medium-sized, and large communities in large networks
L. G. S. Jeub, P. Balachandran, M. A. Porter, P. J. Mucha, and M. W. Mahoney · 2015
Later among the works it cites.
Almost optimal local graph clustering using evolving sets
R. Andersen, S. O. Gharan, Y. Peres, and L. Trevisan · 2016
Later among the works it cites.
Community detection in networks: A user guide
S. Fortunato and D. Hric · 2016
Later among the works it cites.
Network modeling identifies patient-specific pathways in glioblastoma
N. Tuncbag, P. Milani, J. L. Pokorny, H. Johnson, T. T. Sio, S. Dalin, D. O. Iyekegbe, F. M. White, J. N. Sarkaria, and E. Fraenkel · 2016
Later among the works it cites.
An optimization approach to locally-biased graph algorithms
K. Fountoulakis, D. F. Gleich, and M. W. Mahoney · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Diffusion and clustering on large graphs
A. Tsiatas · 2012
Cited alongside, same era.
A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning
D. A. Spielman and S. H. Teng · 2013
Cited alongside, same era.
A local algorithm for finding well-connected clusters
Zeyuan Allen Zhu, Silvio Lattanzi, and Vahab S. Mirrokni · 2013
Cited alongside, same era.
CVX: Matlab software for disciplined convex programming, version 2.1
Michael Grant and Stephen Boyd · 2014
Cited alongside, same era.
Heat kernel based community detection
K. Kloster and D. F. Gleich · 2014
Cited alongside, same era.
Community membership identification from small seed sets
I. M. Kloumann and J. M. Kleinberg · 2014
Cited alongside, same era.
Later among the works it cites.
Variational perspective on local graph clustering
K. Fountoulakis, F. Roosta-Khorasani, J. Shun, X. Cheng, and M. W. Mahoney · 2017
Later among the works it cites.
Local Lanczos spectral approximation for community detection
P. Shi, K. He, D. Bindel, and J. Hopcroft · 2017
Later among the works it cites.
Capacity releasing diffusion for speed and locality
D. Wang, K. Fountoulakis, M. Henzinger, M. W. Mahoney, and S. Rao · 2017
Later among the works it cites.
Random permutations fix a worst case for cyclic coordinate descent
C. Lee and S. J. Wright · 2018
Later among the works it cites.
Submodular hypergraphs: p-laplacians, Cheeger inequalities and spectral clustering
P. Li and O. Milenkovic · 2018
Later among the works it cites.
Nonlinear diffusion for community detection and semi-supervised learning
R. Ibrahim and D. Gleich · 2019
Later among the works it cites.
Flow-based algorithms for improving clusters: A unifying framework, software, and performance
K. Fountoulakis, M. Liu, D. F. Gleich, and M. W. Mahoney · 2020
Closest in time.
Targeted pandemic containment through identifying local contact network bottlenecks
S. Yang, P. Senapati, D. Wang, C. T. Bauch, and K. Fountoulakis · 2020
Closest in time.