University of Cambridge > > Churchill CompSci Talks > Expander Graphs

Expander Graphs

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Matthew Ireland.

Graphs are a useful mathematical entity with many applications in computer science. Expanders are graphs with high sparseness and connectivity (as quantified by measures like Cheeger’s constant), two properties that are hard to maximize concurrently.

This talk introduces expander graphs, some of their basic properties and describes applications such as error correcting codes, and error reduction in probabilist algorithms.

This talk is part of the Churchill CompSci Talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity