Randomized Algorithms: Approximation, Generation and Counting

✍ Scribed by Russ Bubley MA, PhD (auth.)

• Publisher: Springer-Verlag London
• Year: 2001
• Tongue: English
• Leaves: 153
• Series: Distinguished Dissertations
• Edition: 1
• Category: Library

✦ Synopsis

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.

✦ Table of Contents

Front Matter....Pages i-xix
Mathematical Background....Pages 1-11
Techniques for Sampling and Approximate Sampling....Pages 13-28
Approximate Counting....Pages 29-36
Applications: Coupling....Pages 37-82
Intermezzo....Pages 83-90
Applications: Path Coupling....Pages 91-118
Directions for Future Work....Pages 119-124
Back Matter....Pages 139-152

✦ Subjects

Algorithm Analysis and Problem Complexity; Math Applications in Computer Science; Symbolic and Algebraic Manipulation; Probability Theory and Stochastic Processes; Combinatorics