DIMACS: Series in Discrete Mathematics and Theoretical Computer Science 1998; 220 pp; hardcover Volume: 41 ISBN10: 0821808273 ISBN13: 9780821808276 List Price: US$50 Member Price: US$40 Order Code: DIMACS/41
 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, treevalued Markov chains), distributional estimates (method of bounded differences, SteinChen 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
Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 17 were copublished with the Association for Computer Machinery (ACM). Readership Graduate students and researchers in probability and discrete mathematics and theoretical computer scientists. Reviews "This book contains several truly excellent surveys in discrete applied probability. The editors have done a splendid job of getting wellwritten articles, and this is well worth the price. The idea of publishing good uptodate surveys is commendable."  Journal of the American Statistical Association Table of Contents  D. Aldous  Treevalued Markov chains and PoissonGaltonWatson distributions
 R. Arratia  On the central role of scale invariant Poisson processes on \((0, \infty)\)
 A. P. Godbole and P. Hitczenko  Beyond the method of bounded differences
 O. Häggström  Dynamical percolation: Early results and open problems
 H. Kesten  Distinguishing and reconstructing sceneries from observations along random walk paths
 L. Lovász and P. Winkler  Mixing times
 R. Lyons  A bird'seye view of uniform spanning trees and forests
 J. Pitman  Enumerations of trees and forests related to branching processes and random walks
 J. Propp and D. Wilson  Coupling from the past: A user's guide
 G. Reinert  Couplings for normal approximations with Stein's method
 D. B. Wilson  Annotated bibliography of perfectly random sampling with Markov chains
