TY - JOUR
T1 - Bandwidth and low dimensional embedding
AU - Bartal, Yair
AU - Carroll, Douglas E.
AU - Meyerson, Adam
AU - Neiman, Ofer
N1 - Funding Information:
E-mail addresses: [email protected] (Y. Bartal), [email protected] (D.E. Carroll), [email protected] (A. Meyerson), [email protected] (O. Neiman). 1 The work was done in part while the author was at the Center for the Mathematics of Information, Caltech, and the Institute for Pure and Applied Mathematics, UCLA. Supported in part by a grant from the Israeli Science Foundation (195/02) and in part by a grant from the National Science Foundation (NSF CCF-065253). 2 Research done while a student at UCLA. 3 Research supported by the National Science Foundation under Grant No. CCF-106540. 4 Supported by ISF grant No. 523/12 and by the European Union’s Seventh Framework Programme (FP7/2007-2013) under grant agreement No. 303809.
PY - 2013/8/19
Y1 - 2013/8/19
N2 - We design an algorithm to embed graph metrics into ℓp 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 ℓpO(logk), 1≤p≤. Prior to our result the only known embedding with distortion independent of n was into high dimensional ℓ1 and had distortion exponential in k. Our low dimensional embedding is based on a general method for reducing the dimension of an ℓp embedding. This method requires that the embedding satisfy certain conditions, and the dimension is reduced to the intrinsic dimension of the point set, without substantially increasing the distortion. We observe that the family of graphs with bounded bandwidth are doubling, thus our main result can be viewed as a positive answer to a conjecture of Assouad (1983) [2], limited to this family. We also study an extension to graphs of bounded tree-bandwidth.
AB - We design an algorithm to embed graph metrics into ℓp 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 ℓpO(logk), 1≤p≤. Prior to our result the only known embedding with distortion independent of n was into high dimensional ℓ1 and had distortion exponential in k. Our low dimensional embedding is based on a general method for reducing the dimension of an ℓp embedding. This method requires that the embedding satisfy certain conditions, and the dimension is reduced to the intrinsic dimension of the point set, without substantially increasing the distortion. We observe that the family of graphs with bounded bandwidth are doubling, thus our main result can be viewed as a positive answer to a conjecture of Assouad (1983) [2], limited to this family. We also study an extension to graphs of bounded tree-bandwidth.
KW - Bandwidth
KW - Low dimension
KW - Metric embedding
UR - https://www.scopus.com/pages/publications/84881478542
U2 - 10.1016/j.tcs.2013.05.038
DO - 10.1016/j.tcs.2013.05.038
M3 - Article
AN - SCOPUS:84881478542
SN - 0304-3975
VL - 500
SP - 44
EP - 56
JO - Theoretical Computer Science
JF - Theoretical Computer Science
ER -