05C50 Online Seminar: Enide Andrade
Topic
New results on graph partitions and Fiedler theory
Speakers
Details
In this seminar we recall the spectral partitioning method based on a Fiedler vector, i.e., an eigenvector corresponding to the second smallest eigenvalue of the Laplacian matrix of a graph. This problem corresponds to the minimization of a quadratic form associated with this matrix, under a certain constraint. We introduce a similar problem using the $\ell_1$-norm to measure distances and compare the optimal solutions for both problems.
The slides and a recording of this talk will be shared on this website.
Additional Information
The 05C50 Online is an international seminar about graphs and matrices held twice a month on Fridays.
Time: 8AM Pacific/10AM Central
For more information, visit https://sites.google.com/view/05c50online/home.
If you would like to attend, please register using this form to receive the zoom links: https://docs.google.com/forms/d/e/1FAIpQLSdQ98fh58cgeSWzbFe3t77i28FXDck1gYuX9jv_qd4kEf5l_Q/viewform?usp=sf_link