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

Sinclair, A.

Rilegato

ISBN 10: 0817636587 ISBN 13: 9780817636586

Casa editrice: Springer Basel AG, 1993

Riassunto

The underlying theme of the monograph is the study of two classical problems: counting the elements of a finite set of combinatorial structures, and generating them uniformly at random.

Su questo libro

Contenuti

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.

Product Description

Book by Sinclair A

Dettagli dell'edizione

• Editore: Springer Basel AG
• Data di pubblicazione: 1993
• Lingua: Inglese
• ISBN 10: 0817636587
• ISBN 13: 9780817636586
• Rilegatura: Copertina rigida
• Numero di pagine: 160
• Contatto del produttore: ProductSafety@springernature.com; ProductSafety@springernature.com; ; Poststr. 9; Darmstadt; 64293; Germania