Approximating the statistics of various properties in randomly weighted graphs

Yuval Emek, Amos Korman, Yuval Shavitt

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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, the radius (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 kth moment (and in particular, the expectation) of the corresponding random variable admits a fully polynomial-time randomized approximation scheme (FPRAS) for every fixed k.

Original languageEnglish
Title of host publicationProceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011
PublisherAssociation for Computing Machinery
Pages1455-1467
Number of pages13
ISBN (Print)9780898719932
DOIs
StatePublished - 2011

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Fingerprint

Dive into the research topics of 'Approximating the statistics of various properties in randomly weighted graphs'. Together they form a unique fingerprint.

Cite this