arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.03158cs.DScs.DB
收藏

不确定图中网络可靠性的有效计算

Efficient Network Reliability Computation in Uncertain Graphs

Yuya Sasaki, Yasuhiro Fujiwara, Makoto Onizuka

摘要:

网络可靠性是评价不确定图中给定顶点之间连通性的重要度量。由于网络可靠性问题被称为P-完全问题,现有的研究都使用了近似技术。在本文中,我们提出了一种新的基于采样的方法,有效地和准确地近似网络的可靠性。我们的方法通过减少基于分层抽样的样本数量来提高效率。我们从理论上保证,我们的方法通过使用网络可靠性的上下界来提高近似的准确性,即使它减少了样本的数量。为了有效地计算边界,我们开发了一个扩展的BDD,称为S2 BDD。在构建S2 BDD的过程中,我们的方法采用了动态规划,以有效地采样可能的图形。我们对真实数据集的实验表明,我们的方法比现有的基于采样的方法快51.2倍,具有更高的准确性。

英文摘要:

Network reliability is an important metric to evaluate the connectivity among given vertices in uncertain graphs. Since the network reliability problem is known as #P-complete, existing studies have used approximation techniques. In this paper, we propose a new sampling-based approach that efficiently and accurately approximates network reliability. Our approach improves efficiency by reducing the number of samples based on stratified sampling. We theoretically guarantee that our approach improves the accuracy of approximation by using lower and upper bounds of network reliability, even though it reduces the number of samples. To efficiently compute the bounds, we develop an extended BDD, called S2BDD. During constructing the S2BDD, our approach employs dynamic programming for efficiently sampling possible graphs. Our experiment with real datasets demonstrates that our approach is up to 51.2 times faster than the existing sampling-based approach with higher accuracy.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑