fyi...

---------- Forwarded message ----------
From: Sarah LaBauve <slabauve@math.harvard.edu>
Date: Wed, Feb 28, 2018 at 2:36 PM
Subject: [wam_seminars] 3/20 Dan Spielman Public Talk
To: Sarah LaBauve <slabauve@math.harvard.edu>
Cc: "Maloney, Ryan" <rmaloney@math.harvard.edu>

Prof. Daniel A. Spielman of Yale University will be giving a public talk on “The Laplacian Matrices of Graphs: Algorithms and Applications” on Tuesday, March 20@5:00pm in Askwith Hall. This This talk is part of the Program on Combinatorics and Complexity hosted by the CMSA during the current academic year.

Abstract: 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 appear in so many applications.

We then survey recent ideas that allow us to solve systems of linear equations in Laplacian matrices in nearly linear time, emphasizing the utility of graph sparsification—the approximation of a graph by a sparser one—and a recent algorithm of Kyng and Sachdeva that uses random sampling to accelerate Gaussian Elimination.

--
You received this message because you are subscribed to the Google Groups "SEAS wam_seminars" group.
To unsubscribe from this group and stop receiving emails from it, send an email to wam_seminars+unsubscribe@seas.harvard.edu.
Visit this group at https://groups.google.com/a/seas.harvard.edu/group/wam_seminars/.

Sarah LaBauve
Administrator
Center of Mathematical Sciences and Applications
Harvard University
Room 103, 20 Garden Street
Cambridge, MA
slabauve@math.harvard.edu, 617-496-5421

Ramis