| || || || || || || |
DIMACS: Series in Discrete Mathematics and Theoretical Computer Science
1998; 220 pp; hardcover
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, tree-valued Markov chains), distributional estimates (method of bounded differences, Stein-Chen method for normal approximation), dynamical percolation, and Poisson processes.
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.
"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
Table of Contents
AMS Home |
© Copyright 2014, American Mathematical Society