A polynomial-time approximation algorithm for all-terminal network reliability (Heng Guo)

Abstract

All-terminal network reliability is the probability that, in a undirected graph, assuming each edge fails independently, the remaining graph is still connected. We will present a fully polynomial-time randomised approximation scheme (FPRAS) for this problem. Our main contribution is to confirm a conjecture by Gorodezky and Pak (Random Struct. Algorithms, 2014), that the expected running time of the “cluster-popping” algorithm in bi-directed graphs is bounded by a polynomial in the size of the input.

Joint work with Mark Jerrum (QMUL).

Time

2018-06-01   14:00 ~ 15:00   

Speaker

Heng Guo, University of Edinburgh

Room

Room 602, School of Information Management & Engineering, Shanghai University of Finance & Economics