|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 listsChanging Health Bioinformatics jounal club for the -omics Reading Group on Stochastic Differential Equations
Other talksSpectroscopic imaging: new trends and emerging applications Why We Disagree about Human Nature Genome diversity and evolution of transmissible cancers in dogs and Tasmanian devils International Space Station: Off the Earth, For the Earth A-Z of A/B testing. Perspectives in Nano Information Processing