Algorithms for Random Generation and Counting: A Markov Chain Approach

Name: Algorithms for Random Generation and Counting: A Markov Chain Approach
Brand: Springer, Basel
SKU: 9780817636586
Price: 2286 CZK
Availability: InStock

A Markov Chain Approach

Autor: A. Sinclair

Jazyk:

Vazba: Pevná

Vydavatel: Springer, Basel

Dostupnost: Skladem u dodavatele

Odesíláme za 10-13 dnů

2 286 Kč

This monograph is a slightly revised version of my PhD thesis [86], com pleted in the Department of...

Informace o knize

Autor

A. Sinclair

Jazyk

Angličtina

Vazba

Kniha - Pevná

Vydáno

1993

Stránek

147

EAN

9780817636586

ISBN

0817636587

Enbook ID

01399015

Vydavatel

Springer, Basel

Hmotnost

408

Rozměry

156 x 234 x 11

Kompletní popis

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.

Mohlo by vás zajímat

Zákaznicí kteří koupili tuto knihu koupili také

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Algorithms for Random Generation and Counting: A Markov Chain Approach

A Markov Chain Approach

Informace o knize

Kompletní popis

Mohlo by vás zajímat

Zákaznicí kteří koupili tuto knihu koupili také