A Fast and Simple Unbiased Estimator for Network (Un)reliability

@article{Karger2016AFA,
title={A Fast and Simple Unbiased Estimator for Network (Un)reliability},
author={David R. Karger},
journal={2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)},
year={2016},
pages={635-644}
}

The following procedure yields an unbiased estimator for the disconnection probability of an n-vertex graph with minimum cut c if every edge fails independently with probability p: (i) contract every edge independently with probability 1- n-2/c, then (ii) recursively compute the disconnection probability of the resulting tiny graph if each edge fails with probability n2/cp. We give a short, simple, self-contained proof that this estimator can be computed in linear time and has relative varianceâ€¦Â CONTINUE READING