|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 listsMedieval Philosophy Reading Group Synthetic Chemistry Research Interest Group Talk by Gary Dymski: The Neoclassical Sink and the Heterodox Spiral: Why the Twin Global Crisis has not Transformed Economics
Other talksNon-suicidal self-injury: an important transdiagnostic symptom cluster? Recapturing pluripotency: links between cellular reprogramming and breast cancer heterogeneity Differential Geometry of the Semi-Geostrophic and Euler Equations Finding the balance: agriculture, biodiversity, and ecosystem services The computational complexity of entanglement detection Studying the invasive migration of Drosophila immune cells.