Lecture Notes on Expansion, Sparsest Cut, and Spectral Graph Theory
نویسنده
چکیده
Foreword These notes are a lightly edited revision of notes written for the course " Graph Partitioning and Expanders " offered at Stanford in Winter 2011 and Winter 2013. I wish to thank the students who attended this course for their enthusiasm and hard work. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author and do not necessarily reflect the views of the National Science Foundation. As far as I know, the opinions of National Science Foundation concerning expander graphs are completely different from mine.
منابع مشابه
Lecture Notes on the ARV Algorithm for Sparsest Cut
One of the landmarks in approximation algorithms is theO( √ logn)-approximation algorithm for theUniform Sparsest Cut problem by Arora, Rao and Vazirani from 2004. The algorithm is based on a semidefinite program that finds an embedding of the nodes respecting the triangle inequality. Their core argument shows that a randomhyperplane approachwill find two large sets ofΘ(n)many nodes each that h...
متن کاملLecture : Spectral Methods for Partitioning Graphs ( 2 of 2 )
Warning: these notes are still very rough. They provide more details on what we discussed in class, but there may still be some errors, incomplete/imprecise statements, etc. in them. Here, we will prove the easy direction and the hard direction of Cheeger's Inequality. Recall that what we want to show is that λ 2 2 ≤ φ(G) ≤ 2λ 2. For the easy direction, recall that what we want to prove is that...
متن کاملLecture Notes on Spectral Graph Methods
These are lecture notes that are based on the lectures from a class I taught on the topic of Spectral Graph Methods at UC Berkeley during the Spring 2015 semester. Spectral graph techniques are remarkably broad, they are widely-applicable and often very useful, and they also come with a rich underlying theory, some of which provides a very good guide to practice. Spectral graph theory is often ...
متن کاملLecture 19 : Sparsest Cut and L 1 Embeddings 25 March , 2008
We will be studying the Sparsest cut problem in this lecture. In this context we will see how metric methods help in the design of approximation algorithms. We proceed to define the problem and briefly give some motivation for studying the problem.
متن کاملAdvanced Approximation Algorithms ( CMU 18 - 854 B , Spring 2008 ) Lecture 27 : Algorithms for Sparsest Cut Apr 24 , 2008
In lecture 19, we saw an LP relaxation based algorithm to solve the sparsest cut problem with an approximation guarantee of O(logn). In this lecture, we will show that the integrality gap of the LP relaxation is O(logn) and hence this is the best approximation factor one can get via the LP relaxation. We will also start developing an SDP relaxation based algorithm which provides an O( √ log n) ...
متن کامل