Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, March 05, 2013, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Anna Gundert

A Cheeger Inequality in Dimension 2

The combinatorial expansion properties of a graph are closely related to the spectra of its Laplacian. We will discuss the discrete Cheeger inequality which expresses this relationship and will in particular see how we can prove that a large spectral gap implies edge expansion. We will then consider how this can be generalized to 2-dimensional simplicial complexes.
A generalization of the graph Laplacian was introduced by Eckmann in the 40s. Some might remember a result I presented last year: A large spectral gap for Eckmann's Laplacian doesn't imply a higher dimensional analogue of edge expansion that was recently introduced by Gromov, Linial and Meshulam, Newman and Rabinovich.
Now, I will present a positive result by Parzancheski, Rosenthal and Tessler that uses a different, more combinatorial analogue of edge expansion and relates this to the spectral gap of Eckmann's Laplacian.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login