- Series
- High-Dimensional Phenomena in Statistics and Machine Learning Seminar
- Time
- Tuesday, November 15, 2011 - 4:00pm for 1.5 hours (actually 80 minutes)
- Location
- skyles 006
- Speaker
- Yingyu Liang – School of Compter Science, Georgia tech
- Organizer
- Karim Lounici
We will talk about how to approximate an arbitrary graph by a sparse graph
with respect to cuts and flows, using random sampling techniques.
More specifically, we will describe a near-linear-time randomized
combinatorial
construction that transforms any graph on n vertices into an O(n log n)-edge
graph on the same vertices whose cuts have approximately the same value
as the original graph's. The new graph can be used to accelerate cut and
flow algorithms, leading to approximate solution on the original graph.
The construction algorithms of the sparse graph are based on a general
theorem analyzing the concentration of cut values near their expectation
in random graphs.