Paul Shearer

Expander Graphs

In a bipartite expander graph, vertices are divided into left and right groups, and any small set of left vertices "expands" to connect to a large set of right vertices. These graphs have applications in a variety of computer science problems. We will introduce expanders and explain how they can be used to construct a powerful family of error-correcting "expander codes."