|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 listsPedagogy, Language, Arts & Culture in Education (PLACE) Group Seminars Forum for Youth Participation and Democracy Centre for Atmospheric Science seminars, Chemistry Dept.
Other talksVirtual Webinar! series 7: The impact of policy on music education in schools - the problem of PISA as well as domestic policy Topological order from strong correlations in two-dimensional lattice models Cambridge Public Policy Seminar: Title TBC Numerical Methods for (Quasi)Variational Inequalities - Part II The Persistence of Health Inequalities in Modern Welfare States Equines in Developing Countries – What are Their Welfare Issues and How Can They Be Addressed?