| [home] - [up] |
Abstract: I will give a survey about random matrices, whose entries have discrete distributions. (The most basic case is when the entries are random signs.) The focus of the talk is on a rather surprising connection with additive number theory, observed in a series of papers with Terence Tao.
Colloquium - 16 Uhr s.t.
Abstract: The minimum bisection problem is to partition the vertices of a given graph into two classes of equal size so as to minimize the number of crossing edges. Popular heuristics for this NP-hard problem employ spectral techniques. In this talk I'll present such a spectral heuristic and sketch its analysis on a random graph model.