Regularized Laplacian Estimation and Fast Eigenvector Approximation

Two characterizations of the Dirichlet distribution

J. Fabius · 1973

Earlier work this paper cites.

Lower bounds for the partitioning of graphs

W.E. Donath and A.J. Hoffman · 1973

Earlier work this paper cites.

A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory

M. Fiedler · 1975

Earlier work this paper cites.

Random Graphs

B. Bollobas · 1985

Earlier work this paper cites.

Conductance and convergence of Markov chains—a combinatorial treatment of expanders

M. Mihail · 1989

Earlier work this paper cites.

The electrical resistance of a graph captures its commute and cover times

A. K. Chandra, P. Raghavan, W. L. Ruzzo, R. Smolensky, and P. Tiwari · 1989

Earlier work this paper cites.

Spectral partitioning works: Planar graphs and finite element meshes

D.A. Spielman and S.-H. Teng · 1996

Earlier work this paper cites.

On the quality of spectral separators

S. Guattery and G.L. Miller · 1998

Cited alongside, same era.

Collective dynamics of small-world networks

D.J. Watts and S.H. Strogatz · 1998

Cited alongside, same era.

On proximity measures for graph vertices

P. Yu. Chebotarev and E. V. Shamis · 1998

Cited alongside, same era.

Normalized cuts and image segmentation

J. Shi and J. Malik · 2000

Cited alongside, same era.

Laplacian eigenmaps for dimensionality reduction and data representation

M. Belkin and P. Niyogi · 2003

Cited alongside, same era.

Transductive learning via spectral graph partitioning

T. Joachims · 2003

Cited alongside, same era.

Local graph partitioning using PageRank vectors

R. Andersen, F.R.K. Chung, and K. Lang · 2006

Later among the works it cites.

Expander graphs and their applications

S. Hoory, N. Linial, and A. Wigderson · 2006

Later among the works it cites.

The heat kernel as the pagerank of a graph

F.R.K. Chung · 2007

Later among the works it cites.

Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters

Original

J. Leskovec, K.J. Lang, A. Dasgupta, and M.W. Mahoney · 2009

Later among the works it cites.

A spectral algorithm for improving graph partitions with applications to exploring data graphs locally

Original

M. W. Mahoney, L. Orecchia, and N. K. Vishnoi · 2009

Later among the works it cites.