Algorithms for random generation and counting : a Markov chain approach /

Saved in:
Bibliographic Details
Author / Creator:Sinclair, Alistair, 1960-
Imprint:Boston : Birkhäuser, c1993.
Description:146 p. ; 25 cm.
Language:English
Series:Progress in theoretical computer science
Subject:Markov processes
Combinatorial set theory
Algorithms
Algorithms.
Combinatorial set theory.
Markov processes.
Format: Print Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/1402158
Hidden Bibliographic Details
ISBN:0817636587 (acid-free)
3764336587 (Basel : acid-free)
Notes:Rev. version of the author's thesis (Ph. D.)--University of Edinburgh, 1988.
Includes bibliographical references (p. 136-143) and index.
LEADER 02821cam a2200457 a 4500
001 1402158
003 ICU
005 19970808180000.0
008 921217s1993 mau b 001 0 eng
010 |a  92034616 
020 |a 0817636587 (acid-free) 
020 |a 3764336587 (Basel : acid-free) 
035 |a (ICU)BID16464489 
035 |a (OCoLC)26851274 
040 |c DLC  |d DLC$dOrLoB 
050 0 0 |a QA274.7  |b .S56 1993 
082 |a 519.2/33  |2 20 
100 1 |a Sinclair, Alistair,  |d 1960-  |0 http://id.loc.gov/authorities/names/n92099861  |1 http://viaf.org/viaf/71460508 
245 1 0 |a Algorithms for random generation and counting :  |b a Markov chain approach /  |c Alistair Sinclair. 
260 |a Boston :  |b Birkhäuser,  |c c1993. 
300 |a 146 p. ;  |c 25 cm. 
336 |a text  |b txt  |2 rdacontent  |0 http://id.loc.gov/vocabulary/contentTypes/txt 
337 |a unmediated  |b n  |2 rdamedia  |0 http://id.loc.gov/vocabulary/mediaTypes/n 
338 |a volume  |b nc  |2 rdacarrier  |0 http://id.loc.gov/vocabulary/carriers/nc 
440 0 |a Progress in theoretical computer science 
500 |a Rev. version of the author's thesis (Ph. D.)--University of Edinburgh, 1988. 
504 |a Includes bibliographical references (p. 136-143) and index. 
505 0 0 |g 1.  |t Preliminaries.  |g 1.1.  |t Some basic definitions.  |g 1.2.  |t Notions of tractability.  |g 1.3.  |t An extended model.  |g 1.4.  |t Counting, generation and self-reducibility.  |g 1.5.  |t An interesting class of relations --  |g 2.  |t Markov chains and rapid mixing.  |g 2.1.  |t The Markov chain approach to generation problems.  |g 2.2.  |t Conductance and the rate of convergence.  |g 2.3.  |t A characterisation of rapid mixing --  |g 3.  |t Direct Applications.  |g 3.1.  |t Some simple examples.  |g 3.2.  |t Approximating the permanent.  |g 3.3.  |t Monomer-dimer systems.  |g 3.4.  |t Concluding remarks --  |g 4.  |t Indirect Applications.  |g 4.1.  |t A robust notion of approximate counting.  |g 4.2.  |t Self-embeddable relations.  |g 4.3.  |t Graphs with specified degrees.  |t Appendix: Recent developments. 
650 0 |a Markov processes  |0 http://id.loc.gov/authorities/subjects/sh85081369 
650 0 |a Combinatorial set theory  |0 http://id.loc.gov/authorities/subjects/sh85028812 
650 0 |a Algorithms  |0 http://id.loc.gov/authorities/subjects/sh85003487 
650 7 |a Algorithms.  |2 fast  |0 http://id.worldcat.org/fast/fst00805020 
650 7 |a Combinatorial set theory.  |2 fast  |0 http://id.worldcat.org/fast/fst00868986 
650 7 |a Markov processes.  |2 fast  |0 http://id.worldcat.org/fast/fst01010347 
850 |a ICU 
901 |a ToCBNA 
903 |a HeVa 
929 |a cat 
999 f f |i 57f462bd-0fe4-5f0c-a4e5-49b7e9940270  |s 2bcf7742-276f-5397-8826-fa6cdc351c0a 
928 |t Library of Congress classification  |a QA274.7.S560 1993  |l JCL  |c JCL-Sci  |i 2541703 
927 |t Library of Congress classification  |a QA274.7.S560 1993  |l JCL  |c JCL-Sci  |e CRERAR  |b 36996546  |i 2764066