|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 listsFilm screening - 3 Deewarein (Three Walls) Science Different Views: E&D Lunchtime Sessions
Other talksProcessing the Transcriptome and Epitranscriptome: Message Ends 'A New Kind of Wildness' - the Rite of Spring and Other Queer Journeys into the Wild Mark Goldring - CEO of Oxfam Biological insights into mutagenesis through modern sequencing technologies Closed-form Green’s functions for the barotropic vorticity equation: new results on Bessel functions Spheres to swimmers in a Stokes flow