Bandwidth and low dimensional embedding

Authors:
Yair Bartal;Douglas E. Carroll;Adam Meyerson;Ofer Neiman
Affiliations:
Institute of Computer Science, Hebrew University of Jerusalem, Israel;NetSeer.com;Department of Computer Science, University of California, Los Angeles;Princeton University and Center for Computational Intractability
Venue:
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Year:
2011

Citing 13
Cited 0

Approximating the bandwidth via volume respecting embeddings (extended abstract)

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Small distortion and volume preserving embeddings for planar and Euclidean metrics

SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
A lower bound on the distortion of embedding planar metrics into Euclidean space

Proceedings of the eighteenth annual symposium on Computational geometry
Embedding k-outerplanar graphs into ℓ1

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Cuts, Trees and -Embeddings of Graphs

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Bounded Geometries, Fractals, and Low-Distortion Embeddings

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
On the Impossibility of Dimension Reduction in \ell _1

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Embedding metric spaces in their intrinsic dimension

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Generalized Gene Adjacencies, Graph Bandwidth, and Clusters in Yeast Evolution

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A constructive proof of the general lovász local lemma

Journal of the ACM (JACM)
An algorithmic approach to the lovász local lemma. I

Random Structures & Algorithms
Embedding bounded bandwidth graphs into ℓ1

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We design an algorithm to embed graph metrics into lp with dimension and distortion both dependent only upon the bandwidth of the graph. In particular we show that any graph of bandwidth k embeds with distortion polynomial in k into O(log k) dimensional lp, 1 ≤ p ≤ ∞. Prior to our result the only known embedding with distortion independent of n was into high dimensional l1 and had distortion exponential in k. Our low dimensional embedding is based on a general method for reducing dimension in an lp embedding, satisfying certain conditions, to the intrinsic dimension of the point set, without substantially increasing the distortion. As we observe that the family of graphs with bounded bandwidth are doubling, our result can be viewed as a positive answer to a conjecture of Assouad [2], limited to this family. We also study an extension to graphs of bounded tree-bandwidth.