-
Upload Video
videos in mp4/mov/flv
close
Upload video
Note: publisher must agree to add uploaded document -
Upload Slides
slides or other attachment
close
Upload Slides
Note: publisher must agree to add uploaded document -
Feedback
help us improve
close
Feedback
Please help us improve your experience by sending us a comment, question or concern
Please help transcribe this video using our simple transcription tool. You need to be logged in to do so.
Description
I will explain some of the most interesting applications of solving linear equations
in Laplacian matrices as well as some of the most interesting ideas that have been
used in algorithms that solve these equations. The main applications will come from
machine learning and optimization. The algorithmic ideas I discuss will
include local clustering, sparsification, low-stretch spanning trees, and an under-appreciated
technique of Lovasz and Simonovits for bounding the convergence rate of Markov chains.