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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, May 24, 2012, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Anna Gundert

Expansion for 2-complexes

For graphs, combinatorial expansion properties are closely related to the eigenvalues of the adjacency matrix and the Laplacian. This relationship is expressed by the Cheeger Inequality, which states in particular that spectral expansion (a large spectral gap) implies combinatorial expansion. We consider generalizations of these graph matrices to higher dimensional simplicial complexes as well as a higher dimensional analogue of edge expansion, recently introduced independently by Gromov, Linial and Meshulam and Newman and Rabinovich.
We will see that in higher dimensions the most straightforward attempt at an analogue of Cheeger's Inequality fails: A large spectral gap for the generalized Laplacian doesn't imply combinatorial expansion. We furthermore present concentration results for the spectra of random complexes which match the corresponding results on spectra of random graphs.
Joint work with Uli Wagner


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

Previous talks by year:   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