1. N. Alon, R. Boppana and J. Spencer, An asymptotic isoperimetric inequality, Geometric and Functional Analysis 8 (1998), 411–436.
2. A. Barvinok, Approximate counting via random optimization, Random Structures & Algorithms 11 (1997), 187–198.
3. A. Barvinok and A. Samorodnitsky, The distance approach to approximate combinatorial counting, Geometric and Functional Analysis 11 (2001), 871–899.
4. G. R. Grimmett and D. R. Stirzaker, Probability and Random Processes, Third edition, The Clarendon Press, Oxford University Press, New York, 2001.
5. M. Jerrum and A. Sinclair, The Markov chain Monte Carlo method: an approach to approximate counting and integration, in Approximation Algorithms for NP-hard Problems (D. S. Hochbaum, ed.), PWS, Boston, 1997, pp. 483–520.