Hardcover ISBN: | 978-0-8218-0827-6 |
Product Code: | DIMACS/41 |
List Price: | $56.00 |
MAA Member Price: | $50.40 |
AMS Member Price: | $44.80 |
eBook ISBN: | 978-1-4704-3999-6 |
Product Code: | DIMACS/41.E |
List Price: | $53.00 |
MAA Member Price: | $47.70 |
AMS Member Price: | $42.40 |
Hardcover ISBN: | 978-0-8218-0827-6 |
eBook: ISBN: | 978-1-4704-3999-6 |
Product Code: | DIMACS/41.B |
List Price: | $109.00 $82.50 |
MAA Member Price: | $98.10 $74.25 |
AMS Member Price: | $87.20 $66.00 |
Hardcover ISBN: | 978-0-8218-0827-6 |
Product Code: | DIMACS/41 |
List Price: | $56.00 |
MAA Member Price: | $50.40 |
AMS Member Price: | $44.80 |
eBook ISBN: | 978-1-4704-3999-6 |
Product Code: | DIMACS/41.E |
List Price: | $53.00 |
MAA Member Price: | $47.70 |
AMS Member Price: | $42.40 |
Hardcover ISBN: | 978-0-8218-0827-6 |
eBook ISBN: | 978-1-4704-3999-6 |
Product Code: | DIMACS/41.B |
List Price: | $109.00 $82.50 |
MAA Member Price: | $98.10 $74.25 |
AMS Member Price: | $87.20 $66.00 |
-
Book DetailsDIMACS - Series in Discrete Mathematics and Theoretical Computer ScienceVolume: 41; 1998; 220 ppMSC: Primary 60; Secondary 05
This book contains eleven articles surveying emerging topics in discrete probability. The papers are based on talks given by experts at the DIMACS “Microsurveys in Discrete Probability” workshop held at the Institute for Advanced Study, Princeton, NJ. This compilation of current research in discrete probability provides a unique overview that is not available elsewhere in book or survey form.
Topics covered in the volume include: Markov chains (perfect sampling, coupling from the past, mixing times), random trees (spanning trees on infinite graphs, enumeration of trees and forests, tree-valued Markov chains), distributional estimates (method of bounded differences, Stein-Chen method for normal approximation), dynamical percolation, and Poisson processes.
Features:
- surveys written and refereed by experts
- emerging areas of research in discrete probability theory not previously surveyed
- articles accessible to a broad readership
Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).
ReadershipGraduate students and researchers in probability and discrete mathematics and theoretical computer scientists.
-
Table of Contents
-
Chapters
-
Tree-valued Markov chains and Poisson-Galton-Watson distributions
-
On the central role of scale invariant Poisson processes on $(0, \infty )$
-
Beyond the method of bounded differences
-
Dynamical percolation: Early results and open problems
-
Distinguishing and reconstructing sceneries from observations along random walk paths
-
Mixing times
-
A bird’s-eye view of uniform spanning trees and forests
-
Enumerations of trees and forests related to branching processes and random walks
-
Coupling from the past: A user’s guide
-
Couplings for normal approximations with Stein’s method
-
Annotated bibliography of perfectly random sampling with Markov chains
-
-
Reviews
-
This book contains several truly excellent surveys in discrete applied probability. The editors have done a splendid job of getting well-written articles, and this is well worth the price. The idea of publishing good up-to-date surveys is commendable.
Journal of the American Statistical Association
-
-
RequestsReview Copy – for publishers of book reviewsAccessibility – to request an alternate format of an AMS title
- Book Details
- Table of Contents
- Reviews
- Requests
This book contains eleven articles surveying emerging topics in discrete probability. The papers are based on talks given by experts at the DIMACS “Microsurveys in Discrete Probability” workshop held at the Institute for Advanced Study, Princeton, NJ. This compilation of current research in discrete probability provides a unique overview that is not available elsewhere in book or survey form.
Topics covered in the volume include: Markov chains (perfect sampling, coupling from the past, mixing times), random trees (spanning trees on infinite graphs, enumeration of trees and forests, tree-valued Markov chains), distributional estimates (method of bounded differences, Stein-Chen method for normal approximation), dynamical percolation, and Poisson processes.
Features:
- surveys written and refereed by experts
- emerging areas of research in discrete probability theory not previously surveyed
- articles accessible to a broad readership
Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).
Graduate students and researchers in probability and discrete mathematics and theoretical computer scientists.
-
Chapters
-
Tree-valued Markov chains and Poisson-Galton-Watson distributions
-
On the central role of scale invariant Poisson processes on $(0, \infty )$
-
Beyond the method of bounded differences
-
Dynamical percolation: Early results and open problems
-
Distinguishing and reconstructing sceneries from observations along random walk paths
-
Mixing times
-
A bird’s-eye view of uniform spanning trees and forests
-
Enumerations of trees and forests related to branching processes and random walks
-
Coupling from the past: A user’s guide
-
Couplings for normal approximations with Stein’s method
-
Annotated bibliography of perfectly random sampling with Markov chains
-
This book contains several truly excellent surveys in discrete applied probability. The editors have done a splendid job of getting well-written articles, and this is well worth the price. The idea of publishing good up-to-date surveys is commendable.
Journal of the American Statistical Association