|Office hours:||Wednesday 4:00-5:30, in main classroom of 24 Hillhouse.
Questions are also welcome immediately after each lecture.
|TAs:||Yu Lu, Ye Zhang, Derek Feng
Office hours: Tues 7:00-8:00; Thurs 3:00-4:00 (main classroom, 24HH)
|Final exam:>||According to YCPS, Stat 241/541 is a member of group (32), whose exams start at 2p.m. on Friday 12 December. Place: DAVIES|
|Other:||courses taught by DP in previous years|
|Short description:||A first course in probability theory: probability spaces, random variables, expectations and probabilities, conditional probability, independence, some discrete and continuous distributions, central limit theorem, law of large numbers. After or concurrent with Mathematics 120a or b or equivalents.|
|Text:||Detailed notes (in Adobe Acrobat pdf format) will be available for free from this WWW site. The 2014 notes will be similar, but not identical, to the 2011 notes. There is no prescribed text, but you might find some of the supplementary references helpful.|
Probability theory gives a systematic method for
describing randomness and uncertainty. This course will
explain the rules for manipulating random variables,
probabilities, and expectations, with emphasis on the
role of conditioning. The theory will be presented and
motivated through a sequence of applications, ranging
from the (traditional, boring) calculation of
probabilities for card games to (more involved, more
interesting) stochastic models.
The coin tossing model will generate the standard discrete distributions: Binomial, Poisson, geometric, negative binomial. The Poisson process, the continuous time analog of coin tossing, will generate the standard continuous distributions: exponential and gamma.
Normal approximations and calculations related to the multivariate normal distribution will exercise the multivariable calculus skills of the class (or provide a crash course in multiple integrals).
Applications to include topics like: Markov chains; the probability theory of games, gambling, and insurance; coding theory; queueing theory; branching processes; geometric probability and stereology; (maybe) analysis of algorithms.
The coverage will be similar to, but not exactly the same as, what I have done in previous years. See the notes for 2011 for a rough guide. In fact, I will be re-editing then posting those notes as the semester progresses.
You will be expected to know some Calculus, although past experience has shown that I need to refresh some minds when using multivariate integrals. Look at chapters 11, 12, and 13 in the 2011 notes for an idea of how I will proceed.
Miscellaneous helpful materials.