Approximate counting, uniform generation and rapidly mixing Markov chains

Information and Computation

Volumn 82, Issue 1, 1989, Pages 93-133

  Sinclair, Alistair ^a   Jerrum, Mark ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY--COMPUTABILITY AND DECIDABILITY; MATHEMATICAL TECHNIQUES--COMBINATORIAL MATHEMATICS;

APPROXIMATE SOLUTIONS; MARKOV CHAINS;

PROBABILITY;

EID: 0024699930     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/0890-5401(89)90067-9     Document Type: Article

References (38)

1. Random walks on finite groups and rapidly mixing Markov chains
2. On the Markov chain simulation method for uniform combinatorial distributions and simulated annealing
3. Shuffling cards and stopping times
4. Strong uniform times and finite random walks
5. Eigenvalues and expanders
6. 1, isoperimetric inequalities for graphs and superconcentrators
7. How to generate random integers with known factorisation
8. Monte Carlo investigations of phase transitions and critical phenomena
9. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
10. How hard is it to marry at random? (On the approximation of the permanent)
11. A lower bound for the smallest eigenvalue of the Laplacian
12. Difference equations isoperimetric inequality and transience of certain random walks
13. Computational complexity of probabilistic Turing machines
14. Random spanning tree
15. Conductance and the rapid mixing property for Markov chains: The approximation of the permanent resolved
16. Random generation of combinatorial structures from a uniform distribution
17. Monte-Carlo algorithms for enumeration and reliability problems
18. Optimisation by simulated annealing
19. 2 spectrum for Markov chains and Markov processes: A generalization of Cheeger's inequality
20. Asymptotics for symmetric 0–1 matrices with prescribed row sums
21. Optimal algorithms for self-reducible problems
22. Randomised Algorithms for Counting and Generating Combinatorial Structures
23. The polynomial-time hierarchy
24. The complexity of approximate counting
25. On the generation of random graphs with given properties and known distribution
26. The complexity of computing the permanent
27. The complexity of enumeration and reliability problems
28. The uniform selection of free trees
29. Generating random regular graphs
30. Generating random unlabelled graphs