Fetching the paper…
Reading the bibliography…
A basic fact in spectral graph theory is that the number of connected components in an undirected graph is equal to the multiplicity of the eigenvalue zero in the Laplacian matrix of the graph.
Étude des coefficients de Fourier des fonctions de L p ( G ) L^{p}(G)
Aline Bonami · 1970
Earlier work this paper cites.
Hypercontractive semigroups and two dimensional self-coupled Bose fields
Barry Simon and Raphael Høegh-Krohn · 1972
Earlier work this paper cites.
Inequalities in Fourier analysis
William Beckner · 1975
Earlier work this paper cites.
Graph coloring using eigenvalue decomposition
Bengt Aspvall and John R. Gilbert · 1983
Earlier work this paper cites.
Isoperimetric inequalities for graphs, and superconcentrators
N. Alon and V. Milman · 1985
Earlier work this paper cites.
Eigenvalues and expanders
N Alon · 1986
Earlier work this paper cites.
Approximative counting, uniform generation and rapidly mixing Markov chains
Alistair J. Sinclair and Mark R. Jerrum · 1989
Earlier work this paper cites.
Probability in Banach spaces
Michel Ledoux and Michel Talagrand · 1991
Earlier work this paper cites.
Excluded minors, network decomposition, and multicommodity flow
Philip N. Klein, Serge A. Plotkin, and Satish Rao · 1993
Earlier work this paper cites.
Laplacians of graphs and Cheeger’s inequalities
F. R. K. Chung · 1996
Earlier work this paper cites.
A spectral technique for coloring random 3-colorable graphs
Noga Alon and Nabil Kahale · 1997
Earlier work this paper cites.
Spectral graph theory
Fan R. K. Chung · 1997
Earlier work this paper cites.
The anatomy of a large-scale hypertextual web search engine
Sergey Brin and Lawrence Page · 1998
Earlier work this paper cites.
Approximating a finite metric by a small number of tree metrics
Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha, and Serge A. Plotkin · 1998
Earlier work this paper cites.
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k k -median
M. Charikar, C. Chekuri, A. Goel, and S. Guha · 1998
Earlier work this paper cites.
Authoritative sources in a hyperlinked environment
Jon M. Kleinberg · 1999
Cited alongside, same era.
Normalized cuts and image segmentation
Jianbo Shi and Jitendra Malik · 2000
Cited alongside, same era.
Lectures on discrete geometry
J. Matoušek · 2002
Cited alongside, same era.
On spectral clustering: Analysis and an algorithm
Andrew Ng, Michael Jordan, and Yair Weiss · 2002
Cited alongside, same era.
An improved decomposition theorem for graphs excluding a fixed minor
J. Fakcharoenphol and K. Talwar · 2003
Cited alongside, same era.
Bounded geometries, fractals, and low-distortion embeddings
Anupam Gupta, Robert Krauthgamer, and James R. Lee · 2003
Cited alongside, same era.
Graph expansion and the unique games conjecture
Prasad Raghavendra and David Steurer · 2010
Later among the works it cites.
Approximations for the isoperimetric and spectral profile of graphs and related parameters
Prasad Raghavendra, David Steurer, and Prasad Tetali · 2010
Later among the works it cites.
On the complexity of unique games and graph expansion
David Steurer · 2010
Later among the works it cites.
Metric uniformization and spectral bounds for graphs
J. Kelner, J. R. Lee, G. Price, and S.-H. Teng · 2011
Closest in time.
A nearly-m log n time solver for sdd linear systems
Ioannis Koutis, Gary L. Miller, and Richard Peng · 2011
Closest in time.
Algorithmic extensions of Cheeger’s inequality to higher eigenvalues and partitions
Anand Louis, Prasad Raghavendra, Prasad Tetali, and Santosh Vempala · 2011
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Deepak Verma and Marina Meila · 2003
Cited alongside, same era.
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
Daniel A. Spielman and Shang-Hua Teng · 2004
Cited alongside, same era.
Extending Lipschitz functions via random metric partitions
James R. Lee and Assaf Naor · 2005
Cited alongside, same era.
Graph partitioning by spectral rounding: Applications in image segmentation and clustering
David A. Tolliver and Gary L. Miller · 2006
Cited alongside, same era.
Eigenvalue bounds, spectral partitioning, and metrical deformations via flows
Punyashloka Biswal, James R. Lee, and Satish Rao · 2008
Cited alongside, same era.
On eigenfunctions of Markov processes on trees
Laurent Miclo · 2008
Cited alongside, same era.
Hypercontractivity, sum-of-squares proofs, and their applications
Boaz Barak, Fernando G. S. L. Brandão, Aram W. Harrow, Jonathan A. Kelner, David Steurer, and Yuan Zhou · 2012
Closest in time.
On nodal domains and higher-order Cheeger inequalities of finite reversible markov processes
Amir Daneshgar, Ramin Javadi, and Laurent Miclo · 2012
Closest in time.
Many sparse cuts via higher eigenvalues
Anand Louis, Prasad Raghavendra, Prasad Tetali, and Santosh Vempala · 2012
Closest in time.
Approximating the expansion profile and almost optimal local graph clustering
Shayan Oveis Gharan and Luca Trevisan · 2012
Closest in time.
Improved small-set expansion from higher eigenvalues
Ryan O’Donnell and David Witmer · 2012
Closest in time.
A simple, combinatorial algorithm for solving sdd systems in nearly-linear time
Jonathan A. Kelner, Lorenzo Orecchia, Aaron Sidford, and Zeyuan Allen Zhu · 2013
Closest in time.
On hyperboundedness and spectrum of Markov operators
Laurent Miclo · 2013
Closest in time.
L x = b Lx=b
Nisheeth K. Vishnoi · 2013
Closest in time.