Description: Algorithms for Random Generation and Counting : A Markov Chain Approach, Paperback by Sinclair, Alistair, ISBN 1461267072, ISBN-13 9781461267072, Brand New, Free shipping in the US 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.
Price: 124.9 USD
Location: Jessup, Maryland
End Time: 2024-10-26T11:53:35.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Restocking Fee: No
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 14 Days
Refund will be given as: Money Back
Book Title: Algorithms for Random Generation and Counting : A Markov Chain Ap
Number of Pages: VIII, 147 Pages
Language: English
Publication Name: Algorithms for Random Generation and Counting: a Markov Chain Approach : a Markov Chain Approach
Publisher: Birkhäuser Boston
Subject: Programming / Algorithms, Probability & Statistics / Stochastic Processes, Probability & Statistics / General, Algebra / General, Set Theory, Applied
Item Height: 0.1 in
Publication Year: 2012
Type: Textbook
Item Weight: 9 Oz
Item Length: 9.3 in
Author: A. Sinclair
Subject Area: Mathematics, Computers
Series: Progress in Theoretical Computer Science Ser.
Item Width: 6.1 in
Format: Trade Paperback
