|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 listsSt Catharine's College MCR Catz Mini-Seminars Cambridge Centre for Analysis talks Departmental Seminars in History and Philosophy of Science
Other talksProfessor Frances Brodsky - Title tbc Conductive Inks, Fibers And Aerogels From Graphite Microfluidization The role of pragmatic literacy in estate management Estimation in the Ising blockmodel Modeling the Physical Multi-Phase Interactions of HNO3 Between Snow and Air on the Antarctic Plateau (Dome C) and coast (Halley) Markov process models for time-varying networks