Expander flows, geometric embeddings, and graph partitioning Sanjeev Arora Princeton Satish Rao UC...

Expander flows, geometric embeddings, and graph partitioning

• Sanjeev Arora Princeton

• Satish Rao UC Berkeley

• Umesh Vazirani UC Berkeley

( + survey of other followup work)

Sparsest Cut

SS

G = (V, E)

c- balanced separator

Both NP-hard

G) = minS µ V

| E(S, Sc)|

|S||S| < |V|/2

c(G) = minS µ V

| E(S, Sc)|

|S|c |V| < |S| < |V|/2

Why these problems are important

• Arise in analysis of random walks, PRAM simulation, packet routing, clustering, VLSI layout etc.

• Underlie many divide-and-conquer graph algorithms (surveyed by Shmoys’95)

• Discrete analogs of isoperimetric constant; related to curvature of Riemannian manifolds and 2nd eigenvalue of Laplacian (Cheeger’70)

• Graph-theoretic parameters of inherent interest (cf. Lipton-Tarjan planar separator theorem)

Previous approximation algorithms

1) Eigenvalue approaches (Cheeger’70, Alon’85, Alon-Milman’85)

2c(G) ¸ L(G) ¸ c(G)2/2 c(G) = minS µ V E(S, Sc)/ E(S)

2) O(log n) -approximation via LP (multicommodity flows) (Leighton-Rao’88) • Approximate max-flow mincut theorems

• Region-growing argument

(Linial, London, Rabinovich’94, AR’94)

3) Embeddings of finite metric spaces into l1

• Geometric approach; more general result (but still O(log n) approximation)

Our results

1. O( ) -approximation to sparsest cut and conductance

2. O( )-pseudoapproximation to c-balanced separator

(algorithm outputs a c’-balanced separator, c’ < c)

3. Existence of expander flows in every graph

(approximate certificates of expansion)

log n

log n

Disparate approaches from previous slide get “unified”

Semidefinite relaxations for c-balanced separator

(and how to round the solutions)

LP Relaxations for c-balanced separator

Motivation: Every cut (S, Sc) defines a (semi) metric

1

1

1

0 0

Xij 2 {0,1}

i< j Xij ¸ c(1-c)n2

Xij + Xj k ¸ Xik

0 · Xij · 1

Semidefinite

There exist unit vectors v1, v2, …, vn 2 <n such that Xij = |vi - vj|2 /4

Min (i, j) 2 E Xij

Example of l22 space: hypercube {-1, 1}k

|u – v|2 = i |ui – vi|2 = 2 i |ui – vi| = 2 |u – v|1

In fact, every l1 space is also l22

Conjecture (Goemans, Linial): Every l22 space is l1 up to distortion O(1)

Our Main Theorem

Two subsets S and T are -separated if for every vi 2 S, vj 2 T |vi –vj|2 ¸

¸

Thm: If i< j |vi –vj|2 = (n2) then there exist two sets S, T of size (n) that are -separated for = ( 1 )

<d

log n

Next 10-12 min: Proof-sketch of Main Thm

( algorithm to produce -separated S, T of size (n); = 1/ )nlog

Projection onto a random line

<dv

u

<u, v> ??

1

d

1

d

e-t

2/2

d

Pru[ projection exceeds 2 ] < 1/n2log n

Algorithm to produce two –separated sets

<d

u

Su

Tu

0.01

d

Check if Su and Tu have size (n)

If any vi 2 Su and vj 2 Tu satisfy

|vi –vj|2 ·

repeat until no such vi, vj remain

delete them and

If Su, Tu still have size (n), output them

Main difficulty: Show that whp only o(n) points get deleted

d

“Stretched pair”: vi, vj such that |vi –vj|2 · and | h vi –vj, u i | ¸ 0.01

Obs: Deleted pairs are stretched and they form a matching.

“Matching is of size o(n) whp” : naive argument fails

d

“Stretched pair”: vi, vj such that |vi –vj|2 · and | h vi –vj, u i | ¸ 0.01

O( 1 ) £ standard deviation

) PrU [ vi, vj get stretched] = exp( - 1 )

= exp( - )log n

E[# of stretched pairs] = O( n2 ) £ exp(- ) log n

Vi

Ball (vi , )u

Vj

0.01

d

Suppose matching of (n) size exists with probability (1)…

….stretched pairs are almost everywhere you look!

Generating a contradiction: the walk on stretched pairs

u

Vi

Vj

0.01

d

0.01

d

r steps

0.01

d

r

|vfinal - vi| < r

| <vfinal – vi, u>| ¸ 0.01rd

= O( r ) x standard dev.

vfinal

Contradiction (if r large enuff)!!

Measure concentration (P. Levy, Gromov etc.)

<d

A

A : measurable set with (A) ¸ 1/4

A : points with distance · to A

AA) ¸ 1 – exp(-2 d)

Reason: Isoperimetric inequality for spheres

Expander flows

(approximate certificates of expansion)

Expander flows: Motivation

G = (V, E)

SS

Idea: Embed a d-regular (weighted) graph such that

8 S w(S, Sc) = (d |S|)

Cf. Jerrum-Sinclair, Leighton-Rao(embed a complete graph)

“Expander”

Weighted Graph w satisfies (*) iff L(w) = (1) [Cheeger]

(*)

Our Thm: If G has expansion , then a d-regular expander flow exists in it where d=

log n

(certifies expansion = (d) )

Example of expander flow

n-cycle

Take any 3-regular expander on n nodesPut a weight of 1/3n on each edge

Embed this into the n-cycle

Routing of edges does not exceed any capacity ) expansion =(1/n)

Open problems (circa April’04)

• Better running time/combinatorial algorithm?

• Improve approximation ratio to O(1); better rounding??(our conjectures may be useful…)

• Extend result to other expansion-like problems (multicut, general sparsest cut; MIN-2CNF deletion)

• Resolve conjecture about embeddability of l22 into l1; of l1 into l2

• Any applications of expander flows?

O(n2) time; [A., Hazan, Kale]

log3/4 n distortion; [Chawla,Gupta, Racke]

Integrality gap is (log n) [Charikar]

Yes [Naor,Sinclair,Rabani]

Better embeddings of lp into lq [Lee]

New result (A., Hazan, Kale;FOCS’04)

O(n2) time algorithm that given any graph G finds for some D >0

• a D-regular expander flow • a cut of expansion O( D )log n

Ingredients: Approximate eigenvalue computations; Approximate flow computations (Garg-Konemann; Fleischer) Random sampling (Benczur-Karger + some more)

Idea: Define a zero-sum game whose optimum solution is an expander flow; solve approximately using Freund-Schapire approximate solver.

)D) · (G) ·O(D )log n

Expander flows: LP view

LP feasible ) ¸ (D)LP feasible ) ¸ (D)

GG

· D· D

· 1· 1

Thm [ARV]: 9 0 s.t. the LP is

feasible with D = /√log n

Thm [ARV]: 9 0 s.t. the LP is

feasible with D = /√log n

Embeddings of finite metric spaces into geometric-spaces

If (X, d) is a finite metric space and f : X ! R k then distortion of f is minimum C >1 such that for every x, y 2 X:

d( x, y) · | f(x) –f( y)|2 · C¢ d( x, y)

Thm (Bourgain’85): For every n-point metric space, a map exists with distortion O(log n)

[LLR’94]: Algorithm to find the map; Proof that O(log n) cannot be improved in general

Question: Can O(log n) be improved when X is a geometric space; say l1 ?

Status report of this area

l1 into l2log0.5 n[Enflo’69]

l22 into l1 1.16 [Zatloukal’04]

Superconstant[Khot, Vishnoi’04]

l22 into l2log0.5 n[Enflo’69]

Best lowerbound Best upperbound

Exactly the integrality gap of SDP for general SPARSEST CUT[LLR’94, AR’94]

log n[Bourgain’85]

log0.75 n

[Chawla,Gupta,Racke ’04]

log0.5 n log log n[A., Lee, Naor’04]

Frechet’s recipe to embed metric space (X, d) into Rk

Pick k suitable subsets A1, A2, …, Ak of X

Map x 2 X to (d(x, A1), d(x, A2), … , d(x, Ak)) Aix

In recent results, Ai’s are chosen using [ARV] structural Theorem and “Measured descent” idea of [Krauthgamer, Lee, Naor, and Mendel’04]

New -approximation algorithms

• MIN-2-CNF deletion and several graph deletion problems. [Agarwal, Charikar, Makarychev, Makarychev’04]

• MIN-LINEAR ARRANGEMENT [Charikar, Karloff, Rao’04]

• General SPARSEST CUT [A., Lee, Naor ’04]

log n

Looking forward to more progress…

Thanks !

Various new results

O(n2) time combinatorial algorithm for sparsest cut (does not use semidefinite programs)

[A., Hazan, Kale’04]

New results about embeddings: (i) lp into lq [J. Lee’04]

(ii) l22 and l1 into l2 [CGR’04]

(approx for general sparsest cut)

Clearer explanation of expander flows and their connection to embeddings [NRS’04]

Formal statement : 9 0 >0 s.t. foll. LP is feasible for d = (G)

log n

fp ¸ 0 8 paths p in G

8i j p 2 Pij fp = d (degree)

Pij = paths whose endpoints are i, j

8S µ V i 2 S j 2 Sc p 2 Pij fp ¸ 0 d |S| (demand graph is

an expander)

8e 2 E p 3 e fp · 1 (capacity)

A concrete conjecture (prove or refute)

G = (V, E); = (G)

For every distribution on n/3 –balanced cuts {zS} (i.e., S zS =1)

there exist (n) disjoint pairs (i1, j1), (i2, j2), ….. such that for each k,

• distance between ik, jk in G is O(1/ )

• ik, jk are across (1) fraction of cuts in {zS}

(i.e., S: i 2 S, j 2 Sc zS = (1) )

Conjecture ) existence of d-regular expander flows for d =

log n

log n

nlog

Expander flows, geometric embeddings, and graph partitioning Sanjeev Arora Princeton Satish Rao UC...

Documents

Transcript of Expander flows, geometric embeddings, and graph partitioning Sanjeev Arora Princeton Satish Rao UC...