A Simple proof of Johnson-Lindenstrauss extension theorem

Johnson and Lindenstrauss proved that any Lipschitz mapping from an $n$-point subset of a metric space into Hilbert space can be extended to the whole space, while increasing the Lipschitz constant by a factor of $O(\sqrt{\log n})$. We present a simplification of their argument that avoids dimension reduction and the Kirszbraun theorem.Comment: 3 pages. Incorporation of reviewers' suggestion

Multi-Embedding of Metric Spaces

Metric embedding has become a common technique in the design of algorithms. Its applicability is often dependent on how high the embedding's distortion is. For example, embedding finite metric space into trees may require linear distortion as a function of its size. Using probabilistic metric embeddings, the bound on the distortion reduces to logarithmic in the size. We make a step in the direction of bypassing the lower bound on the distortion in terms of the size of the metric. We define "multi-embeddings" of metric spaces in which a point is mapped onto a set of points, while keeping the target metric of polynomial size and preserving the distortion of paths. The distortion obtained with such multi-embeddings into ultrametrics is at most O(log Delta loglog Delta) where Delta is the aspect ratio of the metric. In particular, for expander graphs, we are able to obtain constant distortion embeddings into trees in contrast with the Omega(log n) lower bound for all previous notions of embeddings. We demonstrate the algorithmic application of the new embeddings for two optimization problems: group Steiner tree and metrical task systems

Scaled Enflo type is equivalent to Rademacher type

We introduce the notion of the scaled Enflo type of a metric space, and show that for Banach spaces, scaled Enflo type p is equivalent to Rademacher type p

Metric Cotype

We introduce the notion of metric cotype, a property of metric spaces related to a property of normed spaces, called Rademacher cotype. Apart from settling a long standing open problem in metric geometry, this property is used to prove the following dichotomy: A family of metric spaces F is either almost universal (i.e., contains any finite metric space with any distortion > 1), or there exists α > 0, and arbitrarily large n-point metrics whose distortion when embedded in any member of F is at least Ω((log n)^α). The same property is also used to prove strong non-embeddability theorems of L_q into L_p, when q > max{2,p}. Finally we use metric cotype to obtain a new type of isoperimetric inequality on the discrete torus

Some applications of Ball's extension theorem

We present two applications of Ball's extension theorem. First we observe that Ball's extension theorem, together with the recent solution of Ball's Markov type 2 problem due to Naor, Peres, Schramm and Sheffield, imply a generalization, and an alternative proof of, the Johnson-Lindenstrauss extension theorem. Second, we prove that the distortion required to embed the integer lattice {0,1,...,m}^n, equipped with the ℓ_p^n metric, in any 2-uniformly convex Banach space is of order min {n^(1/2 1/p),m^(1-2/p)}

Better algorithms for unfair metrical task systems and applications

Unfair metrical task systems are a generalization of online metrical task systems. In this paper we introduce new techniques to combine algorithms for unfair metrical task systems and apply these techniques to obtain improved randomized online algorithms for metrical task systems on arbitrary metric spaces.Comment: 20 pages, 1 figur

Metric Cotype

We introduce the notion of cotype of a metric space, and prove that for Banach spaces it coincides with the classical notion of Rademacher cotype. This yields a concrete version of Ribe's theorem, settling a long standing open problem in the nonlinear theory of Banach spaces. We apply our results to several problems in metric geometry. Namely, we use metric cotype in the study of uniform and coarse embeddings, settling in particular the problem of classifying when L_p coarsely or uniformly embeds into L_q. We also prove a nonlinear analog of the Maurey-Pisier theorem, and use it to answer a question posed by Arora, Lovasz, Newman, Rabani, Rabinovich and Vempala, and to obtain quantitative bounds in a metric Ramsey theorem due to Matousek.Comment: 46 pages. Fixes the layou