Algorithms for Random Generation and Counting: A Markov Chain Approach

1993/01/01 by Alistair Sinclair · 389 citations
Computer Science · #Bayesian Methods and Mixture Models #Data Management and Algorithms #Algorithms and Data Compression #Markov chain #Computer science #Chain (unit) #Artificial intelligence #Machine learning #Physics

paper · doi:10.1007/978-1-4612-0323-0

published in Birkhäuser Boston eBooks

openalex publication_date 1993/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Abstract

This monograph is a slightly revised version of my PhD thesis [86], com pleted in the Department of Computer Science at the University of Edin burgh in June 1988, with an additional chapter summarisin

Cited by

• A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs
• Utilizing Network Structure to Accelerate Markov Chain Monte Carlo Algorithms
• Markov chain mixing time [wikipedia]