Results 1  10
of
37
Improved lower bounds for embeddings into L1
 SIAM J. COMPUT.
, 2009
"... We improve upon recent lower bounds on the minimum distortion of embedding certain finite metric spaces into L1. In particular, we show that for every n ≥ 1, there is an npoint metric space of negative type that requires a distortion of Ω(log log n) for such an embedding, implying the same lower bo ..."
Abstract

Cited by 39 (5 self)
 Add to MetaCart
We improve upon recent lower bounds on the minimum distortion of embedding certain finite metric spaces into L1. In particular, we show that for every n ≥ 1, there is an npoint metric space of negative type that requires a distortion of Ω(log log n) for such an embedding, implying the same lower bound on the integrality gap of a wellknown semidefinite programming relaxation for sparsest cut. This result builds upon and improves the recent lower bound of (log log n) 1/6−o(1) due to Khot and Vishnoi [The unique games conjecture, integrality gap for cut problems and the embeddability of negative type metrics into l1, in Proceedings of the 46th Annual IEEE Symposium
Differentiating maps into L1 and the geometry of BV functions
 Ann. Math
"... ar ..."
(Show Context)
Compression bounds for Lipschitz maps from the Heisenberg group to L1
, 2009
"... We prove a quantitative biLipschitz nonembedding theorem for the Heisenberg group with its CarnotCarathéodory metric and apply it to give a lower bound on the integrality gap of the GoemansLinial semidefinite relaxation of the Sparsest Cut problem. ..."
Abstract

Cited by 23 (11 self)
 Add to MetaCart
(Show Context)
We prove a quantitative biLipschitz nonembedding theorem for the Heisenberg group with its CarnotCarathéodory metric and apply it to give a lower bound on the integrality gap of the GoemansLinial semidefinite relaxation of the Sparsest Cut problem.
Minmax graph partitioning and small set expansion
, 2011
"... We study graph partitioning problems from a minmax perspective, in which an input graph on n vertices should be partitioned into k parts, and the objective is to minimize the maximum number of edges leaving a single part. The two main versions we consider are: (i) the k parts need to be of equal s ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
We study graph partitioning problems from a minmax perspective, in which an input graph on n vertices should be partitioned into k parts, and the objective is to minimize the maximum number of edges leaving a single part. The two main versions we consider are: (i) the k parts need to be of equal size, and (ii) the parts must separate a set of k given terminals. We consider a common generalization of these two problems, and design for it an O ( √ log n log k)approximation algorithm. This improves over an O(log 2 n) approximation for the second version due to Svitkina and Tardos [22], and roughly O(k log n) approximation for the first version that follows from other previous work. We also give an improved O(1)approximation algorithm for graphs that exclude any fixed minor. Our algorithm uses a new procedure for solving the SmallSet Expansion problem. In this problem, we are given a graph G and the goal is to find a nonempty set S ⊆ V of size S  ≤ ρn with minimum edgeexpansion. We give an O ( √ log n log (1/ρ)) bicriteria approximation algorithm for the general case of SmallSet Expansion, and O(1) approximation algorithm for graphs that exclude any fixed minor.
On the unique games conjecture
 In FOCS
, 2005
"... This article surveys recently discovered connections between the Unique Games Conjecture and computational complexity, algorithms, discrete Fourier analysis, and geometry. 1 ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
(Show Context)
This article surveys recently discovered connections between the Unique Games Conjecture and computational complexity, algorithms, discrete Fourier analysis, and geometry. 1
The Euclidean distortion of the lamplighter group
, 2007
"... We show that the cyclic lamplighter group C2 ≀ Cn embeds into Hilbert space with distortion O ( √ log n). This matches the lower bound proved by Lee, Naor and Peres in [14], answering a question posed in that paper. Thus the Euclidean distortion of C2 ≀ Cn is Θ ( √ log n). Our embedding is constru ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
(Show Context)
We show that the cyclic lamplighter group C2 ≀ Cn embeds into Hilbert space with distortion O ( √ log n). This matches the lower bound proved by Lee, Naor and Peres in [14], answering a question posed in that paper. Thus the Euclidean distortion of C2 ≀ Cn is Θ ( √ log n). Our embedding is constructed explicitly in terms of the irreducible representations of the group. Since the optimal Euclidean embedding of a finite group can always be chosen to be equivariant, as shown by Aharoni, Maurey and Mityagin [1] and by Gromov (see [9]), such representationtheoretic considerations suggest a general tool for obtaining upper and lower bounds on Euclidean embeddings of finite groups.
Assouad’s theorem with dimension independent of the snowflaking
"... It is shown that for every K> 0 and ε ∈ (0, 1/2) there exist N = N(K) ∈ N and D = D(K, ε) ∈ (1, ∞) with the following properties. For every metric space (X, d) with doubling constant at most K, the metric space (X, d 1−ε) admits a biLipschitz embedding into R N with distortion at most D. The c ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
(Show Context)
It is shown that for every K> 0 and ε ∈ (0, 1/2) there exist N = N(K) ∈ N and D = D(K, ε) ∈ (1, ∞) with the following properties. For every metric space (X, d) with doubling constant at most K, the metric space (X, d 1−ε) admits a biLipschitz embedding into R N with distortion at most D. The classical Assouad embedding theorem makes the same assertion, but with N → ∞ as ε → 0.
Inapproximability of NPcomplete problems, discrete fourier analysis, and geometry
, 2010
"... This article gives a survey of recent results that connect three areas in computer science and mathematics: (1) (Hardness of) computing approximate solutions to NPcomplete problems. (2) Fourier analysis of boolean functions on boolean hypercube. (3) Certain problems in geometry, especially relate ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
(Show Context)
This article gives a survey of recent results that connect three areas in computer science and mathematics: (1) (Hardness of) computing approximate solutions to NPcomplete problems. (2) Fourier analysis of boolean functions on boolean hypercube. (3) Certain problems in geometry, especially related to isoperimetry and embeddings between metric spaces.