Items related to Algorithms for Random Generation and Counting: A Markov...

Algorithms for Random Generation and Counting: A Markov Chain Approach - Softcover

Sinclair, A.

 
9781461203247: Algorithms for Random Generation and Counting: A Markov Chain Approach
Softcover
ISBN 10: 1461203244 ISBN 13: 9781461203247
Publisher: Birkhäuser, 2011

This specific ISBN edition is currently not available.

Synopsis

Synopsis.- 1 Preliminaries.- 1.1 Some basic definitions.- 1.2 Notions of tractability.- 1.3 An extended model.- 1.4 Counting, generation and self-reducibility.- 1.5 An interesting class of relations.- 2 Markov chains and rapid mixing.- 2.1 The Markov chain approach to generation problems.- 2.2 Conductance and the rate of convergence.- 2.3 A characterisation of rapid mixing.- 3 Direct Applications.- 3.1 Some simple examples.- 3.2 Approximating the permanent.- 3.3 Monomer-dimer systems.- 3.4 Concluding remarks.- 4 Indirect Applications.- 4.1 A robust notion of approximate counting.- 4.2 Self-embeddable relations.- 4.3 Graphs with specified degrees.- Appendix: Recent developments.

"synopsis" may belong to another edition of this title.

  • PublisherBirkhäuser
  • Publication date2011
  • ISBN 10 1461203244
  • ISBN 13 9781461203247
  • BindingPaperback
  • LanguageEnglish

(No Available Copies)

Search Books:



Create a Want

Can't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!

Create a Want

Other Popular Editions of the Same Title

9780817636586: Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)

Featured Edition

ISBN 10:  0817636587 ISBN 13:  9780817636586
Publisher: Birkhäuser, 1993
Hardcover