Coarse Differentiation and Multi-flows in Planar Graphs

AbstractWe show that the multi-commodity max-flow/min-cut gap for series-parallel graphs can be as bad as 2, matching a recent upper bound (Chakrabarti et al. in 49th Annual Symposium on Foundations of Computer Science, pp. 761–770, 2008) for this class, and resolving one side of a conjecture of Gupta, Newman, Rabinovich, and Sinclair.This also improves the largest known gap for planar graphs from $\frac{3}{2}$ to 2, yielding the first lower bound that does not follow from elementary calculations. Our approach uses the coarse differentiation method of Eskin, Fisher, and Whyte in order to lower bound the distortion for embedding a particular family of shortest-path metrics into L1.

[1]  Bruce Kleiner,et al.  Generalized differentiation and bi-Lipschitz nonembedding in L1⁎ , 2006 .

[2]  Yuri Ilan,et al.  A Lower Bound on the Distortion of Embedding Planar Metrics into Euclidean Space , 2003, Discret. Comput. Geom..

[3]  J. Lindenstrauss,et al.  Geometric Nonlinear Functional Analysis , 1999 .

[4]  Jiri Matousek,et al.  Lectures on discrete geometry , 2002, Graduate texts in mathematics.

[5]  James R. Lee,et al.  Lp metrics on the Heisenberg group and the Goemans-Linial conjecture , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[6]  Bruce Kleiner,et al.  Metric differentiation, monotonicity and maps to L1 , 2009, 0907.3295.

[7]  P. Pansu,et al.  Métriques de Carnot-Carthéodory et quasiisométries des espaces symétriques de rang un , 1989 .

[8]  Nisheeth K. Vishnoi,et al.  The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1 , 2005, FOCS.

[9]  Refael Hassin,et al.  On multicommodity flows in planar graphs , 1984, Networks.

[10]  Alexandr Andoni,et al.  Lower bounds for embedding edit distance into normed spaces , 2003, SODA '03.

[11]  James R. Lee,et al.  Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[12]  Satish Rao,et al.  Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.

[13]  J. Heinonen.  Lectures on Analysis on Metric Spaces , 2000 .

[14]  J. Bourgain.  On lipschitz embedding of finite metric spaces in Hilbert space , 1985 .

[15]  Anupam Gupta,et al.  Embedding k-outerplanar graphs into ℓ1 , 2003, SODA '03.

[16]  Nathan Linial.  Finite metric spaces: combinatorics, geometry and algorithms , 2002, SCG '02.

[17]  Anupam Gupta,et al.  Cuts, Trees and ℓ1-Embeddings of Graphs* , 2004, Comb..

[18]  Bruno Franchi,et al.  Rectifiability and perimeter in the Heisenberg group , 2001 .

[19]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[20]  J. Cheeger,et al.  Differentiating maps into L1, and the geometry of BV functions , 2006, math/0611954.

[21]  I. Bárány.  LECTURES ON DISCRETE GEOMETRY (Graduate Texts in Mathematics 212) , 2003 .

[22]  Jeff Cheeger,et al.  Differentiability of Lipschitz Functions on Metric Measure Spaces , 1999 .

[23]  Subhash Khot,et al.  Nonembeddability theorems via Fourier analysis , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[24]  Scott Pauls.  The large scale geometry of nilpotent Lie groups , 1999 .

[25]  James R. Lee,et al.  Euclidean distortion and the sparsest cut , 2005, STOC '05.

[26]  Jirí Matousek,et al.  Low-Distortion Embeddings of Finite Metric Spaces , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[27]  Michel Deza,et al.  Geometry of cuts and metrics , 2009, Algorithms and combinatorics.

[28]  Bernd Kirchheim.  Rectifiable metric spaces: local structure and regularity of the Hausdorff measure , 1994 .

[29]  Bruce Kleiner,et al.  On the differentiability of Lispschitz maps from metric measure spaces to Banach spaces , 2006 .

[30]  Piotr Indyk,et al.  Algorithmic applications of low-distortion geometric embeddings , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[31]  David Fisher,et al.  Quasi-isometries and rigidity of solvable groups , 2005 .

[32]  James R. Lee,et al.  Vertex cuts, random walks, and dimension reduction in series-parallel graphs , 2007, STOC '07.

[33]  Yuval Rabani,et al.  An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm , 1998, SIAM J. Comput..