Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Home
-
Ricerca Semplice
.
Ricerca Avanzata
.
Cerca Riviste
.
Raffina risultati ricerca
.
Preferenze
.
Search Menu
Ricerca Semplice
.
Ricerca Avanzata
.
Ricerca Nuovi Doc.
.
Cerca Riviste
.
Raffina risultati ricerca
.
Bottom Menu
Help
Italiano
.
Inglese
.
Tedesco
.
New Item Menu
Ricerca Nuovi Doc.
.
Elenco Novità
.
Visualizza Carrello
.
Legami
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
You are here
:
>
Search Simple
Visualizza Catalogo
Visualizza Catalogo
Previous Title
.
Counting, Sampling and Integrating: Algorithm and Complexity
.
Bookmark this Record
Catalogue Record 46990
.
.
Author info on Wikipedia
.
.
Biblioteca
.
.
Libri Google
.
.
Amazon Books
.
Catalogue Information
Catalogue Record 46990
.
Reviews
Catalogue Record 46990
.
British Library
Resolver for RSN-46990
Google Scholar
Resolver for RSN-46990
WorldCat
Resolver for RSN-46990
Catalogo Nazionale SBN
Resolver for RSN-46990
GoogleBooks
Resolver for RSN-46990
ICTP Library
Resolver for RSN-46990
.
Share Link
Jump to link
Catalogue Information
Nome campo
dettagli
Dewey Class
519.2
Titolo
Counting, Sampling and Integrating: Algorithm and Complexity ([EBook] /) / by Mark Jerrum.
Autore
Jerrum, Mark
Other name(s)
SpringerLink (Online service)
Pubblicazione
Basel : : Birkhäuser Basel, , 2003.
Physical Details
XI, 112 p. 7 illus. : online resource.
Serie
Lectures in mathematics / ETH Zürich
ISBN
9783034880053
Summary Note
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.:
Contents note
Foreword -- 1 Two good counting algorithms -- 1.1 Spanning trees -- 1.2 Perfect matchings in a planar graph -- 2 #P-completeness -- 2.1 The class #P -- 2.2 A primal #P-complete problem -- 2.3 Computing the permanent is hard on average -- 3 Sampling and counting -- 3.1 Preliminaries -- 3.2 Reducing approximate countingto almost uniform sampling -- 3.3 Markov chains -- 4 Coupling and colourings -- 4.1 Colourings of a low-degree graph -- 4.2 Bounding mixing time using coupling -- 4.3 Path coupling -- 5 Canonical paths and matchings -- 5.1 Matchings in a graph -- 5.2 Canonical paths -- 5.3 Back to matchings -- 5.4 Extensions and further applications -- 5.5 Continuous time -- 6 Volume of a convex body -- 6.1 A few remarks on Markov chainswith continuous state space -- 6.2 Invariant measure of the ball walk -- 6.3 Mixing rate of the ball walk -- 6.4 Proof of the Poincarü inequality (Theorem 6.7) -- 6.5 Proofs of the geometric lemmas -- 6.6 Relaxing the curvature condition -- 6.7 Using samples to estimate volume -- 6.8 Appendix: a proof of Corollary 6.8 -- 7 Inapproximability -- 7.1 Independent sets in a low degree graph.
System details note
Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site
http://dx.doi.org/10.1007/978-3-0348-8005-3
Link alle Opere Legate
Riferimenti soggetto:
.
Dynamical Systems
.
Mathematical Statistics
.
Mathematics
.
Probabilities
.
Probability and Statistics in Computer Science
.
Probability theory and stochastic processes
.
Statistical Physics
.
Statistical Physics, Dynamical Systems and Complexity
.
Authors:
Jerrum, Mark
.
Corporate Authors:
SpringerLink (Online service)
.
Series:
Lectures in mathematics / ETH Zürich
.
Classification:
519.2
.
.
Display ISBD
Catalogue Record 46990
.
Display Tag
Catalogue Record 46990
.
Opere Correlate
Catalogue Record 46990
.
Marc XML
Catalogue Record 46990
.
Aggiungi Titolo al Carrello
Catalogue Record 46990
.
Catalogue Information 46990
Beginning of record
.
Catalogue Information 46990
Top of page
.
Scarica Titolo
Catalogue Record 46990
Export
This Record
As
Labelled Format
Bibliographic Format
ISBD Format
MARC Format
MARC Binary Format
MARCXML Format
User-Defined Format:
Title
Author
Series
Publication Details
Subject
To
File
Email
Reviews
This item has not been rated.
Add a Review and/or Rating
46990
1
46990
-
2
46990
-
3
46990
-
4
46990
-
5
46990
-
Quick Search
Cerca per