MATH3280
Introductory Probability
Original notes on probability, random variables, limits and finite Markov chains.
Your progress
0/ 23 sections marked complete
Next section: 1.1 Probability, conditioning and independence
Completion marks are saved in this browser.
This course in the web
In the MATH3280 notes
- Theorem cards
- 59
- Definitions
- 23
- Counterexamples
- 24
- Concept lenses
- 10
- Histories of ideas
- 0
- Proof X-rays
- 26
No concept lens from this course is recorded in the web yet.
Counts cover the 23 public sections of this course and what is written in them, not recorded connections. 0 of these sections are indexed into the web in detail so far.
In the webTheorem cards 59 · Definitions 23 · Counterexamples 24 · Concept lenses 10 · Proof X-rays 26
No concept lens from this course is recorded in the web yet.
Counts cover the 23 public sections of this course and what is written in them, not recorded connections. 0 of these sections are indexed into the web in detail so far.
Chapter 1 · 1 section
Probability, conditioning and independence
Probability, conditioning and independence
Theorems 3 · Definitions 3Counterexamples 1Lenses 2
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 1.1
Probability, conditioning and independence
Probability, conditioning and independence
Chapter 2 · 1 section
Random variables, moments and limit laws
Random variables, moments and limit laws
Theorems 3 · Definitions 2Counterexamples 1Lenses 1Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 2.1
Random variables, moments and limit laws
Random variables, moments and limit laws
Chapter 3 · 1 section
Random walks and finite Markov chains
Random walks and finite Markov chains
Theorems 4 · Definitions 3Counterexamples 1Lenses 1Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 3.1
Random walks and finite Markov chains
Random walks and finite Markov chains
Chapter 4 · 2 sections
Distribution families and generating functions
Counting and waiting mechanisms, factorial moments, rare-event limits and continuous transformations.
Theorems 5 · Definitions 4Counterexamples 2Lenses 1Proof X-rays 2
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 4.1
Distribution families, generating functions and transformations
Counting and waiting mechanisms, factorial moments, rare-event limits and continuous transformations.
- 4.2
Branching processes and extinction probabilities
Derive the extinction fixed point and critical threshold for a branching process.
Chapter 5 · 1 section
Joint laws and conditional expectation
Support, Jacobians, gamma–beta independence, conditional prediction, tower and variance decomposition.
Theorems 2 · Definitions 3Counterexamples 1Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 5.1
Joint densities, transformations and conditional expectation
Support, Jacobians, gamma–beta independence, conditional prediction, tower and variance decomposition.
Chapter 6 · 1 section
Convergence modes and limit theorem proofs
Convergence counterexamples, a maximal-inequality strong law, and the characteristic-function CLT argument.
Theorems 4 · Definitions 2Counterexamples 1Proof X-rays 2
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 6.1
Convergence modes, strong laws and a characteristic-function CLT
Convergence counterexamples, a maximal-inequality strong law, and the characteristic-function CLT argument.
Chapter 7 · 1 section
Infinite walks and countable chains
Infinite hitting limits, recurrence types, cycle occupation and reflected-walk stationary laws.
Theorems 3 · Definitions 2Counterexamples 1Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 7.1
Infinite walks, recurrence and countable stationary laws
Infinite hitting limits, recurrence types, cycle occupation and reflected-walk stationary laws.
Chapter 16 · 1 section
Countable-state hitting
Select hitting probabilities and mean hitting times by minimality rather than assumed uniqueness.
Theorems 3Counterexamples 1Lenses 1Proof X-rays 2
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 16.1
Hitting probabilities and mean hitting times as minimal nonnegative solutions
Characterize hitting probabilities and expected hitting times of countable-state Markov chains as least nonnegative solutions of first-step equations, separate minimality from uniqueness, and work biased walks exactly.
Chapter 17 · 1 section
Repeated events and convergence
Use Borel–Cantelli lemmas to connect repeated events and almost-sure convergence.
Theorems 1Counterexamples 1Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 17.1
Borel–Cantelli lemmas and repeated events
Use summability and independence to decide whether events happen infinitely often, and distinguish pathwise convergence from convergence of moments.
Chapter 18 · 1 section
The integrable strong law
Prove the iid strong law under the finite-mean assumption.
Theorems 2Counterexamples 1Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 18.1
The strong law with only a finite mean
Prove the iid strong law by truncation, a maximal inequality, and summation by parts.
Chapter 19 · 1 section
Martingales and stopping
Develop fair processes and bounded stopping for a random walk.
Theorems 1Counterexamples 2Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 19.1
Martingales and stopping times
Use conditional expectations to study fair processes and justify stopping arguments for finite random walks.
Chapter 24 · 1 section
Limits of events and inclusion–exclusion
Derive probability continuity and bounds for unions; count finite overlap exactly.
Theorems 3Counterexamples 1Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 24.1
Limits of events and inclusion–exclusion
Derive continuity and countable bounds from the probability axioms, then count overlapping events without double counting.
Chapter 30 · 1 section
Poisson approximation for rare events
Quantify the Poisson approximation for independent rare events and see why independence matters.
Theorems 2Counterexamples 1Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 30.1
Poisson approximation for rare events
Approximate sums of independent rare indicators and quantify the error by coupling.
Chapter 29 · 1 section
Quantiles and inverse-transform sampling
Construct distributions from uniform inputs and understand transforms in the presence of atoms.
Theorems 3 · Definitions 1Counterexamples 1Proof X-rays 2
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 29.1
Quantiles and inverse-transform sampling
Construct random variables from a uniform input, including distributions with atoms.
Chapter 28 · 1 section
Multiple inverse branches and polar coordinates
Track inverse branches, support and area scaling in transformed densities.
Theorems 1Counterexamples 1Lenses 1Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 28.1
Multiple inverse branches and polar coordinates
Find densities when a transformation folds its input space, and use polar coordinates for a pair of normal variables.
Chapter 23 · 1 section
Normal approximation for counts
Apply the central limit theorem to binomial counts and examine continuity correction.
Theorems 2 · Definitions 1Counterexamples 1Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 23.1
Normal approximation for counts
Turn a central limit theorem into a binomial probability approximation, and understand the role and limits of continuity correction.
Chapter 8 · 1 section
Convolution, order statistics and spacings
Joint transformations, support calculations, ordered-sample laws and dependent or independent spacings.
Theorems 3Counterexamples 1Lenses 1Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 8.1
Convolution, ratios, order statistics and spacings
Derive distributions of sums and ratios from joint laws, then prove the joint and marginal laws of ordered samples and explain when their spacings are dependent or independent.
Chapter 27 · 1 section
Multinomial counts and Poisson splitting
Compare fixed-total category counts with independently split Poisson counts.
Theorems 3 · Definitions 1Counterexamples 1Proof X-rays 2
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 27.1
Multinomial counts and Poisson splitting
Derive multinomial probabilities, Poisson splitting and the rare-event limit.
Chapter 32 · 1 section
Correlation and linear prediction
Derive the correlation bound and best affine prediction from second moments.
Theorems 2Counterexamples 1Lenses 1Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 32.1
Correlation and linear prediction
Derive the correlation bound and the least-squares line, and see what they do and do not say about dependence.
Chapter 31 · 1 section
Occupancy, collisions and collection
Count represented categories and wait for a complete collection.
Theorems 3Counterexamples 1Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 31.1
Occupancy, collisions and collection
Count repeated categories and calculate the time needed to see every category.
Chapter 20 · 1 section
Concentration inequalities
Quantify deviations of bounded independent sums using exponential moments.
Theorems 3Counterexamples 1Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 20.1
Concentration and Chernoff bounds
Derive exponential tail bounds for independent bounded variables and sharpen them for Bernoulli sums.
Chapter 26 · 1 section
Convexity and Jensen's inequality
Use supporting lines to compare a function of a mean with the mean of a function.
Theorems 3 · Definitions 1Counterexamples 1Lenses 1Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 26.1
Convexity and Jensen's inequality
Prove Jensen's inequality and apply its equality conditions to moments and logarithms.