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 > Kuwait Foundation Lectures > The local theory of metric spaces and graph algorithms
The local theory of metric spaces and graph algorithmsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact helen. In the past decade methods from Riemannian geometry and Banach space theory have become a central tool in the design and analysis of approximation algorithms for a wide range of NP hard problems. In the reverse direction, problems and methods from theoretical computer science have recently led to solutions of long standing problems in metric geometry. This talk will illustrate the connection between these fields through the example of the Sparsest Cut problem. This problem asks for a polynomial time algorithm which computes the Cheeger constant of a given finite graph. The Sparsest Cut problem is known to be NP hard, but it is of great interest to devise efficient algorithms which compute the Cheeger constant up to a small multiplicative error. We will show how a simple linear programming formulation of this problem leads to a question on bi-Lipschitz embeddings of finite metric spaces into L _1, which has been solved by Bourgain in 1986. We will then proceed to study a quadratic variant of this approach which leads to the best known approximation algorithm for the Sparsest Cut problem. The investigation of this “semidefinite relaxation” leads to delicate questions in metric geometry and isoperimetry, in which the geometry of the Heisenberg group plays an unexpected role. This talk is part of the Kuwait Foundation Lectures series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsNext Genration Biophysics; Friday 8th November 2019 Churchill Undergraduate Physics Seminars https://data.mendeley.com/.../48a01efd-27c7-4835-9f51-f73c2978... Traduire cette page 7 nov. 2016 - Boudemagh, N (2016), “Applied statistics”, Mendeley Data, v1 http://dx.doi.org/10.17632/6p462pvms6.1#file-48a01efd-27c7-4835-9f51- ...Other talksFormation and disease relevance of axonal endoplasmic reticulum, a "neuron within a neuron”. Dynamics of Phenotypic and Genomic Evolution in a Long-Term Experiment with E. coli What quantum computers tell us about physics (even if no one ever builds one!) Primary liver tumor organoids: a new pre-clinical model for drug sensitivity analysis An SU(3) variant of instanton homology for webs Fields of definition of Fukaya categories of Calabi-Yau hypersurfaces The Digital Doctor: Hope, Hype, and Harm at the Dawn of Medicine’s Computer Age Symplectic topology of K3 surfaces via mirror symmetry The Gopakumar-Vafa conjecture for symplectic manifolds Assessment of data completeness in the National Cancer Registry and the impact on the production of Cancer Survival Statistics |