Share  Bookmark

 Download from



[1] N. Alon, A. Frieze, and D. J. A. Welsh, Polynomial time randomised approximation schemes for TutteGrothendieck invariants: the dense case, Random Structures and Algorithms 6 (1995), 459478.
[2] B. Bollob´as, A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, European Journal of Combinatorics 1 (1980), 311316.
[3] C. Borgs, J. T. Chayes, J. H. Kim, A. Frieze, P. Tetali, E. Vigoda and V. H. Vu, Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics, In 40th Annual Symposium on Foundations of Computer Science, IEEE, New York, 1999, pp. 218229.
[4] R. Bubley and M. Dyer, Path coupling: a technique for proving rapid mixing in Markov chains. In 38th Annual Symposium on Foundations of Computer Science, IEEE, Los Alimitos, 1997, pp. 223231.
[5] C. Choua, and S. Lib, Spin systems and Political Districting Problem, Journal of Magnetism and Magnetic Materials 310:23 (2007), 28892891.
[6] M. Dyer, L. Goldberg, C. Greenhill, and M. Jerrum, On the relative complexity of approximate counting problems, Algorithmica 38:3 (2003), 471500.
[7] M. Dyer, L.A. Goldberg, M. Jerrum and R. Martin, Markov chain comparison, Probability Surveys 3 (2006), 89111.
[8] M. Dyer and C. Greenhill, A more rapidly mixing Markov chain for graph colourings, Random Structures and Algorithms 13 (1998), 285317.
[9] H. Finner, A generalisation of H¨older's inequality and some probability inequalities, The Annals of Probability 20 (1992), 18931901.
[15] T. Hayes, A simple condition implying rapid mixing of singlesite dynamics on spin systems, In 47th Annual Symposium on Foundations of Computer Science, IEEE, Berkeley, California, 2006, pp.3946.