Approximate counting, uniform generation and rapidly mixing markov chains extended abstract

  • Alistair Sinclair
  • Mark Jerrum
Randomness And Chaos
Part of the Lecture Notes in Computer Science book series (LNCS, volume 314)


Markov Chain Polynomial Time Problem Instance Regular Graph Degree Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Aldous, D. Random walks on finite groups and rapidly mixing Markov chains. Séminaire de Probabilités XVII, 1981/82, Springer Lecture Notes in Mathematics 986, pp. 243–297Google Scholar
  2. [2]
    Aldous, D. and Diaconis, P. Shuffling cards and stopping times. American Mathematical Monthly 93 (1986), pp. 333–348Google Scholar
  3. [3]
    Alon, N. Eigenvalues and expanders. Combinatorica 6 (2) (1986), pp. 83–96Google Scholar
  4. [4]
    Alon, N. and Milman, V.D. λ1, isoperimetric inequalities for graphs and superconcentrators. Journal of Combinatorial Theory Series B 38 (1985), pp. 73–88CrossRefGoogle Scholar
  5. [5]
    Bollobás, B., Random Graphs (Academic Press, London, 1985)Google Scholar
  6. [6]
    Broder, A.Z. How hard is it to marry at random? (On the approximation of the permanent). Proc. 18th ACM Symposium on Theory of Computing, 1986, pp. 50–58Google Scholar
  7. [7]
    Cheeger, J. A lower bound for the smallest eigenvalue of the Laplacian. In Problems in Analysis (R. C. Gunning ed.) Princeton University Press, 1970, pp. 195–199Google Scholar
  8. [8]
    Dixon, J.D. and Wilf, H.S. The random selection of unlabelled graphs. Journal of Algorithms 4 (1983), pp. 205–213CrossRefGoogle Scholar
  9. [9]
    Feller, W. An introduction to probability theory and its applications, Volume I (3rd ed.) (John Wiley, New York, 1968)Google Scholar
  10. [10]
    Jerrum, M.R., Valiant, L.G. and Vazirani, V.V. Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science 43 (1986), pp. 169–188CrossRefGoogle Scholar
  11. [11]
    Jerrum, M.R. and Sinclair, A.J. Conductance and the rapid mixing property for Markov chains. Proc. 20th ACM Symposium on Theory of Computing (1988), to appearGoogle Scholar
  12. [12]
    Karp, R.M. and Luby, M. Monte-Carlo algorithms for enumeration and reliability problems. Proc. 24th IEEE Symposium on Foundations of Computer Science, 1983, pp. 56–64Google Scholar
  13. [13]
    Keilson, J. Markov chain models — rarity and exponentiality (Springer-Verlag, New York, 1979)Google Scholar
  14. [14]
    McKay, B.D. Asymptotics for symmetric 0–1 matrices with prescribed row sums. Ars Combinatoria 19A (1985), pp. 15–25Google Scholar
  15. [15]
    Nijenhuis, A. and Wilf, H.S. Combinatorial Algorithms (2nd ed.) (Academic Press, Orlando, 1978)Google Scholar
  16. [16]
    Schnorr, C.P. Optimal algorithms for self-reducible problems. Proc. 3rd International Colloquium on Automata, Languages and Programming, 1976, pp. 322–337Google Scholar
  17. [17]
    Sinclair, A.J. PhD Thesis, University of Edinburgh (in preparation)Google Scholar
  18. [18]
    Sinclair, A.J. and Jerrum, M.R. Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains Internal Report CSR-241-87, Dept. of Computer Science, University of Edinburgh (submitted to Information and Computation)Google Scholar
  19. [19]
    Stockmeyer, L. The complexity of approximate counting. Proc. 15th ACM Symposium on Theory of Computing, 1983, pp. 118–126Google Scholar
  20. [20]
    Tinhofer, G. On the generation of random graphs with given properties and known distribution. Appl. Comput. Sci. 13 (1979), pp. 265–297Google Scholar
  21. [21]
    Valiant, L.G. The complexity of computing the permanent. Theoretical Computer Science 8 (1979), pp. 189–201CrossRefGoogle Scholar
  22. [22]
    Wilf, H.S. The uniform selection of free trees. Journal of Algorithms 2 (1981), pp. 204–207CrossRefGoogle Scholar
  23. [23]
    Wormald, N.C. Generating random regular graphs. Journal of Algorithms 5 (1984), pp. 247–280CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Alistair Sinclair
    • 1
  • Mark Jerrum
    • 1
  1. 1.Department of Computer ScienceUniversity of EdinburghEdinburghScotland

Personalised recommendations