论文信息 - On counting independent sets in sparse graphs

On counting independent sets in sparse graphs

We prove two results concerning approximate counting of independent sets in graphs with constant maximum degree /spl Delta/. The first result implies that the Monte-Carlo Markov chain technique is likely to fail if /spl Delta//spl ges/6. The second shows that no fully polynomial randomized approximation scheme can exist for /spl Delta//spl ges/25, unless P=NP under randomized reductions.

[1] Edward A. Bender,et al. The asymptotic number of non-negative integer matrices with given row and column sums , 1974, Discret. Math..

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

[3] Mark Jerrum,et al. Large Cliques Elude the Metropolis Process , 1992, Random Struct. Algorithms.

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

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

[6] Johan Håstad,et al. Some optimal inapproximability results , 1997, STOC '97.

[7] Marek Karpinski,et al. On Some Tighter Inapproximability Results, Further Improvements , 1998, Electron. Colloquium Comput. Complex..

[8] P. Berman,et al. On Some Tighter Inapproximability Results , 1998, Electron. Colloquium Comput. Complex..

[9] Graham R. Brightwell,et al. Graph Homomorphisms and Phase Transitions , 1999, J. Comb. Theory, Ser. B.

[10] Martin E. Dyer,et al. On Markov Chains for Independent Sets , 2000, J. Algorithms.