Discrete Probability and Algorithms

  • David Aldous
  • Persi Diaconis
  • Joel Spencer
  • J. Michael Steele
Conference proceedings

Part of the The IMA Volumes in Mathematics and its Applications book series (IMA, volume 72)

Table of contents

About these proceedings


Discrete probability theory and the theory of algorithms have become close partners over the last ten years, though the roots of this partnership go back much longer. The papers in this volume address the latest developments in this active field. They are from the IMA Workshops "Probability and Algorithms" and "The Finite Markov Chain Renaissance." They represent the current thinking of many of the world's leading experts in the field.

Researchers and graduate students in probability, computer science, combinatorics, and optimization theory will all be interested in this collection of articles. The techniques developed and surveyed in this volume are still undergoing rapid development, and many of the articles of the collection offer an expositionally pleasant entree into a research area of growing importance.


Markov chain Probability theory algorithms combinatorics network random walk sets

Editors and affiliations

  • David Aldous
    • 1
  • Persi Diaconis
    • 2
  • Joel Spencer
    • 3
  • J. Michael Steele
    • 4
  1. 1.Department of StatisticsUniversity of CaliforniaBerkeleyUSA
  2. 2.Department of MathematicsHarvard UniversityCambridgeUSA
  3. 3.Department of Computer Science Courant InstituteNew York UniversityNew YorkUSA
  4. 4.Department of StatisticsThe Wharton School University of PennsylvaniaPhiladelphiaUSA

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag New York, Inc. 1995
  • Publisher Name Springer, New York, NY
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4612-6905-2
  • Online ISBN 978-1-4612-0801-3
  • Series Print ISSN 0940-6573
  • Buy this book on publisher's site