Estimating the Number of s-t Paths in a Graph

The problem of counting the number of s-t paths in a graph is #Pcomplete. We provide an algorithm to estimate the solution stochastically, using sequential importance sampling. We show that the method works effectively for both graphs and digraphs. We also use the method to investigate the expected number of s-t paths in a random graph of size n and density d, and develop a model that shows how this quantity behaves when n and d are varied.

[1]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[2]  P. A. Androsenko,et al.  Modification of the monte carlo method for calculating the local characteristics of a radiation flux , 1978 .

[3]  Donald L. Iglehart,et al.  Importance sampling for stochastic simulations , 1989 .

[4]  Michel Dubois-Violette.  $d^N=0$ , 1997 .

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

[6]  J. Hammersley,et al.  Poor Man's Monte Carlo , 1954 .

[7]  A. W. Rosenbluth,et al.  MONTE CARLO CALCULATION OF THE AVERAGE EXTENSION OF MOLECULAR CHAINS , 1955 .

[8]  M. Newman,et al.  Fast Approximation Algorithms for Finding Node-Independent Paths in Networks , 2001 .

[9]  Dirk P. Kroese,et al.  The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning , 2004 .

[10]  Martin E. Dyer,et al.  Approximately Counting Hamilton Paths and Cycles in Dense Graphs , 1998, SIAM J. Comput..

[11]  D. Welsh.  Complexity: Knots, Colourings and Counting: Link polynomials and the Tait conjectures , 1993 .

[12]  Jun S. Liu,et al.  Monte Carlo strategies in scientific computing , 2001 .

[13]  M. Piccioni,et al.  Importance sampling for families of distributions , 1999 .

[14]  Nando de Freitas,et al.  Sequential Monte Carlo Methods in Practice , 2001, Statistics for Engineering and Information Science.

[15]  D. Siegmund.  Importance Sampling in the Monte Carlo Study of Sequential Tests , 1976 .

[16]  Jun S. Liu,et al.  Sequential Monte Carlo methods for dynamic systems , 1997 .

[17]  Reuven Y. Rubinstein.  How Many Needles are in a Haystack, or How to Solve #P-Complete Counting Problems Fast , 2006 .

[18]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[19]  Christian P. Robert,et al.  Monte Carlo Statistical Methods , 2005, Springer Texts in Statistics.