Approximating Average Parameters of Graphs.pptVIP

Approximating Average Parameters of Graphs Oded Goldreich, Weizmann Institute Dana Ron, Tel Aviv University The Type of Problems we Consider The Particular Problems we Study Our Results Our Results Cont’ Our Results: Summary Estimating Average Degree Estimating Average Degree Cont’ Estimating Average Degree Cont’ Estimating Average Degree Cont’ Estimating Average Degree Summary Estimating Average Degree L.B. Estimating Average Distance Estimating Average Distance Estimating Average Distance L.B. (for Problem 2 – avg. dist. to vertex s) Summary * Let f be a “natural” function defined on graphs. The domain of f : vertices/pairs of vertices/etc. The goal: Estimate the average value of f . The means:(1) Queries to f ;(2) Queries to the graph: a. Neighbor queries (who is j’th neighbor of v?) b. Vertex-pair queries (are u and v neighbors?) Questions of interest: (1) Can we do this much more efficiently as compared to general functions? (2) How do different queries influence the complexity? Problem1: Estimating the average degree in a graph (first considered by Feige (STOC04)) Problem2: Estimating the average distance  to a given vertex in a graph Problem3: Estimating the average distance  between pairs of vertices in a graph deg(v) distv(u) dist(u,v) Problem1: Estimating average degree in a (simple) graph G=(V,E) , |V|=n, |E|=m, dG=2m/n deg(v) UB: Can obtain (1+?)-approximation in time n1/2 poly(log n / ?)by using neighbor queries (only). LB: A (1+?)-approximation requires ?((n / ?)1/2) queries (when allowed all types of queries). Compare to Feige: (2+?)-approx in similar complexity using degree queries only (queries to f ); (2-o(1))-approx requires ?(n) degree queries. Note: Can improve when avg degree is high: (n/dG)1/2 instead of n1/2 with matching lower bound. Problem2: Estimating the average distance to a vertexProblem3: Estimating the average distance between