|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 Lymphoma Network (CaLy) Culture of Scientific Research Looking at Language Acquisition (LALA) XIII - A meeting of Essex and Cambridge PhD students
Other talksProduct Market Competition and Option Prices On Extinction and De-extinction Earthquake Induced Soil Liquefaction: Symptoms and Cures A feast of languages: multilingualism in neuro-typical and atypical populations The Evolution of Arthropods: From Limb Transformation in Crustaceans to Color Variation in Butterflies カバンもちから鞄持へ − マイ落語ライフ一席