Rare Event Simulation and Counting Problems

[1]  Eli Upfal,et al.  Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .

[2]  Dmitriy Katz,et al.  Correlation decay and deterministic FPTAS for counting list-colorings of a graph , 2007, SODA '07.

[3]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[4]  J. Blanchet.  Efficient importance sampling for binary contingency tables , 2009, 0908.0999.

[5]  Eric Vigoda,et al.  Sampling binary contingency tables with a greedy start , 2007 .

[6]  Mark Jerrum,et al.  The Markov chain Monte Carlo method: an approach to approximate counting and integration , 1996 .

[7]  Alistair Sinclair,et al.  Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow , 1992, Combinatorics, Probability and Computing.

[8]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.

[9]  Martin E. Dyer,et al.  An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings , 2001, SIAM J. Comput..

[10]  P. Diaconis,et al.  Geometric Bounds for Eigenvalues of Markov Chains , 1991 .

[11]  M. Jerrum.  Counting, Sampling and Integrating: Algorithms and Complexity , 2003 .

[12]  M. Simonovits,et al.  Random walks and an O * ( n 5 ) volume algorithm for convex bodies , 1997 .

[13]  Prasad Tetali,et al.  Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract) , 1999, SODA.

[14]  Eric Vigoda,et al.  Approximately counting up to four (extended abstract) , 1997, STOC '97.

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

[16]  Yuguo Chen,et al.  Sequential Monte Carlo Methods for Statistical Analysis of Tables , 2005 .

[17]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[18]  Amin Saberi,et al.  A Sequential Algorithm for Generating Random Graphs , 2007, APPROX-RANDOM.

[19]  Eric Vigoda,et al.  Negative Examples for Sequential Importance Sampling of Binary Contingency Tables , 2006, ESA.

[20]  Dirk P. Kroese,et al.  The Cross-Entropy Method , 2011, Information Science and Statistics.

[21]  Jun S. Liu,et al.  Weighted finite population sampling to maximize entropy , 1994 .

[22]  Brendan D. McKay,et al.  Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums , 2006, J. Comb. Theory, Ser. A.

[23]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..