Nathan Linial
ABSTRACT
In the last several years a number of very interesting results were proved about finite metric spaces. Some of this work is motivated by practical considerations: Large data sets (coming e.g. from computational molecular biology, brain research or data mining) can be viewed as large metric spaces that should be analyzed (e.g. correctly clustered).On the other hand, these investigations connect to some classical areas of geometry - the asymptotic theory of finite-dimensional normed spaces and differential geometry. Finally, the metric theory of finite graphs has proved very useful in the study of graphs per se and the design of approximation algorithms for hard computational problems. In this talk I will try to explain some of the results and review some of the emerging new connections and the many fascinating open problems in this area.
Index Terms
- Finite metric spaces: combinatorics, geometry and algorithms
Recommendations
Effective Hausdorff Dimension in General Metric Spaces
We introduce the concept of effective dimension for a wide class of metric spaces whose metric is not necessarily based on a measure. Effective dimension was defined by Lutz (Inf. Comput., 187(1), 49---79, 2003) for Cantor space and has also been ...
Recursive quasi-metric spaces
In computable analysis recursive metric spaces play an important role, since these are, roughly speaking, spaces with computable metric and limit operation. Unfortunately, the concept of a metric space is not powerful enough to capture all interesting ...
Comments