Title
Algorithms For Random Generation And Counting: A Markov Chain Approach (Progress In Theoretical Computer Science),Used
Processing time: 1-3 days
US Orders Ships in: 3-5 days
International Orders Ships in: 8-12 days
Return Policy: 15-days return on defective items
Payment Option
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.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.
- Q: What is the main focus of 'Algorithms for Random Generation and Counting'? A: The book primarily focuses on the study of two classical problems: counting elements of finite combinatorial structures and generating them uniformly at random.
- Q: Who is the author of this book? A: The author of 'Algorithms for Random Generation and Counting' is A. Sinclair.
- Q: What is the condition of the book? A: The book is listed in new condition.
- Q: How many pages does the book have? A: The book contains 155 pages.
- Q: What type of binding does this book have? A: The book is bound in hardcover.
- Q: When was 'Algorithms for Random Generation and Counting' published? A: The book was published on February 1, 1993.
- Q: Is this book suitable for beginners in computer science? A: This book may be more suitable for readers with some background in computer science due to its focus on advanced topics like Markov chains and combinatorial problems.
- Q: What topics are covered in the additional chapter of the book? A: The additional chapter summarizes more recent developments in the field related to the main themes of the book.
- Q: Does this book include practical applications of the algorithms discussed? A: Yes, the book discusses practical applications of the algorithms in areas such as statistical physics and combinatorial optimization.
- Q: Is this book a revised version of a thesis? A: Yes, it is a slightly revised version of the author's PhD thesis completed at the University of Edinburgh.