|
EECS 126 - Probability and Random
Processes - J. Walrand |
This page is an index for the commentaries and the notes.
Balance equations
- continuous time
- detailed in discrete or continuous time
Cards – 52-card deck
Classification of Markov chains
Communication Link
- Optical
- Wireless
Continuous – Probability
Countable
- Set
Conditional
Convergence of random variables: see limits
- uncorrelation implies independence for jointly Gaussian rvs
Ergodicity
- of Markov chain
- MMSE
- LLSE
- Of function of random variable
First passage time of Markov chain
- of random variable
- of Markov process may not be Markov
Gambling system: Impossibility of
- jointly
o Uncorrelated JG rvs are independent
- moments
- standard
Independent
- Events
Inequalities (Chebychev, Markov, Jensen)
Interpretation
- of probability as relative frequency
- weak
- strong
Limits of random variables
- criteria for convergence
- in L2
Markov
Maximum a posteriori (MAP)
Maximum Likelihood Estimation (MLE)
Memoryless Property
- of Bernoulli process
- of Poisson process
-
see also
Model
Paradox
- Saint Petersburg for Bernoulli
Random
- process
- variable
– discrete
- variables (collection)
– limits
Scaling
Smoothing property of conditional expectation
Stationary Distribution
- for continuous-time Markov chain
- for discrete-time Markov chain
Strong Law of Large Numbers (SLLN)
Time-reversibility
- of discrete-time Markov chain
- of continuous-time Markov chain
Transforms – example to show that binomial converges to Poisson
Uncertainty
w - as the outcome of a random experiment
Weak Law of Large Numbers (WLLN)
Jean Walrand – December 1999