|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 listsHealth and Welfare Research Group Insect Molecular Biology Milton 400th Anniversary Lectures
Other talksSystemic Risk, Macroprudential Supervision and Regulation CVD Forum: Transcriptional variation in human induced pluripotent stem cells (iPSCs) and their derivatives Nausea in New York: The FBI and CIA vs Sartre and Camus The memories of Eumaeus: a talk by James Warren Bank Credit Risk Networks: Evidence from the Eurozone Crisis Diabetes in pregnancy: a hard case to swallow