Special Lecture of Gabor Elek (EPFL Lausanne)

Graph Limits - The Hyperfinite Case

Date: November 25, 2011, 2p.m.

Venue: Room II.57, Friedrich-Ebert-Allee 144



The testability results of Newman and Sohler as well as the work of Hassidim, Kelner, Nguyen and Onak suggest that the theory of hyperfinite graphs (say, bounded degree planar graphs) are analogous to the one of dense graphs. In this talk, we show how to build a limit graph theory for hypergraph graphs parallel to the theory of graphons by Lovasz and Szegedy.