Items related to Counting, Sampling and Integrating: Algorithms and...

Counting, Sampling and Integrating: Algorithms and Complexity (Lectures in Mathematics Eth Zurich) - Softcover

 
9780817669461: Counting, Sampling and Integrating: Algorithms and Complexity (Lectures in Mathematics Eth Zurich)
View all copies of this ISBN edition:
 
 
Counting, Sampling and Integrating Explores the idea of accumulating information about a set of combinatorial structures by performing a random walk on those structures. This work is not only suitable for teachers of postgraduate courses on these topics, but also for established researchers. Full description

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

From the Back Cover:

The subject of these notes is counting (of combinatorial structures) and related topics, viewed from a computational perspective. "Related topics" include sampling combinatorial structures (being computationally equivalent to approximate counting via efficient reductions), evaluating partition functions (being weighted counting), and calculating the volume of bodies (being counting in the limit).

A major theme of the book is the idea of accumulating information about a set of combinatorial structures by performing a random walk (i.e., simulating a Markov chain) on those structures. (This is for the discrete setting; one can also learn about a geometric body by performing a walk within it.) The running time of such an algorithm depends on the rate of convergence to equilibrium of this Markov chain, as formalised in the notion of "mixing time" of the Markov chain. A significant proportion of the volume is given over to an investigation of techniques for bounding the mixing time in cases of computational interest.

These notes will be of value not only to teachers of postgraduate courses on these topics, but also to established researchers in the field of computational complexity who wish to become acquainted with recent work on non-asymptotic analysis of Markov chains, and their counterparts in stochastic processes who wish to discover how their subject sits within a computational context. For the first time this body of knowledge has been brought together in a single volume.

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

  • PublisherBirkhauser
  • Publication date2003
  • ISBN 10 0817669469
  • ISBN 13 9780817669461
  • BindingPaperback

(No Available Copies)

Search Books:



Create a Want

If you know the book but cannot find it on AbeBooks, we can automatically search for it on your behalf as new inventory is added. If it is added to AbeBooks by one of our member booksellers, we will notify you!

Create a Want

Other Popular Editions of the Same Title

9783764369460: Counting, Sampling and Integrating: Algorithms and Complexity (Lectures in Mathematics. ETH Zürich)

Featured Edition

ISBN 10:  3764369469 ISBN 13:  9783764369460
Publisher: Birkhäuser, 2003
Softcover

Top Search Results from the AbeBooks Marketplace