Location of Repository

Approximating the Statistics of various Properties in Randomly Weighted Graphs

By Yuval Emek, Amos Korman and Yuval Shavitt


Consider the setting of randomly weighted graphs, namely, graphs whose edge weights are chosen independently according to probability distributions with finite support over the non-negative reals. Under this setting, weighted graph properties such as the diameter, theradius (with respect to a designated vertex), and the weight of a minimum spanning tree become random variables and we are interested in computing their expectation. Unfortunately, this turns out to be #P-hard. In this paper, we define a family of weighted graph properties (that includes the above three) and show that for each property in this family, the problem of computing the k th moment (and in particular, the expectation) of the corresponding random variable admits a fully polynomial-time randomized approximation scheme (FPRAS) for every fixed k.

Year: 2011
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.siam.org/proceeding... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.