Fast Discovery of Reliable Subnetworks

We present a novel and efficient algorithm, Path Covering, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity between two given individuals in a social network. Formally, the given network is seen as a Bernoulli random graph G, and the objective is to find a subgraph H with at most B edges such that the probability that a path exists in H between the given two individuals is maximized. The algorithm is based on an efficient stochastic search of candidate paths, and the use of Monte-Carlo simulation to cast the problem as a set cover problem. Experimental evaluation on real graphs derived from DBLP bibliography database indicates superior performance of the proposed algorithm.

[1]  Appajosyula Satyanarayana,et al.  A survey of some network reliability analysis and synthesis results , 2009, Networks.

[2]  Luc De Raedt,et al.  Compressing probabilistic Prolog programs , 2007, Machine Learning.

[3]  Rong-Hong Jan.  Design of reliable networks , 1993, Comput. Oper. Res..

[4]  Christos Faloutsos,et al.  Fast discovery of connection subgraphs , 2004, KDD.

[5]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[6]  Yehuda Koren,et al.  Measuring and extracting proximity graphs in networks , 2007, TKDD.

[7]  David F. McAllister,et al.  Reliability optimization of computer-communication networks , 1988 .

[8]  Hannu Toivonen,et al.  Finding reliable subgraphs from large probabilistic graphs , 2008, Data Mining and Knowledge Discovery.

[9]  Petteri Hintsanen.  The Most Reliable Subgraph Problem , 2007, PKDD.

[10]  Christos Faloutsos,et al.  Center-piece subgraphs: problem definition and fast solutions , 2006, KDD '06.

[11]  Dirk P. Kroese,et al.  Network Reliability Optimization via the Cross-Entropy Method , 2007, IEEE Transactions on Reliability.

[12]  Hannu Toivonen,et al.  Link Discovery in Graphs Derived from Biological Databases , 2006, DILS.

[13]  Richard M. Karp,et al.  Monte-Carlo Approximation Algorithms for Enumeration Problems , 1989, J. Algorithms.

[14]  Yehuda Koren,et al.  Measuring and extracting proximity in networks , 2006, KDD '06.

[15]  George S. Fishman.  A Comparison of Four Monte Carlo Methods for Estimating the Probability of s-t Connectedness , 1986, IEEE Transactions on Reliability.

[16]  Hannu Toivonen,et al.  Fast Discovery of Reliable k-terminal Subgraphs , 2010, PAKDD.

[17]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..