University of Cambridge > Talks.cam > Churchill CompSci Talks > Expander Graphs

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Expander Graphs

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

The Woolf Institute, Wesley House, Jesus Lane, CB5 8BJ Commission based business in india 60 Hills road Cambridge, CB2 1LA

Other talks

title abstract tbc Online Causal Inference Seminar Group Work Title to be confirmed Title TBC Title to be confirmed
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity