|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Local algorithms on bounded degree graphs
If you have a question about this talk, please contact Andrew Thomason.
We focus on the question of which properties and parameters of a very large bounded-degree graph can be estimated by a constant-time sampling from the graph. A strongly related concept is the local algorithm on bounded-degree graphs, which means that we construct a structure, say a large independent set, in such a way that we decide about each vertex depending only on its constant radius neighbourhood.
I will give a brief introduction to these topics with some recent results, open questions, and connections to other topics.
This talk is part of the Combinatorics Seminar series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsCambridge University Entrepreneurs (CUE) Cambridge Systems Biology Centre Denise Schofield
Other talksRealising the full potential of single particle cryomicroscopy Welsh Poetry and English Politics in the Wars of the Roses Lunchtime Talks What does experiential knowledge contribute to public health evidence to reduce health inequalities? Nausea in New York: The FBI and CIA vs Sartre and Camus Leadership for Engineers - How to become an effective and valued leader