Laplacian Matrices of Graphs: Algorithms and Applications

author: Daniel A. Spielman, Department of Computer Science, Yale University
published: Aug. 20, 2015,   recorded: July 2015,   views: 355
Categories

Slides

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Bibliography

Description

The Laplacian matrices of graphs arise in many fields including Machine Learning, Computer Vision, Optimization, Computational Science, and of course Network Analysis. We will explain what these matrices are and why they arise in so many applications. We then will survey recent progress on the design of algorithms that allow us to solve such systems of linear equations in nearly linear time. In particular, we will show how fast algorithms for graph sparsification directly lead to fast Laplacian system solvers. As an application, we will explain how Laplacian system solvers can be used to quickly solve linear programs arising from natural graph problems.

See Also:

Download slides icon Download slides: colt2015_spielman_laplacian_matrices_01.pdf (5.6┬áMB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: