menu

0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional
portada Algorithms for Random Generation and Counting: A Markov Chain Approach (in English)
Type
Physical Book
Publisher
Language
Inglés
Pages
147
Format
Paperback
Dimensions
23.4 x 15.6 x 0.9 cm
Weight
0.23 kg.
ISBN13
9781461267072

Algorithms for Random Generation and Counting: A Markov Chain Approach (in English)

A. Sinclair (Author) · Birkhauser · Paperback

Algorithms for Random Generation and Counting: A Markov Chain Approach (in English) - Sinclair, A.

Physical Book

$ 104.20

$ 109.99

You save: $ 5.79

5% discount
  • Condition: New
It will be shipped from our warehouse between Friday, June 21 and Monday, June 24.
You will receive it anywhere in United States between 1 and 3 business days after shipment.

Synopsis "Algorithms for Random Generation and Counting: A Markov Chain Approach (in English)"

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.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews