 |
|
|
Item Details
| Title:
|
ALGORITHMS FOR RANDOM GENERATION AND COUNTING: A MARKOV CHAIN APPROACH
|
| By: |
A. Sinclair |
| Format: |
Paperback |
| List price:
|
£112.50 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
1461267072 |
| ISBN 13: |
9781461267072 |
| Publisher: |
SPRINGER-VERLAG NEW YORK INC. |
| Pub. date: |
1 November, 2012 |
| Edition: |
Softcover reprint of the original 1st ed. 1993 |
| Series: |
Progress in Theoretical Computer Science |
| Pages: |
147 |
| Synopsis: |
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. |
| Illustrations: |
biography |
| Publication: |
US |
| Imprint: |
Springer-Verlag New York Inc. |
| Returns: |
Returnable |
|
|
|
 |
|
|
|
|
|
No Cheese, Please!
A fun picture book for children with food allergies - full of friendship and super-cute characters!Little Mo the mouse is having a birthday party.
|
My Brother Is a Superhero
Luke is massively annoyed about this, but when Zack is kidnapped by his arch-nemesis, Luke and his friends have only five days to find him and save the world...
|
|
|
|
|