SMS scnews item created by Giles Gardam at Mon 4 Jun 2012 1844
Type: Seminar
Distribution: World
Expiry: 11 Jun 2012
Calendar1: 7 Jun 2012 1300-1400
CalLoc1: Carslaw 351
Auth: gilesg@bari.maths.usyd.edu.au

SUMS: Gardam -- Expander Graphs

Expander Graphs are highly connected yet sparse graphs with a surprising number of
applications.  Although in some sense almost all regular graphs are expanders, they are
notoriously difficult to construct.  In this talk we will cover this apparent paradox
and some applications to such things as the theory of pseudorandomness, error correcting
codes and sorting algorithms.


If you are registered you may mark the scnews item as read.
School members may try to .