Randomized Algorithms: Approximation, Generation, and Counting

This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.

Randomized Algorithms discusses two problems of fine pedigree: counting and generation, both of which are of fundamental importance to discrete mathematics and probability. When asking questions like How many are there? and What does it look like on average? of families of combinatorial structures, answers are often difficult to find – we can be blocked by seemingly intractable algorithms. Randomized Algorithms shows how to get around the problem of intractability with the Markov chain Monte Carlo method, as well as highlighting the method’s natural limits. It uses the technique of coupling before introducing path coupling a new technique which radically simplifies and improves upon previous methods in the area.