|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 listsSainsbury Laboratory Seminars Finance - Centre for Financial Research 2d to 3d equation sets and implication of super massive blackholes
Other talksSummer Cactus & Succulent Show Prof Jan Rehwinkel: Nucleic Acid Sensing by Innate Immune Receptors Helminth-associated changes in composition of the faecal microbiota of a Sri Lankan community Presentation: Challenge 3. Estimating Flood Probability Using Historical Data Heat Rises: 100 Years of Rayleigh-Bénard Convection (Rouse Ball Lecture) Spacetime near an extreme horizon