Skip to main content
SpringerLink
Log in
Birkhäuser
Book cover

Algorithms for Random Generation and Counting: A Markov Chain Approach

  • Book
  • © 1993

Overview

Authors:
  1. Alistair Sinclair

    1. Department of Computer Science, University of Edinburgh, Edinburgh, Scotland

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Progress in Theoretical Computer Science (PTCS)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (5 chapters)

  1. Front Matter

    Pages i-viii
    Download chapter PDF

  2. Synopsis

    • Alistair Sinclair
    Pages 1-6

  3. Preliminaries

    • Alistair Sinclair
    Pages 7-41

  4. Markov chains and rapid mixing

    • Alistair Sinclair
    Pages 42-62

  5. Direct Applications

    • Alistair Sinclair
    Pages 63-100

  6. Indirect Applications

    • Alistair Sinclair
    Pages 101-125

  7. Back Matter

    Pages 126-147
    Download chapter PDF
Back to top

Keywords

About this book

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 summarising more recent developments. Some of the material has appeared in the form of papers [50,88]. The underlying theme of the monograph is the study of two classical problems: counting the elements of a finite set of combinatorial structures, and generating them uniformly at random. In their exact form, these prob­ lems appear to be intractable for many important structures, so interest has focused on finding efficient randomised algorithms that solve them ap­ proxim~ly, with a small probability of error. For most natural structures the two problems are intimately connected at this level of approximation, so it is natural to study them together. At the heart of the monograph is a single algorithmic paradigm: sim­ ulate a Markov chain whose states are combinatorial structures and which converges to a known probability distribution over them. This technique has applications not only in combinatorial counting and generation, but also in several other areas such as statistical physics and combinatorial optimi­ sation. The efficiency of the technique in any application depends crucially on the rate of convergence of the Markov chain.

Authors and Affiliations

  • Department of Computer Science, University of Edinburgh, Edinburgh, Scotland

    Alistair Sinclair

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation