University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Spectral Sparsification of Graphs

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Spectral Sparsification of Graphs

Download to your calendar using vCal

If you have a question about this talk, please contact INI IT .

SNAW01 - Graph limits and statistics

Modern graph algorithms increasingly access and manipulate graphs via their Laplacian operators and other associated “continuous” objects, rather than purely discretely.  An important primitive in this paradigm is spectral sparsification: being able to approximate the Laplacian of a given graph by that of a graph with significantly fewer edges. I will survey some of the key results in this area, drawing on tools from random matrix theory, matrix analysis, and electrical network theory.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

email hosting uk CIMR, The Keith Peters Building, The Level 7 Lecture Theatre Webinar & LT2, Computer Laboratory, William Gates Building.

Other talks

Title to be confirmed CSAR lecture: Decarbonizing road freight (TBC) Afternoon Break Title to be confirmed Proteomics: Expression Analysis and Subcellular Localisation Talk TBC
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity