Counting, Sampling and Integrating: Algorithms and Complexity

Mark Jerrum

ISBN 10: 3764369469 / ISBN 13: 9783764369460

Published by Birkhäuser Basel, Birkhäuser Basel Jan 2003, 2003

About this Item

This item is printed on demand - Print on Demand Titel. Neuware -These notes had their origin in a postgraduate lecture series I gave at the Eid genossiche Technische Hochschule (ETH) in Zurich in the Spring of 2000. I am very grateful to my hosts, the Forschungsinstitut fUr Mathematik at ETH, for providing the ideal opportunity to develop and present this material in what I hope is a reasonably coherent manner, and also for encouraging and assisting me to record the proceedings in these lecture notes. The subject of the lecture series was counting (of combinatorial structures) and related topics, viewed from a computational perspective. As we shall see, '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). We shall be inhabiting a different world to the one conjured up by books with titles like Combinatorial Enumeration or Graphical Enumeration. There, the prob lems are usually parameterised on a single integer parameter n, and the required solutions are closed form or asymptotic estimates obtained using very refined and precise analytical tools.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 128 pp. Englisch.

Seller Inventory # 9783764369460

Bibliographic Details

• Title: Counting, Sampling and Integrating: Algorithms and Complexity
• Publisher: Birkhäuser Basel, Birkhäuser Basel Jan 2003
• Publication Date: 2003
• Language: English
• ISBN 10: 3764369469
• ISBN 13: 9783764369460
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 254W x 178H x 8D millimeters 254 millimeters width by 178 millimeters height by 8 millimeters depth
• Weight: 257 grams

About this title

Synopsis

These notes had their origin in a postgraduate lecture series I gave at the Eid­ genossiche Technische Hochschule (ETH) in Zurich in the Spring of 2000. I am very grateful to my hosts, the Forschungsinstitut fUr Mathematik at ETH, for providing the ideal opportunity to develop and present this material in what I hope is a reasonably coherent manner, and also for encouraging and assisting me to record the proceedings in these lecture notes. The subject of the lecture series was counting (of combinatorial structures) and related topics, viewed from a computational perspective. As we shall see, "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). We shall be inhabiting a different world to the one conjured up by books with titles like Combinatorial Enumeration or Graphical Enumeration. There, the prob­ lems are usually parameterised on a single integer parameter n, and the required solutions are closed form or asymptotic estimates obtained using very refined and precise analytical tools.

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.