Graphs, limits and algorithms
- Date: Wednesday 4 October 2017, 16:00 – 17:00
- Location: Mathematics Level 8, MALL 1, School of Mathematics
- Type: Algebra, Logic and Algorithms, Seminars, Pure Mathematics
- Cost: Free
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