News, Oberseminare, Vorträge

Thursday, April 11, 4pm (s.t.), Raum 711 groß

Talk by Bernd Sturmfels, Director at the MPI-MiS in Leipzig and honorary doctorate holder of our department


Title: The two lives of the Grassmannian

Abstract: The Grassmannian parametrizes linear subspaces of a real vector space. It is both a projective variety (via Plücker coordinates) and an affine variety (via orthogonal projections). We examine these two representations, through the lenses of linear algebra, commutative algebra, and statistics.

His talks tend to be very accessible and entertaining to a wide audience of mathematicians. So I would like to invite and encourage all of you to come. He will be around for most of the day and he is very interested in meeting the younger generation of mathematicians in Frankfurt. So please feel free to stop by in the second floor of RM 6-8 during the day, in case you want to meet him before his talk.

Dear Colleagues and Friends of C3S,

we would like to invite you to a virtual talk by Prof. Dr. Michael Schaub, (RWTH Aachen) on "Signal processing on graphs and complexes".
Abstract and Bio can be found below.

The talk will take place on Monday, January 22nd, 12:00 CET online under this link:
https://uni-frankfurt.zoom.us/j/67055456444?pwd=RnY0L0NHRXdtdUV6KzIrbm5SMGpJdz09 
Meeting-ID: 670 5545 6444
Kenncode: 294593

We are looking forward to seeing you there.

Kind regards,
the C3S Board


Abstract

In many applications, we are confronted with signals defined on the nodes of a graph. Think for instance of a sensor network measuring temperature; or a social network, in which each person (node) has an opinion about a specific issue. Graph signal processing (GSP) tries to device appropriate tools to process such data by generalizing classical methods from signal processing of time-series and images -- such as smoothing, filtering and interpolation -- to signals defined on graphs. Typically, this involves leveraging the structure of the graph as encoded in the spectral properties of the graph Laplacian matrix. In other applications such as traffic network analysis, however, the signals of interest are naturally defined on the edges of a graph, rather than on the nodes. After a recap of the central ideas of GSP, we examine why the standard tools from GSP may not be suitable for the analysis of such edge signals. More specifically, we discuss how the underlying notion of a 'smooth signal' inherited from typically considered graph Laplacians are not suitable when dealing with edge signals that encode a notion of flow. To overcome this limitation we devise signal processing tools based on the Hodge-Laplacian and the associated discrete Hodge Theory for simplicial (and cellular) complexes. We discuss applications of these ideas for signal smoothing, semi-supervised and active learning for edge-flows on discrete (or
discretized) spaces.


Bio

Michael Schaub studied Electrical Engineering and Information Technology at ETH Zurich. After an MSc in Biomedical Engineering at Imperial College London, he obtained his PhD in Mathematics at Imperial College London. In the following he worked as a Research Fellow in Belgium, before he moved to the Massachusetts Institute of Technology (MIT) as a Postdoctoral Research Associate. From July 2017 onwards he was a Marie Skłodowska Curie Fellow at MIT and the University of Oxford, before joining RWTH Aachen University in June 2020. He was awarded an ERC Starting grant in 2022.