COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Combinatorics Seminar > Local algorithms on bounded degree graphs

## Local algorithms on bounded degree graphsAdd to your list(s) Download to your calendar using vCal - Endre Csóka (Rényi Institute and University of Warwick)
- Thursday 17 January 2013, 14:30-15:30
- MR12.
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:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Combinatorics Seminar
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- MR12
- School of Physical Sciences
Note that ex-directory lists are not shown. |
## Other listsi-Teams Beyond Academics Current Issues in Assessment## Other talksHealth Economics @ Cambridge seminar: Title TBC The Alexander polynomial, its categorification and gluing "Negative-feedback control of cortical activity by the neuromodulator adenosine" Bayesian Argumentation in the Real World Defining “Good” in “Good Energy Policy”: Insights from Theologies and Religions Understanding Unconscious Bias: Session 2 |