Probability Theory. Florian Herzog. A random variable is neither random nor variable. Gian-Carlo Rota, M.I.T..
|
|
- Dylan Willis
- 7 years ago
- Views:
Transcription
1 Probability Theory A random variable is neither random nor variable. Gian-Carlo Rota, M.I.T.. Florian Herzog 2013
2 Probability space Probability space A probability space W is a unique triple W = {Ω, F, P }: Ω is its sample space F its σ-algebra of events P its probability measure Remarks: (1) The sample space Ω is the set of all possible samples or elementary events ω: Ω = {ω ω Ω}. (2)The σ-algebra F is the set of all of the considered events A, i.e., subsets of Ω: F = {A A Ω, A F}. (3) The probability measure P assigns a probability P (A) to every event A F: P : F [0, 1]. Stochastic Systems,
3 Sample space The sample space Ω is sometimes called the universe of all samples or possible outcomes ω. Example 1. Sample space Toss of a coin (with head and tail): Ω = {H, T }. Two tosses of a coin: Ω = {HH, HT, T H, T T }. A cubic die: Ω = {ω 1, ω 2, ω 3, ω 4, ω 5, ω 6 }. The positive integers: Ω = {1, 2, 3,... }. The reals: Ω = {ω ω R}. Note that the ωs are a mathematical construct and have per se no real or scientific meaning. The ωs in the die example refer to the numbers of dots observed when the die is thrown. Stochastic Systems,
4 Event An event A is a subset of Ω. If the outcome ω of the experiment is in the subset A, then the event A is said to have occurred. The set of all subsets of the sample space are denoted by 2 Ω. Example 2. Events Head in the coin toss: A = {H}. Odd number in the roll of a die: A = {ω 1, ω 3, ω 5 }. An integer smaller than 5: A = {1, 2, 3, 4}, where Ω = {1, 2, 3,... }. A real number between 0 and 1: A = [0, 1], where Ω = {ω ω R}. We denote the complementary event of A by A c = Ω\A. When it is possible to determine whether an event A has occurred or not, we must also be able to determine whether A c has occurred or not. Stochastic Systems,
5 Probability Measure I Definition 1. Probability measure A probability measure P on the countable sample space Ω is a set function P : F [0, 1], satisfying the following conditions P(Ω) = 1. P(ω i ) = p i. If A 1, A 2, A 3,... F are mutually disjoint, then ( ) P A i = i=1 P (A i ). i=1 Stochastic Systems,
6 Probability The story so far: Sample space: Ω = {ω 1,..., ω n }, finite! Events: F = 2 Ω : All subsets of Ω Probability: P (ω i ) = p i P (A Ω) = w i A p i Probability axioms of Kolmogorov (1931) for elementary probability: P(Ω) = 1. If A Ω then P (A) 0. If A 1, A 2, A 3,... Ω are mutually disjoint, then ( ) P A i = i=1 P (A i ). i=1 Stochastic Systems,
7 Uncountable sample spaces Most important uncountable sample space for engineering: R, resp. R n. Consider the example Ω = [0, 1], every ω is equally likely. Obviously, P(ω) = 0. Intuitively, P([0, a]) = a, basic concept: length! Question: Has every subset of [0, 1] a determinable length? Answer: No! (e.g. Vitali sets, Banach-Tarski paradox) Question: Is this of importance in practice? Answer: No! Question: Does it matter for the underlying theory? Answer: A lot! Stochastic Systems,
8 Fundamental mathematical tools Not every subset of [0, 1] has a determinable length collect the ones with a determinable length in F. Such a mathematical construct, which has additional, desirable properties, is called σ-algebra. Definition 2. σ-algebra A collection F of subsets of Ω is called a σ-algebra on Ω if Ω F and F ( denotes the empty set) If A F then Ω\A = A c F: The complementary subset of A is also in Ω For all A i F: i=1 A i F The intuition behind it: collect all events in the σ-algebra F, make sure that by performing countably many elementary set operation (,, c ) on elements of F yields again an element in F (closeness). The pair {Ω, F} is called measure space. Stochastic Systems,
9 Example of σ-algebra Example 3. σ-algebra of two coin-tosses Ω = {HH, HT, T H, T T } = {ω 1, ω 2, ω 3, ω 4 } F min = {, Ω} = {, {ω 1, ω 2, ω 3, ω 4 }}. F 1 = {, {ω 1, ω 2 }, {ω 3, ω 4 }, {ω 1, ω 2, ω 3, ω 4 }}. F max = {, {ω 1 }, {ω 2 }, {ω 3 }, {ω 4 }, {ω 1, ω 2 }, {ω 1, ω 3 }, {ω 1, ω 4 }, {ω 2, ω 3 }, {ω 2, ω 4 }, {ω 3, ω 4 }, {ω 1, ω 2, ω 3 }, {ω 1, ω 2, ω 4 }, {ω 1, ω 3, ω 4 }, {ω 2, ω 3, ω 4 }, Ω}. Stochastic Systems,
10 Generated σ-algebras The concept of generated σ-algebras is important in probability theory. Definition 3. σ(c): σ-algebra generated by a class C of subsets Let C be a class of subsets of Ω. The σ-algebra generated by C, denoted by σ(c), is the smallest σ-algebra F which includes all elements of C, i.e., C F. Identify the different events we can measure of an experiment (denoted by A), we then just work with the σ-algebra generated by A and have avoided all the measure theoretic technicalities. Stochastic Systems,
11 Borel σ-algebra The Borel σ-algebra includes all subsets of R which are of interest in practical applications (scientific or engineering). Definition 4. Borel σ-algebra B(R)) The Borel σ-algebra B(R) is the smallest σ-algebra containing all open intervals in R. The sets in B(R) are called Borel sets. The extension to the multi-dimensional case, B(R n ), is straightforward. (, a), (b, ), (, a) (b, ) [a, b] = (, a) (b, ), (, a] = n=1 [a n, a] and [b, ) = n=1 [b, b + n], (a, b] = (, b] (a, ), {a} = n=1 (a 1 n, a + 1 n ), {a 1,, a n } = n k=1 a k. Stochastic Systems,
12 Measure Definition 5. Measure Let F be the σ-algebra of Ω and therefore (Ω, F) be a measurable space. The map µ : F [0, ] is called a measure on (Ω, F) if µ is countably additive. The measure µ is countably additive (or σ-additive) if µ( ) = 0 and for every sequence of disjoint sets (F i : i N) in F with F = i N F i we have µ(f ) = i N µ(f i ). If µ is countably additive, it is also additive, meaning for every F, G F we have µ(f G) = µ(f ) + µ(g) if and only if F G = The triple (Ω, F, µ) is called a measure space. Stochastic Systems,
13 Lebesgue Measure The measure of length on the straight line is known as the Lebesgue measure. Definition 6. Lebesgue measure on B(R) The Lebesgue measure on B(R), denoted by λ, is defined as the measure on (R, B(R)) which assigns the measure of each interval to be its length. Examples: Lebesgue measure of one point: λ({a}) = 0. Lebesgue measure of countably many points: λ(a) = i=1 λ({a i}) = 0. The Lebesgue measure of a set containing uncountably many points: zero positive and finite infinite Stochastic Systems,
14 Probability Measure Definition 7. Probability measure A probability measure P on the sample space Ω with σ-algebra F is a set function P : F [0, 1], satisfying the following conditions P(Ω) = 1. If A F then P (A) 0. If A 1, A 2, A 3,... F are mutually disjoint, then ( ) P A i = i=1 P (A i ). i=1 The triple (Ω, F, P ) is called a probability space. Stochastic Systems,
15 F-measurable functions Definition 8. F-measurable function The function f : Ω R defined on (Ω, F, P ) is called F-measurable if f 1 (B) = {ω Ω : f(ω) B} F for all B B(R), i.e., the inverse f 1 maps all of the Borel sets B R to F. Sometimes it is easier to work with following equivalent condition: y R {ω Ω : f(ω) y} F This means that once we know the (random) value X(ω) we know which of the events in F have happened. F = {, Ω}: only constant functions are measurable F = 2 Ω : all functions are measurable Stochastic Systems,
16 F-measurable functions Ω: Sample space, A i : Event, F = σ(a 1,..., A n ): σ-algebra of events X(ω) : Ω R R ω A 1 A 2 X(ω) R (, a] B A 3 A 4 X 1 : B F Ω X: random variable, B: Borel σ-algebra Stochastic Systems,
17 F-measurable functions - Example Roll of a die: Ω = {ω 1, ω 2, ω 3, ω 4, ω 5, ω 6 } We only know, whether an even or and odd number has shown up: F = {, {ω 1, ω 3, ω 5 }, {ω 2, ω 4, ω 6 }, Ω} = σ({ω 1, ω 3, ω 5 }) Consider the following random variable: f(ω) = { 1, if ω = ω1, ω 2, ω 3 ; 1, if ω = ω 4, ω 5, ω 6. Check measurability with the condition y R {ω Ω : f(ω) y} F {ω Ω : f(ω) 0} = {ω 4, ω 5, ω 6 } / F f is not F-measurable. Stochastic Systems,
18 Lebesgue integral I Definition 9. Lebesgue Integral (Ω, F) a measure space, µ : Ω R a measure, f : Ω R is F-measurable. If f is a simple function, i.e., f(x) = c i, for all x A i, c i R Ω fdµ = n c i µ(a i ). If f is nonnegative, we can always construct a sequence of simple functions f n with f n (x) f n+1 (x) which converges to f: lim n f n (x) = f(x). With this sequence, the Lebesgue integral is defined by fdµ = lim f n dµ. Ω n Ω i=1 Stochastic Systems,
19 Lebesgue integral II Definition 10. Lebesgue Integral (Ω, F) a measure space, µ : Ω R a measure, f : Ω R is F-measurable. If f is an arbitrary, measurable function, we have f = f + f with f + (x) = max(f(x), 0) and f (x) = max( f(x), 0), and then define Ω fdµ = Ω f + dp Ω f dp. The integral above may be finite or infinite. It is not defined if Ω f + dp and Ω f dp are both infinite. Stochastic Systems,
20 Riemann vs. Lebesgue The most important concept of the Lebesgue integral is that the limit of approximate sums (as the Riemann integral): for Ω = R: f(x) f(x) f x x x Stochastic Systems,
21 Riemann vs. Lebesgue integral Theorem 1. Riemann-Lebesgue integral equivalence Let f be a bounded and continuous function on [x 1, x 2 ] except at a countable number of points in [x 1, x 2 ]. Then both the Riemann and the Lebesgue integral with Lebesgue measure µ exist and are the same: x2 x 1 f(x) dx = [x 1,x 2 ] fdµ. There are more functions which are Lebesgue integrable than Riemann integrable. Stochastic Systems,
22 Popular example for Riemann vs. Lebesgue Consider the function f(x) = { 0, x Q; 1, x R\Q. The Riemann integral 1 0 f(x)dx does not exist, since lower and upper sum do not converge to the same value. However, the Lebesgue integral fdλ = 1 [0,1] does exist, since f(x) is the indicator function of x R\Q. Stochastic Systems,
23 Random Variable Definition 11. Random variable A real-valued random variable X is a F-measurable function defined on a probability space (Ω, F, P ) mapping its sample space Ω into the real line R: X : Ω R. Since X is F-measurable we have X 1 : B F. Stochastic Systems,
24 Distribution function Definition 12. Distribution function The distribution function of a random variable X, defined on a probability space (Ω, F, P ), is defined by: F (x) = P (X(ω) x) = P ({ω : X(ω) x}). From this the probability measure of the half-open sets in R is P (a < X b) = P ({ω : a < X(ω) b}) = F (b) F (a). Stochastic Systems,
25 Density function Closely related to the distribution function is the density function. Let f : R R be a nonnegative function, satisfying fdλ = 1. The function f is called R a density function (with respect to the Lebesgue measure) and the associated probability measure for a random variable X, defined on (Ω, F, P ), is for all A F. P ({ω : ω A}) = A fdλ. Stochastic Systems,
26 Important Densities I Poisson density or probability mass function (λ > 0): Univariate Normal density f(x) = λx x! e λ, x = 0, 1, 2,.... f(x) = 1 2πσ e 1 2 ( ) x µ σ. The normal variable is abbreviated as N (µ, σ). Multivariate normal density (x, µ R n ; Σ R n n ): f(x) = 1 (2π)n det(σ) e 1 2 (x µ)t Σ 1 (x µ). Stochastic Systems,
27 Important Densities II Univariate student t-density ν degrees of freedom (x, µ R 1 ; σ R 1 f(x) = Γ(ν+1 2 ) ( Γ( ν 2 ) (x µ) 2 ) 1 2 (ν+1) πνσ ν σ 2 Multivariate student t-density with ν degrees of freedom (x, µ R n ; Σ R n n ): f(x) = Γ( ν+n 2 ) ( Γ( ν 2 ) (πν) n det(σ) ν (x µ)t Σ (ν+n) (x µ)). Stochastic Systems,
28 Important Densities II The chi square distribution with degree-of-freedom (dof) n has the following density )n 2 2 ( f(x) = e x 2 x 2 2Γ( n 2 ) which is abreviated as Z χ 2 (n) and where Γ denotes the gamma function. A chi square distributed random variable Y is created by Y = n i=1 X 2 i where X are independent standard normal distributed random variables N (0, 1). Stochastic Systems,
29 Important Densities III A standard student-t distributed random variable Y is generated by Y = X Z ν, where X N (0, 1) and Z χ 2 (ν). Another important density is the Laplace distribution: p(x) = 1 x µ 2σ e σ with mean µ and diffusion σ. The variance of this distribution is given as 2σ 2. Stochastic Systems,
30 Expectation & Variance Definition 13. Expectation of a random variable The expectation of a random variable X, defined on a probability space (Ω, F, P ), is defined by: E[X] = Ω XdP = Ω xfdλ. With this definition at hand, it does not matter what the sample Ω is. The calculations for the two familiar cases of a finite Ω and Ω R with continuous random variables remain the same. Definition 14. Variance of a random variable The variance of a random variable X, defined on a probability space (Ω, F, P ), is defined by: var(x) = E[(X E[X]) 2 ] = (X E[X]) 2 dp = E[X 2 ] E[X] 2. Ω Stochastic Systems,
31 Normally distributed random variables The shorthand notation X N (µ, σ 2 ) for normally distributed random variables with parameters µ and σ is often found in the literature. The following properties are useful when dealing with normally distributed random variables: If X N (µ, σ 2 )) and Y = ax + b, then Y N (aµ + b, a 2 σ 2 )). If X 1 N (µ 1, σ 2 1 )) and X 2 N (µ 2, σ 2 2 )) then X 1 + X 2 N (µ 1 + µ 2, σ σ2 2 ) (if X 1 and X 2 are independent) Stochastic Systems,
32 Conditional Expectation I From elementary probability theory (Bayes rule): P (A B) = P (A B) P (B) = P (B A)P (A) P (B), P (B) > 0. A A B B Ω E(X B) = E(XI B) P (B), P (B) > 0. Stochastic Systems,
33 Conditional Expectation II General case: (Ω, F, P ) Definition 15. Conditional expectation Let X be a random variable defined on the probability space (Ω, F, P ) with E[ X ] <. Furthermore let G be a sub-σ-algebra of F (G F). Then there exists a random variable Y with the following properties: 1. Y is G-measurable. 2. E[ Y ] <. 3. For all sets G in G we have Y dp = G G XdP, for all G G. The random variable Y = E[X G] is called conditional expectation. Stochastic Systems,
34 Conditional Expectation: Example Y is a piecewise linear approximation of X. Y = E[X G] X(ω) Y X G 1 G 2 G 3 G 4 G 5 ω For the trivial σ-algebra {, Ω}: Y = E[X {, Ω}] = XdP = E[X]. Ω Stochastic Systems,
35 Conditional Expectation: Properties E(E(X F)) = E(X). If X is F-measurable, then E(X F) = X. Linearity: E(αX 1 + βx 2 F) = αe(x 1 F) + βe(x 2 F). Positivity: If X 0 almost surely, then E(X F) 0. Tower property: If G is a sub-σ-algebra of F, then E(E(X F) G) = E(X G). Taking out what is known: If Z is G-measurable, then E(ZX G) = Z E(X G). Stochastic Systems,
36 Summary σ-algebra: collection of the events of interest, closed under elementary set operations Borel σ-algebra: all the events of practical importance in R Lebesgue measure: defined as the length of an interval Density: transforms Lebesgue measure in a probability measure Measurable function: the σ-algebra of the probability space is rich enough Random variable X: a measurable function X : Ω R Expectation, Variance Conditional expectation is a piecewise linear approximation of the underlying random variable. Stochastic Systems,
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
More informationThe sample space for a pair of die rolls is the set. The sample space for a random number between 0 and 1 is the interval [0, 1].
Probability Theory Probability Spaces and Events Consider a random experiment with several possible outcomes. For example, we might roll a pair of dice, flip a coin three times, or choose a random real
More informationChapter 4 Lecture Notes
Chapter 4 Lecture Notes Random Variables October 27, 2015 1 Section 4.1 Random Variables A random variable is typically a real-valued function defined on the sample space of some experiment. For instance,
More informationRANDOM INTERVAL HOMEOMORPHISMS. MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis
RANDOM INTERVAL HOMEOMORPHISMS MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis This is a joint work with Lluís Alsedà Motivation: A talk by Yulij Ilyashenko. Two interval maps, applied
More informationST 371 (IV): Discrete Random Variables
ST 371 (IV): Discrete Random Variables 1 Random Variables A random variable (rv) is a function that is defined on the sample space of the experiment and that assigns a numerical variable to each possible
More informationE3: PROBABILITY AND STATISTICS lecture notes
E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................
More informationLecture Notes on Measure Theory and Functional Analysis
Lecture Notes on Measure Theory and Functional Analysis P. Cannarsa & T. D Aprile Dipartimento di Matematica Università di Roma Tor Vergata cannarsa@mat.uniroma2.it daprile@mat.uniroma2.it aa 2006/07 Contents
More informationNotes on Continuous Random Variables
Notes on Continuous Random Variables Continuous random variables are random quantities that are measured on a continuous scale. They can usually take on any value over some interval, which distinguishes
More informationLebesgue Measure on R n
8 CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More information4.1 4.2 Probability Distribution for Discrete Random Variables
4.1 4.2 Probability Distribution for Discrete Random Variables Key concepts: discrete random variable, probability distribution, expected value, variance, and standard deviation of a discrete random variable.
More informationProbability for Estimation (review)
Probability for Estimation (review) In general, we want to develop an estimator for systems of the form: x = f x, u + η(t); y = h x + ω(t); ggggg y, ffff x We will primarily focus on discrete time linear
More informationFor a partition B 1,..., B n, where B i B j = for i. A = (A B 1 ) (A B 2 ),..., (A B n ) and thus. P (A) = P (A B i ) = P (A B i )P (B i )
Probability Review 15.075 Cynthia Rudin A probability space, defined by Kolmogorov (1903-1987) consists of: A set of outcomes S, e.g., for the roll of a die, S = {1, 2, 3, 4, 5, 6}, 1 1 2 1 6 for the roll
More informationElements of probability theory
2 Elements of probability theory Probability theory provides mathematical models for random phenomena, that is, phenomena which under repeated observations yield di erent outcomes that cannot be predicted
More informationand s n (x) f(x) for all x and s.t. s n is measurable if f is. REAL ANALYSIS Measures. A (positive) measure on a measurable space
RAL ANALYSIS A survey of MA 641-643, UAB 1999-2000 M. Griesemer Throughout these notes m denotes Lebesgue measure. 1. Abstract Integration σ-algebras. A σ-algebra in X is a non-empty collection of subsets
More informationRandom variables P(X = 3) = P(X = 3) = 1 8, P(X = 1) = P(X = 1) = 3 8.
Random variables Remark on Notations 1. When X is a number chosen uniformly from a data set, What I call P(X = k) is called Freq[k, X] in the courseware. 2. When X is a random variable, what I call F ()
More informationMULTIVARIATE PROBABILITY DISTRIBUTIONS
MULTIVARIATE PROBABILITY DISTRIBUTIONS. PRELIMINARIES.. Example. Consider an experiment that consists of tossing a die and a coin at the same time. We can consider a number of random variables defined
More informationSection 5.1 Continuous Random Variables: Introduction
Section 5. Continuous Random Variables: Introduction Not all random variables are discrete. For example:. Waiting times for anything (train, arrival of customer, production of mrna molecule from gene,
More informationLecture 13: Martingales
Lecture 13: Martingales 1. Definition of a Martingale 1.1 Filtrations 1.2 Definition of a martingale and its basic properties 1.3 Sums of independent random variables and related models 1.4 Products of
More informationMaximum Likelihood Estimation
Math 541: Statistical Theory II Lecturer: Songfeng Zheng Maximum Likelihood Estimation 1 Maximum Likelihood Estimation Maximum likelihood is a relatively simple method of constructing an estimator for
More informationLecture 6: Discrete & Continuous Probability and Random Variables
Lecture 6: Discrete & Continuous Probability and Random Variables D. Alex Hughes Math Camp September 17, 2015 D. Alex Hughes (Math Camp) Lecture 6: Discrete & Continuous Probability and Random September
More informationModern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem
More informationLecture 8. Confidence intervals and the central limit theorem
Lecture 8. Confidence intervals and the central limit theorem Mathematical Statistics and Discrete Mathematics November 25th, 2015 1 / 15 Central limit theorem Let X 1, X 2,... X n be a random sample of
More informationJoint Exam 1/P Sample Exam 1
Joint Exam 1/P Sample Exam 1 Take this practice exam under strict exam conditions: Set a timer for 3 hours; Do not stop the timer for restroom breaks; Do not look at your notes. If you believe a question
More informationMATH 10: Elementary Statistics and Probability Chapter 5: Continuous Random Variables
MATH 10: Elementary Statistics and Probability Chapter 5: Continuous Random Variables Tony Pourmohamad Department of Mathematics De Anza College Spring 2015 Objectives By the end of this set of slides,
More informationSOME APPLICATIONS OF MARTINGALES TO PROBABILITY THEORY
SOME APPLICATIONS OF MARTINGALES TO PROBABILITY THEORY WATSON LADD Abstract. Martingales are a very simple concept with wide application in probability. We introduce the concept of a martingale, develop
More informationMEASURE AND INTEGRATION. Dietmar A. Salamon ETH Zürich
MEASURE AND INTEGRATION Dietmar A. Salamon ETH Zürich 12 May 2016 ii Preface This book is based on notes for the lecture course Measure and Integration held at ETH Zürich in the spring semester 2014. Prerequisites
More informationLecture 7: Continuous Random Variables
Lecture 7: Continuous Random Variables 21 September 2005 1 Our First Continuous Random Variable The back of the lecture hall is roughly 10 meters across. Suppose it were exactly 10 meters, and consider
More informationM2S1 Lecture Notes. G. A. Young http://www2.imperial.ac.uk/ ayoung
M2S1 Lecture Notes G. A. Young http://www2.imperial.ac.uk/ ayoung September 2011 ii Contents 1 DEFINITIONS, TERMINOLOGY, NOTATION 1 1.1 EVENTS AND THE SAMPLE SPACE......................... 1 1.1.1 OPERATIONS
More information5. Continuous Random Variables
5. Continuous Random Variables Continuous random variables can take any value in an interval. They are used to model physical characteristics such as time, length, position, etc. Examples (i) Let X be
More informationRANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS
RANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS. DISCRETE RANDOM VARIABLES.. Definition of a Discrete Random Variable. A random variable X is said to be discrete if it can assume only a finite or countable
More informationProbability and Statistics Vocabulary List (Definitions for Middle School Teachers)
Probability and Statistics Vocabulary List (Definitions for Middle School Teachers) B Bar graph a diagram representing the frequency distribution for nominal or discrete data. It consists of a sequence
More informationNotes on Probability Theory
Notes on Probability Theory Christopher King Department of Mathematics Northeastern University July 31, 2009 Abstract These notes are intended to give a solid introduction to Probability Theory with a
More informationIntroduction to Probability
Introduction to Probability EE 179, Lecture 15, Handout #24 Probability theory gives a mathematical characterization for experiments with random outcomes. coin toss life of lightbulb binary data sequence
More informationLecture Note 1 Set and Probability Theory. MIT 14.30 Spring 2006 Herman Bennett
Lecture Note 1 Set and Probability Theory MIT 14.30 Spring 2006 Herman Bennett 1 Set Theory 1.1 Definitions and Theorems 1. Experiment: any action or process whose outcome is subject to uncertainty. 2.
More informationMath 151. Rumbos Spring 2014 1. Solutions to Assignment #22
Math 151. Rumbos Spring 2014 1 Solutions to Assignment #22 1. An experiment consists of rolling a die 81 times and computing the average of the numbers on the top face of the die. Estimate the probability
More informationMarkov random fields and Gibbs measures
Chapter Markov random fields and Gibbs measures 1. Conditional independence Suppose X i is a random element of (X i, B i ), for i = 1, 2, 3, with all X i defined on the same probability space (.F, P).
More informationProbability and statistics; Rehearsal for pattern recognition
Probability and statistics; Rehearsal for pattern recognition Václav Hlaváč Czech Technical University in Prague Faculty of Electrical Engineering, Department of Cybernetics Center for Machine Perception
More informationEstimating the Average Value of a Function
Estimating the Average Value of a Function Problem: Determine the average value of the function f(x) over the interval [a, b]. Strategy: Choose sample points a = x 0 < x 1 < x 2 < < x n 1 < x n = b and
More informationLecture 3: Continuous distributions, expected value & mean, variance, the normal distribution
Lecture 3: Continuous distributions, expected value & mean, variance, the normal distribution 8 October 2007 In this lecture we ll learn the following: 1. how continuous probability distributions differ
More informationMathematical Methods of Engineering Analysis
Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................
More informationThe Ergodic Theorem and randomness
The Ergodic Theorem and randomness Peter Gács Department of Computer Science Boston University March 19, 2008 Peter Gács (Boston University) Ergodic theorem March 19, 2008 1 / 27 Introduction Introduction
More informationMath/Stats 425 Introduction to Probability. 1. Uncertainty and the axioms of probability
Math/Stats 425 Introduction to Probability 1. Uncertainty and the axioms of probability Processes in the real world are random if outcomes cannot be predicted with certainty. Example: coin tossing, stock
More information4. Continuous Random Variables, the Pareto and Normal Distributions
4. Continuous Random Variables, the Pareto and Normal Distributions A continuous random variable X can take any value in a given range (e.g. height, weight, age). The distribution of a continuous random
More informationExploratory Data Analysis
Exploratory Data Analysis Johannes Schauer johannes.schauer@tugraz.at Institute of Statistics Graz University of Technology Steyrergasse 17/IV, 8010 Graz www.statistics.tugraz.at February 12, 2008 Introduction
More informationALMOST COMMON PRIORS 1. INTRODUCTION
ALMOST COMMON PRIORS ZIV HELLMAN ABSTRACT. What happens when priors are not common? We introduce a measure for how far a type space is from having a common prior, which we term prior distance. If a type
More informationAn Introduction to Basic Statistics and Probability
An Introduction to Basic Statistics and Probability Shenek Heyward NCSU An Introduction to Basic Statistics and Probability p. 1/4 Outline Basic probability concepts Conditional probability Discrete Random
More informationProbability: Terminology and Examples Class 2, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom
Probability: Terminology and Examples Class 2, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom 1 Learning Goals 1. Know the definitions of sample space, event and probability function. 2. Be able to
More informationA Uniform Asymptotic Estimate for Discounted Aggregate Claims with Subexponential Tails
12th International Congress on Insurance: Mathematics and Economics July 16-18, 2008 A Uniform Asymptotic Estimate for Discounted Aggregate Claims with Subexponential Tails XUEMIAO HAO (Based on a joint
More informationMATHEMATICAL METHODS OF STATISTICS
MATHEMATICAL METHODS OF STATISTICS By HARALD CRAMER TROFESSOK IN THE UNIVERSITY OF STOCKHOLM Princeton PRINCETON UNIVERSITY PRESS 1946 TABLE OF CONTENTS. First Part. MATHEMATICAL INTRODUCTION. CHAPTERS
More informationCHAPTER 6: Continuous Uniform Distribution: 6.1. Definition: The density function of the continuous random variable X on the interval [A, B] is.
Some Continuous Probability Distributions CHAPTER 6: Continuous Uniform Distribution: 6. Definition: The density function of the continuous random variable X on the interval [A, B] is B A A x B f(x; A,
More informationChapter ML:IV. IV. Statistical Learning. Probability Basics Bayes Classification Maximum a-posteriori Hypotheses
Chapter ML:IV IV. Statistical Learning Probability Basics Bayes Classification Maximum a-posteriori Hypotheses ML:IV-1 Statistical Learning STEIN 2005-2015 Area Overview Mathematics Statistics...... Stochastics
More informationProbability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur
Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur Module No. #01 Lecture No. #15 Special Distributions-VI Today, I am going to introduce
More informationMath 431 An Introduction to Probability. Final Exam Solutions
Math 43 An Introduction to Probability Final Eam Solutions. A continuous random variable X has cdf a for 0, F () = for 0 <
More informationSummary of Formulas and Concepts. Descriptive Statistics (Ch. 1-4)
Summary of Formulas and Concepts Descriptive Statistics (Ch. 1-4) Definitions Population: The complete set of numerical information on a particular quantity in which an investigator is interested. We assume
More informationNonparametric adaptive age replacement with a one-cycle criterion
Nonparametric adaptive age replacement with a one-cycle criterion P. Coolen-Schrijner, F.P.A. Coolen Department of Mathematical Sciences University of Durham, Durham, DH1 3LE, UK e-mail: Pauline.Schrijner@durham.ac.uk
More informationDiscrete Math in Computer Science Homework 7 Solutions (Max Points: 80)
Discrete Math in Computer Science Homework 7 Solutions (Max Points: 80) CS 30, Winter 2016 by Prasad Jayanti 1. (10 points) Here is the famous Monty Hall Puzzle. Suppose you are on a game show, and you
More informationINSURANCE RISK THEORY (Problems)
INSURANCE RISK THEORY (Problems) 1 Counting random variables 1. (Lack of memory property) Let X be a geometric distributed random variable with parameter p (, 1), (X Ge (p)). Show that for all n, m =,
More informationSome stability results of parameter identification in a jump diffusion model
Some stability results of parameter identification in a jump diffusion model D. Düvelmeyer Technische Universität Chemnitz, Fakultät für Mathematik, 09107 Chemnitz, Germany Abstract In this paper we discuss
More information1.1 Introduction, and Review of Probability Theory... 3. 1.1.1 Random Variable, Range, Types of Random Variables... 3. 1.1.2 CDF, PDF, Quantiles...
MATH4427 Notebook 1 Spring 2016 prepared by Professor Jenny Baglivo c Copyright 2009-2016 by Jenny A. Baglivo. All Rights Reserved. Contents 1 MATH4427 Notebook 1 3 1.1 Introduction, and Review of Probability
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 14 10/27/2008 MOMENT GENERATING FUNCTIONS
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 14 10/27/2008 MOMENT GENERATING FUNCTIONS Contents 1. Moment generating functions 2. Sum of a ranom number of ranom variables 3. Transforms
More informationMathematics for Econometrics, Fourth Edition
Mathematics for Econometrics, Fourth Edition Phoebus J. Dhrymes 1 July 2012 1 c Phoebus J. Dhrymes, 2012. Preliminary material; not to be cited or disseminated without the author s permission. 2 Contents
More informationNormal distribution. ) 2 /2σ. 2π σ
Normal distribution The normal distribution is the most widely known and used of all distributions. Because the normal distribution approximates many natural phenomena so well, it has developed into a
More informationPractice problems for Homework 11 - Point Estimation
Practice problems for Homework 11 - Point Estimation 1. (10 marks) Suppose we want to select a random sample of size 5 from the current CS 3341 students. Which of the following strategies is the best:
More informationMath/Stats 342: Solutions to Homework
Math/Stats 342: Solutions to Homework Steven Miller (sjm1@williams.edu) November 17, 2011 Abstract Below are solutions / sketches of solutions to the homework problems from Math/Stats 342: Probability
More informationMath 425 (Fall 08) Solutions Midterm 2 November 6, 2008
Math 425 (Fall 8) Solutions Midterm 2 November 6, 28 (5 pts) Compute E[X] and Var[X] for i) X a random variable that takes the values, 2, 3 with probabilities.2,.5,.3; ii) X a random variable with the
More informationGambling Systems and Multiplication-Invariant Measures
Gambling Systems and Multiplication-Invariant Measures by Jeffrey S. Rosenthal* and Peter O. Schwartz** (May 28, 997.. Introduction. This short paper describes a surprising connection between two previously
More informationStatistics 100A Homework 8 Solutions
Part : Chapter 7 Statistics A Homework 8 Solutions Ryan Rosario. A player throws a fair die and simultaneously flips a fair coin. If the coin lands heads, then she wins twice, and if tails, the one-half
More information2WB05 Simulation Lecture 8: Generating random variables
2WB05 Simulation Lecture 8: Generating random variables Marko Boon http://www.win.tue.nl/courses/2wb05 January 7, 2013 Outline 2/36 1. How do we generate random variables? 2. Fitting distributions Generating
More informationSF2940: Probability theory Lecture 8: Multivariate Normal Distribution
SF2940: Probability theory Lecture 8: Multivariate Normal Distribution Timo Koski 24.09.2015 Timo Koski Matematisk statistik 24.09.2015 1 / 1 Learning outcomes Random vectors, mean vector, covariance matrix,
More informationSums of Independent Random Variables
Chapter 7 Sums of Independent Random Variables 7.1 Sums of Discrete Random Variables In this chapter we turn to the important question of determining the distribution of a sum of independent random variables
More informationExtension of measure
1 Extension of measure Sayan Mukherjee Dynkin s π λ theorem We will soon need to define probability measures on infinite and possible uncountable sets, like the power set of the naturals. This is hard.
More informationLecture 4: BK inequality 27th August and 6th September, 2007
CSL866: Percolation and Random Graphs IIT Delhi Amitabha Bagchi Scribe: Arindam Pal Lecture 4: BK inequality 27th August and 6th September, 2007 4. Preliminaries The FKG inequality allows us to lower bound
More informationLectures on Stochastic Processes. William G. Faris
Lectures on Stochastic Processes William G. Faris November 8, 2001 2 Contents 1 Random walk 7 1.1 Symmetric simple random walk................... 7 1.2 Simple random walk......................... 9 1.3
More informationOverview of Monte Carlo Simulation, Probability Review and Introduction to Matlab
Monte Carlo Simulation: IEOR E4703 Fall 2004 c 2004 by Martin Haugh Overview of Monte Carlo Simulation, Probability Review and Introduction to Matlab 1 Overview of Monte Carlo Simulation 1.1 Why use simulation?
More informationChapter 5. Random variables
Random variables random variable numerical variable whose value is the outcome of some probabilistic experiment; we use uppercase letters, like X, to denote such a variable and lowercase letters, like
More informationIAM 530 ELEMENTS OF PROBABILITY AND STATISTICS INTRODUCTION
IAM 530 ELEMENTS OF PROBABILITY AND STATISTICS INTRODUCTION 1 WHAT IS STATISTICS? Statistics is a science of collecting data, organizing and describing it and drawing conclusions from it. That is, statistics
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationMartingale Ideas in Elementary Probability. Lecture course Higher Mathematics College, Independent University of Moscow Spring 1996
Martingale Ideas in Elementary Probability Lecture course Higher Mathematics College, Independent University of Moscow Spring 1996 William Faris University of Arizona Fulbright Lecturer, IUM, 1995 1996
More informationChapter 3: DISCRETE RANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS. Part 3: Discrete Uniform Distribution Binomial Distribution
Chapter 3: DISCRETE RANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS Part 3: Discrete Uniform Distribution Binomial Distribution Sections 3-5, 3-6 Special discrete random variable distributions we will cover
More information1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
More informationHow To Find Out How To Calculate A Premeasure On A Set Of Two-Dimensional Algebra
54 CHAPTER 5 Product Measures Given two measure spaces, we may construct a natural measure on their Cartesian product; the prototype is the construction of Lebesgue measure on R 2 as the product of Lebesgue
More informationLinear Algebra I. Ronald van Luijk, 2012
Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.
More informationProbability Calculator
Chapter 95 Introduction Most statisticians have a set of probability tables that they refer to in doing their statistical wor. This procedure provides you with a set of electronic statistical tables that
More information6.041/6.431 Spring 2008 Quiz 2 Wednesday, April 16, 7:30-9:30 PM. SOLUTIONS
6.4/6.43 Spring 28 Quiz 2 Wednesday, April 6, 7:3-9:3 PM. SOLUTIONS Name: Recitation Instructor: TA: 6.4/6.43: Question Part Score Out of 3 all 36 2 a 4 b 5 c 5 d 8 e 5 f 6 3 a 4 b 6 c 6 d 6 e 6 Total
More informationTwo-Stage Stochastic Linear Programs
Two-Stage Stochastic Linear Programs Operations Research Anthony Papavasiliou 1 / 27 Two-Stage Stochastic Linear Programs 1 Short Reviews Probability Spaces and Random Variables Convex Analysis 2 Deterministic
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 13. Random Variables: Distribution and Expectation
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 3 Random Variables: Distribution and Expectation Random Variables Question: The homeworks of 20 students are collected
More informationStatistics in Geophysics: Introduction and Probability Theory
Statistics in Geophysics: Introduction and Steffen Unkel Department of Statistics Ludwig-Maximilians-University Munich, Germany Winter Term 2013/14 1/32 What is Statistics? Introduction Statistics is the
More informationDepartment of Mathematics, Indian Institute of Technology, Kharagpur Assignment 2-3, Probability and Statistics, March 2015. Due:-March 25, 2015.
Department of Mathematics, Indian Institute of Technology, Kharagpur Assignment -3, Probability and Statistics, March 05. Due:-March 5, 05.. Show that the function 0 for x < x+ F (x) = 4 for x < for x
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 18. A Brief Introduction to Continuous Probability
CS 7 Discrete Mathematics and Probability Theory Fall 29 Satish Rao, David Tse Note 8 A Brief Introduction to Continuous Probability Up to now we have focused exclusively on discrete probability spaces
More informationCITY UNIVERSITY LONDON. BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION
No: CITY UNIVERSITY LONDON BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION ENGINEERING MATHEMATICS 2 (resit) EX2005 Date: August
More informationBasic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely
More informationSummer School in Statistics for Astronomers & Physicists, IV June 9-14, 2008
p. 1/4 Summer School in Statistics for Astronomers & Physicists, IV June 9-14, 2008 Laws of Probability, Bayes theorem, and the Central Limit Theorem June 10, 8:45-10:15 am Mosuk Chow Department of Statistics
More informationThe Heat Equation. Lectures INF2320 p. 1/88
The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)
More informationQuestion: What is the probability that a five-card poker hand contains a flush, that is, five cards of the same suit?
ECS20 Discrete Mathematics Quarter: Spring 2007 Instructor: John Steinberger Assistant: Sophie Engle (prepared by Sophie Engle) Homework 8 Hints Due Wednesday June 6 th 2007 Section 6.1 #16 What is the
More informationON SOME ANALOGUE OF THE GENERALIZED ALLOCATION SCHEME
ON SOME ANALOGUE OF THE GENERALIZED ALLOCATION SCHEME Alexey Chuprunov Kazan State University, Russia István Fazekas University of Debrecen, Hungary 2012 Kolchin s generalized allocation scheme A law of
More informationA characterization of trace zero symmetric nonnegative 5x5 matrices
A characterization of trace zero symmetric nonnegative 5x5 matrices Oren Spector June 1, 009 Abstract The problem of determining necessary and sufficient conditions for a set of real numbers to be the
More information1 The Brownian bridge construction
The Brownian bridge construction The Brownian bridge construction is a way to build a Brownian motion path by successively adding finer scale detail. This construction leads to a relatively easy proof
More informationA review of the portions of probability useful for understanding experimental design and analysis.
Chapter 3 Review of Probability A review of the portions of probability useful for understanding experimental design and analysis. The material in this section is intended as a review of the topic of probability
More information10.2 Series and Convergence
10.2 Series and Convergence Write sums using sigma notation Find the partial sums of series and determine convergence or divergence of infinite series Find the N th partial sums of geometric series and
More informationPRICING THE ASIAN CALL OPTION
PRICING HE ASIAN CALL OPION VINH XUAN DANG, SCO GLASGOW, HARRISON POER, SEPHEN AYLOR ABSRAC. Background material on measure-theoretic probability theory and stochastic calculus is provided in order to
More information