|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 listsJapanese Society in Cambridge The Yerushah Lecture 2012 Acoustics Lab Seminars
Other talksA Lab of One's Own: Science & Suffrage in World War One Changes in the culture of biological recording, 1955–2015 A pious home? Italian Renaissance devotional jewellery and amulets Sensitivity to BST-2 restriction correlates with Orthobunyavirus host range. What lies beneath? How microtomography is providing new insights into systematics and functional morphology in the human fossil record Gothic Encounters? Architectural History, Phenomenology and the Gothic Church