Graphs, limits and algorithms

Gabor Elek, Lancaster University. Part of the algebra, logic and algorithms seminar series.

Convergence of finite, sparse graphs was defined by Benjamini and Schramm in 2001.  I will give a quick introduction on the subject and show how the notion relates to computer science.

Gabor Elek, Lancaster University