Approximating the statistics of various properties in randomly weighted graphs

Authors:
Yuval Emek;Amos Korman;Yuval Shavitt
Affiliations:
Microsoft Israel R&D Center, Herzliya, Israel;CNRS and Université Paris Diderot - Paris, France;Tel Aviv University, Tel Aviv, Israel
Venue:
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Year:
2011

Citing 20
Cited 0

On Frieze's &zgr;(3) limit for lengths of minimal spanning trees

Discrete Applied Mathematics
Approximations for the random minimal spanning tree with application to network provisioning

Operations Research
Monte-Carlo approximation algorithms for enumeration problems

Journal of Algorithms
Finding the hidden path: time bounds for all-pairs shortest paths

SIAM Journal on Computing
A new approach to the minimum cut problem

Journal of the ACM (JACM)
Algorithmic theory of random graphs

Random Structures & Algorithms - Special issue: average-case analysis of algorithms
A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem

SIAM Journal on Computing
Average-case complexity of shortest-paths problems in the vertex-potential model

Random Structures & Algorithms
Graph Algorithms

Graph Algorithms
Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract)

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
A delay-tolerant network architecture for challenged internets

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights

Combinatorics, Probability and Computing
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
A survey of practical issues in underwater networks

ACM SIGMOBILE Mobile Computing and Communications Review
Inapproximability of the Tutte polynomial

Information and Computation
On the minimum diameter spanning tree problem

Information Processing Letters
A measurement study of the origins of end-to-end delay variations

PAM'10 Proceedings of the 11th international conference on Passive and active measurement
Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case

Random Structures & Algorithms
Delay-tolerant networking: an approach to interplanetary Internet

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

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.