Approximating average parameters of graphs

Oded Goldreich, Dana Ron*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average degree of a graph and the average distance between pairs of vertices in a graph. Since our focus is on sublinear algorithms, these algorithms access the input graph via queries to an adequate oracle. We consider two types of queries. The first type is standard neighborhood queries (i.e., what is the ith neighbor of vertex v?), whereas the second type are queries regarding the quantities that we need to find the average of (i.e., what is the degree of vertex v? and what is the distance between u and v?, respectively). Loosely speaking, our results indicate a difference between the two problems: For approximating the average degree, the standard neighbor queries suffice and in fact are preferable to degree queries. In contrast, for approximating average distances, the standard neighbor queries are of little help whereas distance queries are crucial.

Original languageEnglish
Pages (from-to)473-493
Number of pages21
JournalRandom Structures and Algorithms
Volume32
Issue number4
DOIs
StatePublished - Jul 2008

Keywords

  • Randomized approximation algorithms
  • Sublinear-time algorithms
  • Wiener index

Fingerprint

Dive into the research topics of 'Approximating average parameters of graphs'. Together they form a unique fingerprint.

Cite this