metric embeddings, graph expansion, and high-dimensional convex geometry James R. Lee Institute for Advanced Study graph expansion and the sparsest cut Given a graph G=(V,E),…