0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Probability & statistics

Buy Now

Algorithms for Random Generation and Counting: A Markov Chain Approach (Hardcover, 1993 ed.) Loot Price: R2,961
Discovery Miles 29 610
Algorithms for Random Generation and Counting: A Markov Chain Approach (Hardcover, 1993 ed.): A. Sinclair

Algorithms for Random Generation and Counting: A Markov Chain Approach (Hardcover, 1993 ed.)

A. Sinclair

Series: Progress in Theoretical Computer Science

 (sign in to rate)
Loot Price R2,961 Discovery Miles 29 610 | Repayment Terms: R277 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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.

General

Imprint: Birkhauser Boston
Country of origin: United States
Series: Progress in Theoretical Computer Science
Release date: February 1993
First published: 1993
Authors: A. Sinclair
Dimensions: 235 x 155 x 11mm (L x W x T)
Format: Hardcover
Pages: 147
Edition: 1993 ed.
ISBN-13: 978-0-8176-3658-6
Categories: Books > Science & Mathematics > Mathematics > Probability & statistics
Books > Computing & IT > General theory of computing > Mathematical theory of computation
Promotions
LSN: 0-8176-3658-7
Barcode: 9780817636586

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Statistics For Business And Economics
David Anderson, James Cochran, … Paperback  (1)
R1,305 Discovery Miles 13 050
Applied Business Statistics - Methods…
Trevor Wegner Paperback R951 Discovery Miles 9 510
Basic mathematics for economics students…
Derek Yu Paperback R383 Discovery Miles 3 830
Numbers, Hypotheses & Conclusions - A…
Colin Tredoux, Kevin Durrheim Paperback R969 R856 Discovery Miles 8 560
Time Series Analysis - With Applications…
Jonathan D. Cryer, Kung-Sik Chan Hardcover R2,636 Discovery Miles 26 360
Mathematical Statistics with…
William Mendenhall, Dennis Wackerly, … Paperback R1,345 R1,252 Discovery Miles 12 520
Counterfactuals and Probability
Moritz Schulz Hardcover R2,854 Discovery Miles 28 540
Probability - An Introduction
Geoffrey Grimmett, Dominic Welsh Hardcover R4,206 Discovery Miles 42 060
BI Statistical Methods - Volume I…
Peter Walley Hardcover R2,721 Discovery Miles 27 210
Advances in Quantum Monte Carlo
Shigenori Tanaka, Stuart M. Rothstein, … Hardcover R5,584 Discovery Miles 55 840
The Oxford Handbook of Functional Data…
Frederic Ferraty, Yves Romain Hardcover R4,606 Discovery Miles 46 060
Pearson Edexcel AS and A level…
Paperback  (1)
R279 Discovery Miles 2 790

See more

Partners