Algorithms for Random Generation and Counting: A Markov Chain Approach
- Indbinding:
- Hardback
- Sideantal:
- 160
- Udgivet:
- 1. februar 1993
- Størrelse:
- 160x14x241 mm.
- Vægt:
- 412 g.
- 8-11 hverdage.
- 20. november 2024
På lager
Normalpris
Abonnementspris
- Rabat på køb af fysiske bøger
- 1 valgfrit digitalt ugeblad
- 20 timers lytning og læsning
- Adgang til 70.000+ titler
- Ingen binding
Abonnementet koster 75 kr./md.
Ingen binding og kan opsiges når som helst.
- 1 valgfrit digitalt ugeblad
- 20 timers lytning og læsning
- Adgang til 70.000+ titler
- Ingen binding
Abonnementet koster 75 kr./md.
Ingen binding og kan opsiges når som helst.
Beskrivelse af Algorithms for Random Generation and Counting: A Markov Chain Approach
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.
Brugerbedømmelser af Algorithms for Random Generation and Counting: A Markov Chain Approach
Giv din bedømmelse
For at bedømme denne bog, skal du være logget ind.Andre købte også..
Find lignende bøger
Bogen Algorithms for Random Generation and Counting: A Markov Chain Approach findes i følgende kategorier:
- Business og læring > Computer og IT
- Matematik og naturvidenskab > Matematik > Regning og matematisk analyse > Numerisk analyse
- Matematik og naturvidenskab > Matematik > Sandsynlighedsregning og statistik
- Matematik og naturvidenskab > Matematik > Anvendt matematik > Stokastik
- Databehandling og informationsteknologi > Programmering / softwareudvikling > Algoritmer og datastrukturer
- Databehandling og informationsteknologi > Informatik > Matematisk datateori
© 2024 Pling BØGER Registered company number: DK43351621