MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

Algorithms Design Using Spectral Graph Theory

Richard Peng
MIT
Talk
AG 1, AG 2, AG 3, AG 4, AG 5, RG1, SWS, MMCI  
AG Audience
English

Date, Time and Location

Tuesday, 29 July 2014
13:00
30 Minutes
E1 4
024
Saarbrücken

Abstract

Spectral graph theory is the interplay between linear algebra and combinatorial graphs. Laplace’s equation and its discrete form, the Laplacian matrix, are becoming increasingly popular in optimization, image processing, and machine learning. This talk will discuss some key ideas in this Laplacian paradigm for designing efficient algorithms. They build upon tools from numerical analysis, graph algorithms, and random matrix theory.

Contact

He Sun
--email hidden
passcode not visible
logged in users only

He Sun, 07/04/2014 13:04
He Sun, 06/17/2014 10:17 -- Created document.