Introduction to Probability
Charles M Grinstead, J Laurie Snell
Price
2175
ISBN
9780821848579
Language
English
Pages
528
Format
Paperback
Dimensions
180 x 240 mm
Year of Publishing
2009
Territorial Rights
Restricted
Imprint
American Mathematical Society
Catalogues

This text is designed for an introductory probability course at the university level for sophomores, juniors, and seniors in mathematics, physical and social sciences, engineering, and computer science. It presents a thorough treatment of ideas and techniques necessary for a firm understanding of the subject.

The text is also recommended for use in discrete probability courses. The material is organized so that the discrete and continuous probability discussions are presented in a separate, but parallel, manner. This organization does not emphasize an overly rigorous or formal view of probability and therefore offers some strong pedagogical value. Hence, the discrete discussions can sometimes serve to motivate the more abstract continuous probability discussions.

Features:

  • Key ideas are developed in a somewhat leisurely style, providing a variety of interesting applications to probability and showing some nonintuitive ideas.
  • Over 600 exercises provide the opportunity for practicing skills and developing a sound understanding of ideas.
  • Numerous historical comments deal with the development of discrete probability.

The text includes many computer programs that illustrate the algorithms or the methods of computation for important problems.

Charles M. Grinstead, Swarthmore College. PA, and J. Laurie snell, Dartmouth College, Hanover, HH
  • Reprint of entire volume
  • Discrete probability distributions (Chapter 1)
  • Continuous probability densities (Chapter 2)
  • Combinatorics (Chapter 3)
  • Conditional probability (Chapter 4)
  • Important distributions and densities (Chapter 5)
  • Expected value and variance (Chapter 6)
  • Sums of independent random variables (Chapter 7)
  • Law of large numbers (Chapter 8)
  • Central limit theorem (Chapter 9)
  • Generating functions (Chapter 10)
  • Markov chains (Chapter 11)
  • Random walks (Chapter 12)
  • Appendices
  • Index