Deviations from the Mean
|
|
- Dinah Edwards
- 5 years ago
- Views:
Transcription
1 Deviations from the Mean The Markov inequality for non-negative RVs Variance Definition The Bienaymé Inequality For independent RVs The Chebyeshev Inequality
2 Markov s Inequality For any non-negative random variable X p(x a) apple E(X) a
3 Variance Deviation: The deviation of X at s S is X(s) E(X), the difference between the value of X at s, and the mean of X Variance: Let X be a random variable on the sample space S. The variance of X, denoted by V(X), is the weighted average of the square of the deviation of X ( ) = X ( s) E ( X ) V X s S ( ). ( ) 2 p s Standard Deviation: The standard deviation of X, denoted by σ(x), is defined to be V ( X).
4 Variance Theorem : If X is a random variable on a sample space S, then V(X) = E(X 2 ) E(X) 2 Theorem: If X is a random variable on a sample space S and E(X) = μ, then V(X) = E((X μ) 2 )
5 Variance Example: What is the variance of the random variable X, where X(t) = 1 if a coin toss results in a HEAD and 0 if it results in a TAIL, where p is the probability of HEAD and q = 1-p is the probability of TAIL? Solution: Because X takes only the values 0 and 1, it follows that X 2 (t) = X(t). Hence, 2 2 V X = E X - E X = p - p 2 = p 1 - p = pq. ( ) ( ) ( ) ( ) Variance of the Value of a Die: What is the variance of a random variable X, where X is the number that comes up when a fair die is rolled? 2 Solution: We have ( ) ( ) ( ) 2 V X = E X - E X. We seen earlier that E(X) = 7/2. Note that ( ) ( ) E X = 1/ = 91/ 6. We conclude that V ( X) 91 æ7ö 35 = - ç =. 6 è 2ø 12 2
6 Independent Random Variables Definition: The events E and F on a sample space S are independent if and only if p EÇ F = p E p F ( ) ( ) ( ). Definition: Random variables X and Y on a sample space S are independent if and only if p(x = r 1 and Y = r 2 ) = p(x = r 1 ) p(y = r 2 ) for all r 1, r 2 Theorem: If X and Y are independent RVs on a sample space S, then E(XY) = E(X)E(Y).
7 Variance Bienaymé s Formula: If X and Y are two independent random variables on a sample space S, then V(X + Y) = V(X) + V(Y) Generalization: if X i, i = 1,2,,n, with n a positive integer, are pairwise independent random variables on S, then V( X 1 + X 2 +!+ X ) n = V( X ) 1 + V( X ) 2 +!+ V( X n ). Linearity of variance only for independent RVs
8 Variance Example: Find the variance of the number of HEADS when a coin is tossed n times, where on each toss, p is the probability of HEADS and q is the probability of TAILS. Solution: Let X i be the random variable with X i ((t 1, t 2,., t n )) = 1 if the i th toss is a HEADS 0 if it is a TAILS. Let X = X 2 + X 3 +. X n. Then X counts the number of successes in the n trials. By Bienaymé s Formula, it follows that V(X)= V(X 1 ) + V(X 2 ) + + V(X n ). By the previous example,v(x i ) = pq for i = 1,2,,n. Hence, V(X) = npq.
9 Chebyshev s Inequality Chebyschev s Inequality: Let X be a random variable on a sample space S. 2 ( ( ) - ( ) ³ ) ( ) p X s E X r V X r. for any positive real number r.
10 Chebyshev s Inequality Example: Suppose that X is a random variable that counts the number of tails when a fair coin is tossed n times. (Hence E(X) = n/2 and V(X) = n/4, according to our previous examples.) Chebyschev s inequality with r = n: ( ( ) ) ( ) ( ) 2 p X s - n/ 2 ³ n n/ 4 n = 1/ 4. This means that the probability that the number of tails that come up on n tosses deviates from the mean, n/2, by more than n is no larger than ¼.
11 RELATIONS (From Chapter 9)
12 Topics we will cover Binary Relations definition, notation, and terminology We won t do n-ary relations for n>2 (useful in databases) The reflexive, symmetric, and transitive properties Equivalence relations and equivalence classes Combining relations Composing relations
13 Binary Relations Definition: A binary relation R from a set A to a set B is a subset RÍ A B. Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B. We can represent relations from a set A to a set B graphically or using a table Relations are more general than functions. A function is a relation where exactly one element of B is related to each element of A.
14 Binary Relations on a (single) Set Definition: A binary relation R on a set A is a subset of A A or a relation from A to A. Example: Let A = {a,b,c}. Then R = {(a,a),(a,b), (a,c)} is a relation on A. Let A = {1, 2, 3, 4}. The ordered pairs in the relation R = {(a,b) a divides b} are (1,1), (1, 2), (1,3), (1, 4), (2, 2), (2, 4), (3, 3), and (4, 4).
15 Question: How many different relations are there on a set A with A = n? A relation on A is a subset of A X A How many elements in A X A? n 2 How many distinct subsets of A X A? 2^(n 2 ) Hence, 2^(n 2 ) different relations can be defined on A
16 Binary Relations on a Set Example: Consider these relations on the set of integers: ( ) { } R = a, b a b, ( ) { } R = a, b a > b, ( ) { } R = a, b a = b or a =-b, ( ) { } R = a, b a = b, ( ) { } R = a, b a = b+ 1, ( ) { } R = a, b a+ b 3. (Note that these relations are on an infinite set and each of these relations is an infinite set.) Which of these relations contain each of the pairs (1,1), (1, 2), (2, 1), (1, 1), and (2, 2)? Solution: Checking the conditions that define each relation, we see that the pair (1,1) is in R 1, R 3, R 4, and R 6 : (1,2) is in R 1 and R 6 : (2,1) is in R 2, R 5, and R 6 : (1, 1) is in R 2, R 3, and R 6 : (2,2) is in R 1, R 3, and R 4.
17 Properties A binary relation R from a set A to a set B is a subset of A X B A binary relation R on a (single) set A is a subset of A X A Properties of binary relations on a set A: Reflexive Symmetric Transitive Antisymmetric
18 Properties Which of these relations are reflexive, symmetric, transitive, and anti-symmetric? Reflexive: R 1, R 3, R 4 Symmetric: R 3, R 4, R 6 Transitive: R 1 R 4 Anti-symmetric: R 1, R 2, R 4, R 5
19 Combining Relations Since relations are sets, we can combine any relations R 1 and R 2 using basic set operations to form new relations such as R 1 R 2, R 1 R 2, R 1 R 2, and R 2 R 1. Example: Let A = {1,2,3} and B = {1,2,3,4}. The relations R 1 = {(1,1),(2,2),(3,3)} and R 2 = {(1,1),(1,2),(1,3),(1,4)} can be combined using basic set operations to form new relations R 1 R 2 =? R 1 R 2 =? R 1 R 2 =? R 2 R 1 =?
20 Composition Definition: Suppose R 1 is a relation from a set A to a set B. R 2 is a relation from B to a set C. Then the composition (or composite) of R 2 with R 1, denoted R 2 R 1, is a relation from A to C where (x,z) is a member of R 2 R 1 if and only if (x,y) is a member of R 1 and (y,z) is a member of R 2 Example. Let S 1 = {a, b, c}, S 2 = {m, n, o, p} and S 3 = {w, x, y, z} Let R 1 = {(a, p), (b, m)} and R 2 = {(m,x), (m, z), (n, w)} Determine R 2 R 1 Answer: {(b,x), (b, z)}
21 Powers of a Relation (Used in defining Equivalence Classes) Definition: The powers R n of binary relation R on a set A is defined inductively by: Basis Step: R 1 = R Inductive Step: R n+1 = R n R The powers of a transitive relation are subsets of the relation: Theorem: The relation R on a set A is transitive iff R n R for n = 1,2,3. (Easily proved by mathematical induction)
22 Equivalence Relations Definition: A relation on a set A is called an equivalence relation if it is reflexive, symmetric, and transitive. Definition: Two elements a, and b that are related by an equivalence relation are called equivalent. The notation a b is often used to denote that a and b are equivalent elements with respect to a particular equivalence relation.
23 Strings Example: Suppose that R is the relation on the set of strings of English letters such that arb if and only if l(a) = l(b), where l(x) is the length of the string x. Is R an equivalence relation? Solution: Do the the properties of an equivalence relation hold? Reflexivity: Because l(a) = l(a), it follows that ara for all strings a. Symmetry: Suppose that arb. Since l(a) = l(b), l(b) = l(a) also holds and bra. Transitivity: Suppose that arb and brc. Since l(a) = l(b),and l(b) = l(c), l(a) = l(a) also holds and arc. Hence, R is an equivalence relation
24 Congruence Modulo m Example: Let m be an integer > 1. Is the relation R = {(a,b) a b (mod m)} an equivalence relation on the set of integers? Solution: Recall that a b (mod m) if and only if m divides a b. Reflexivity: a a (mod m) since a a = 0 is divisible by m since 0 = 0 m. Symmetry: Suppose that a b (mod m). Then a b is divisible by m, and so a b = km, where k is an integer. It follows that b a = ( k) m, so b a (mod m). Transitivity: Suppose that a b (mod m) and b c (mod m). There are integers k 1 and k 2 with a b = k 1 m and b c = k 2 m. We obtain by adding the equations: a c = (a b) + (b c) = k 1 m + k 2 m = (k 1 + k 2 ) m. Hence, R is an equivalence relation
25 Divides Example: Is the divides relation on the set of positive integers an equivalence relation? Solution: Reflexivity: a a for all a. Symmetry: For example, 2 4, but 4 2. Hence, the relation is not symmetric. Transitivity: Suppose that a divides b and b divides c. Then there are positive integers k and l such that b = ak and c = bl. Hence, c = a(kl), so a divides c. Therefore, the relation is transitive. Hence, divides is not an equivalence relation.
26 Equivalence Classes Definition: Let R be an equivalence relation on a set A. The set of all elements that are related to an element a of A is called the equivalence class of a. The equivalence class of a with respect to R is denoted by [a] R. Note that { } [ ] ( ) a = s a, s ÎR. R When only one relation is under consideration, we can write [a], without the subscript R, for this equivalence class. If b [a] R, then b is called a representative of this equivalence class. Any element of a class can be used as a representative of the class.
27 Equivalence Classes
Section Summary. Relations and Functions Properties of Relations. Combining Relations
Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included
More informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Chapter 9 1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B.
More informationCSC Discrete Math I, Spring Relations
CSC 125 - Discrete Math I, Spring 2017 Relations Binary Relations Definition: A binary relation R from a set A to a set B is a subset of A B Note that a relation is more general than a function Example:
More informationRelations. Relations of Sets N-ary Relations Relational Databases Binary Relation Properties Equivalence Relations. Reading (Epp s textbook)
Relations Relations of Sets N-ary Relations Relational Databases Binary Relation Properties Equivalence Relations Reading (Epp s textbook) 8.-8.3. Cartesian Products The symbol (a, b) denotes the ordered
More informationRelations. Binary Relation. Let A and B be sets. A (binary) relation from A to B is a subset of A B. Notation. Let R A B be a relation from A to B.
Relations Binary Relation Let A and B be sets. A (binary) relation from A to B is a subset of A B. Notation Let R A B be a relation from A to B. If (a, b) R, we write a R b. 1 Binary Relation Example:
More informationDiscrete Probability Refresher
ECE 1502 Information Theory Discrete Probability Refresher F. R. Kschischang Dept. of Electrical and Computer Engineering University of Toronto January 13, 1999 revised January 11, 2006 Probability theory
More informationAutomata and Languages
Automata and Languages Prof. Mohamed Hamada Software Engineering Lab. The University of Aizu Japan Mathematical Background Mathematical Background Sets Relations Functions Graphs Proof techniques Sets
More informationRandom variables (discrete)
Random variables (discrete) Saad Mneimneh 1 Introducing random variables A random variable is a mapping from the sample space to the real line. We usually denote the random variable by X, and a value that
More informationLecture 13 (Part 2): Deviation from mean: Markov s inequality, variance and its properties, Chebyshev s inequality
Lecture 13 (Part 2): Deviation from mean: Markov s inequality, variance and its properties, Chebyshev s inequality Discrete Structures II (Summer 2018) Rutgers University Instructor: Abhishek Bhrushundi
More information14 Equivalence Relations
14 Equivalence Relations Tom Lewis Fall Term 2010 Tom Lewis () 14 Equivalence Relations Fall Term 2010 1 / 10 Outline 1 The definition 2 Congruence modulo n 3 Has-the-same-size-as 4 Equivalence classes
More informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Section 9.1 Rela%onships Relationships between elements of sets occur in many contexts. Every day we deal with relationships such as those between a business and its telephone number, an employee and his
More informationDiscrete Probability
MAT 258 Discrete Mathematics Discrete Probability Kenneth H. Rosen and Kamala Krithivasan Discrete Mathematics 7E Global Edition Chapter 7 Reproduced without explicit consent Fall 2016 Week 11 Probability
More informationMore than one variable
Chapter More than one variable.1 Bivariate discrete distributions Suppose that the r.v. s X and Y are discrete and take on the values x j and y j, j 1, respectively. Then the joint p.d.f. of X and Y, to
More informationJoint Distribution of Two or More Random Variables
Joint Distribution of Two or More Random Variables Sometimes more than one measurement in the form of random variable is taken on each member of the sample space. In cases like this there will be a few
More information1.4 Equivalence Relations and Partitions
24 CHAPTER 1. REVIEW 1.4 Equivalence Relations and Partitions 1.4.1 Equivalence Relations Definition 1.4.1 (Relation) A binary relation or a relation on a set S is a set R of ordered pairs. This is a very
More informationRandom Variables. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay
1 / 13 Random Variables Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay August 8, 2013 2 / 13 Random Variable Definition A real-valued
More informationReview of Probability. CS1538: Introduction to Simulations
Review of Probability CS1538: Introduction to Simulations Probability and Statistics in Simulation Why do we need probability and statistics in simulation? Needed to validate the simulation model Needed
More informationX = X X n, + X 2
CS 70 Discrete Mathematics for CS Fall 2003 Wagner Lecture 22 Variance Question: At each time step, I flip a fair coin. If it comes up Heads, I walk one step to the right; if it comes up Tails, I walk
More information1 INFO Sep 05
Events A 1,...A n are said to be mutually independent if for all subsets S {1,..., n}, p( i S A i ) = p(a i ). (For example, flip a coin N times, then the events {A i = i th flip is heads} are mutually
More informationReading 11 : Relations and Functions
CS/Math 240: Introduction to Discrete Mathematics Fall 2015 Reading 11 : Relations and Functions Instructor: Beck Hasti and Gautam Prakriya In reading 3, we described a correspondence between predicates
More informationRelationships between elements of sets occur in many contexts. Every day we deal with
C H A P T E R 9 Relations 9.1 Relations and Their Properties 9.2 n-ary Relations and Their Applications 9.3 Representing Relations 9.4 Closures of Relations 9.5 Equivalence Relations 9.6 Partial Orderings
More informationRelations. We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples.
Relations We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples. Relations use ordered tuples to represent relationships among
More informationBADHAN ACADEMY OF MATHS CONTACT FOR HOMETUTOR, FOR 11 th 12 th B.B.A, B.C.A, DIPLOMA,SAT,CAT SSC 1.2 RELATIONS CHAPTER AT GLANCE
BADHAN ACADEMY OF MATHS 9804435 CONTACT FOR HOMETUTOR, FOR th 2 th B.B.A, B.C.A, DIPLOMA,SAT,CAT SSC.2 RELATIONS CHAPTER AT GLANCE. RELATIONS : Let A and B be two non- empty sets. A relation from set A
More informationCOMP 182 Algorithmic Thinking. Relations. Luay Nakhleh Computer Science Rice University
COMP 182 Algorithmic Thinking Relations Luay Nakhleh Computer Science Rice University Chapter 9, Section 1-6 Reading Material When we defined the Sorting Problem, we stated that to sort the list, the elements
More informationMath 2534 Solution to Test 3A Spring 2010
Math 2534 Solution to Test 3A Spring 2010 Problem 1: (10pts) Prove that R is a transitive relation on Z when given that mrpiff m pmod d (ie. d ( m p) ) Solution: The relation R is transitive, if arb and
More informationWeek 12-13: Discrete Probability
Week 12-13: Discrete Probability November 21, 2018 1 Probability Space There are many problems about chances or possibilities, called probability in mathematics. When we roll two dice there are possible
More informationSTAT 430/510 Probability Lecture 7: Random Variable and Expectation
STAT 430/510 Probability Lecture 7: Random Variable and Expectation Pengyuan (Penelope) Wang June 2, 2011 Review Properties of Probability Conditional Probability The Law of Total Probability Bayes Formula
More informationIntroduction to Cryptography CS 355 Lecture 3
Introduction to Cryptography CS 355 Lecture 3 Elementary Number Theory (1) CS 355 Fall 2005/Lecture 3 1 Review of Last Lecture Ciphertext-only attack: Known-plaintext attack: Chosen-plaintext: Chosen-ciphertext:
More informationLecture 4: Probability and Discrete Random Variables
Error Correcting Codes: Combinatorics, Algorithms and Applications (Fall 2007) Lecture 4: Probability and Discrete Random Variables Wednesday, January 21, 2009 Lecturer: Atri Rudra Scribe: Anonymous 1
More informationMATHEMATICS 154, SPRING 2009 PROBABILITY THEORY Outline #11 (Tail-Sum Theorem, Conditional distribution and expectation)
MATHEMATICS 154, SPRING 2009 PROBABILITY THEORY Outline #11 (Tail-Sum Theorem, Conditional distribution and expectation) Last modified: March 7, 2009 Reference: PRP, Sections 3.6 and 3.7. 1. Tail-Sum Theorem
More informationMonty Hall Puzzle. Draw a tree diagram of possible choices (a possibility tree ) One for each strategy switch or no-switch
Monty Hall Puzzle Example: You are asked to select one of the three doors to open. There is a large prize behind one of the doors and if you select that door, you win the prize. After you select a door,
More informationBasic Probability. Introduction
Basic Probability Introduction The world is an uncertain place. Making predictions about something as seemingly mundane as tomorrow s weather, for example, is actually quite a difficult task. Even with
More informationTopic 3: The Expectation of a Random Variable
Topic 3: The Expectation of a Random Variable Course 003, 2017 Page 0 Expectation of a discrete random variable Definition (Expectation of a discrete r.v.): The expected value (also called the expectation
More informationWriting Assignment 2 Student Sample Questions
Writing Assignment 2 Student Sample Questions 1. Let P and Q be statements. Then the statement (P = Q) ( P Q) is a tautology. 2. The statement If the sun rises from the west, then I ll get out of the bed.
More informationMath 151. Rumbos Fall Solutions to Review Problems for Exam 2. Pr(X = 1) = ) = Pr(X = 2) = Pr(X = 3) = p X. (k) =
Math 5. Rumbos Fall 07 Solutions to Review Problems for Exam. A bowl contains 5 chips of the same size and shape. Two chips are red and the other three are blue. Draw three chips from the bowl at random,
More informationSection 7.1 Relations and Their Properties. Definition: A binary relation R from a set A to a set B is a subset R A B.
Section 7.1 Relations and Their Properties Definition: A binary relation R from a set A to a set B is a subset R A B. Note: there are no constraints on relations as there are on functions. We have a common
More informationAlex Psomas: Lecture 17.
Alex Psomas: Lecture 17. Random Variables: Expectation, Variance 1. Random Variables, Expectation: Brief Review 2. Independent Random Variables. 3. Variance Random Variables: Definitions Definition A random
More informationLecture 10: Bayes' Theorem, Expected Value and Variance Lecturer: Lale Özkahya
BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 10: Bayes' Theorem, Expected Value and Variance Lecturer: Lale Özkahya Resources: Kenneth Rosen, Discrete
More informationCOT3100 SI Final Exam Review
1 Symbols COT3100 SI Final Exam Review Jarrett Wendt Spring 2018 You ve learned a plethora of new Mathematical symbols this semester. Let s see if you know them all and what they re used for. How many
More informationRelations, Functions, Binary Relations (Chapter 1, Sections 1.2, 1.3)
Relations, Functions, Binary Relations (Chapter 1, Sections 1.2, 1.3) CmSc 365 Theory of Computation 1. Relations Definition: Let A and B be two sets. A relation R from A to B is any set of ordered pairs
More informationNotes 6 Autumn Example (One die: part 1) One fair six-sided die is thrown. X is the number showing.
MAS 08 Probability I Notes Autumn 005 Random variables A probability space is a sample space S together with a probability function P which satisfies Kolmogorov s aioms. The Holy Roman Empire was, in the
More informationRelations. P. Danziger. We may represent a relation by a diagram in which a line is drawn between two elements if they are related.
- 10 Relations P. Danziger 1 Relations (10.1) Definition 1 1. A relation from a set A to a set B is a subset R of A B. 2. Given (x, y) R we say that x is related to y and write xry. 3. If (x, y) R we say
More informationExpectation of Random Variables
1 / 19 Expectation of Random Variables Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay February 13, 2015 2 / 19 Expectation of Discrete
More informationRandom Variables. Cumulative Distribution Function (CDF) Amappingthattransformstheeventstotherealline.
Random Variables Amappingthattransformstheeventstotherealline. Example 1. Toss a fair coin. Define a random variable X where X is 1 if head appears and X is if tail appears. P (X =)=1/2 P (X =1)=1/2 Example
More informationChapter 6. Relations. 6.1 Relations
Chapter 6 Relations Mathematical relations are an extremely general framework for specifying relationships between pairs of objects. This chapter surveys the types of relations that can be constructed
More informationThe main limitation of the concept of a. function
Relations The main limitation of the concept of a A function, by definition, assigns one output to each input. This means that a function cannot model relationships between sets where some objects on each
More informationChapter 9: Relations Relations
Chapter 9: Relations 9.1 - Relations Definition 1 (Relation). Let A and B be sets. A binary relation from A to B is a subset R A B, i.e., R is a set of ordered pairs where the first element from each pair
More informationDiscrete Mathematics. Benny George K. September 22, 2011
Discrete Mathematics Benny George K Department of Computer Science and Engineering Indian Institute of Technology Guwahati ben@iitg.ernet.in September 22, 2011 Set Theory Elementary Concepts Let A and
More informationUCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis
UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis Lecture 10 Class URL: http://vlsicad.ucsd.edu/courses/cse21-s14/ Lecture 10 Notes Midterm Good job overall! = 81; =
More informationSolutions to In Class Problems Week 4, Mon.
Massachusetts Institute of Technology 6.042J/18.062J, Fall 05: Mathematics for Computer Science September 26 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised September 26, 2005, 1050 minutes Solutions
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More information5 CORRELATION. Expectation of the Binomial Distribution I The Binomial distribution can be defined as: P(X = r) = p r q n r where p + q = 1 and 0 r n
5 CORRELATION The covariance of two random variables gives some measure of their independence. A second way of assessing the measure of independence will be discussed shortly but first the expectation
More information3. Which of these numbers does not belong to the set of solutions of the inequality 4
Math Field Day Exam 08 Page. The number is equal to b) c) d) e). Consider the equation 0. The slope of this line is / b) / c) / d) / e) None listed.. Which of these numbers does not belong to the set of
More information9. DISCRETE PROBABILITY DISTRIBUTIONS
9. DISCRETE PROBABILITY DISTRIBUTIONS Random Variable: A quantity that takes on different values depending on chance. Eg: Next quarter s sales of Coca Cola. The proportion of Super Bowl viewers surveyed
More informationProbability Theory Review
Cogsci 118A: Natural Computation I Lecture 2 (01/07/10) Lecturer: Angela Yu Probability Theory Review Scribe: Joseph Schilz Lecture Summary 1. Set theory: terms and operators In this section, we provide
More informationConditional distributions (discrete case)
Conditional distributions (discrete case) The basic idea behind conditional distributions is simple: Suppose (XY) is a jointly-distributed random vector with a discrete joint distribution. Then we can
More informationPart (A): Review of Probability [Statistics I revision]
Part (A): Review of Probability [Statistics I revision] 1 Definition of Probability 1.1 Experiment An experiment is any procedure whose outcome is uncertain ffl toss a coin ffl throw a die ffl buy a lottery
More informationKousha Etessami. U. of Edinburgh, UK. Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 7) 1 / 13
Discrete Mathematics & Mathematical Reasoning Chapter 7 (continued): Markov and Chebyshev s Inequalities; and Examples in probability: the birthday problem Kousha Etessami U. of Edinburgh, UK Kousha Etessami
More informationMore on Distribution Function
More on Distribution Function The distribution of a random variable X can be determined directly from its cumulative distribution function F X. Theorem: Let X be any random variable, with cumulative distribution
More informationSUMMARY OF PROBABILITY CONCEPTS SO FAR (SUPPLEMENT FOR MA416)
SUMMARY OF PROBABILITY CONCEPTS SO FAR (SUPPLEMENT FOR MA416) D. ARAPURA This is a summary of the essential material covered so far. The final will be cumulative. I ve also included some review problems
More informationCourse 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography
Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2006 Contents 9 Introduction to Number Theory and Cryptography 1 9.1 Subgroups
More information1 Sequences of events and their limits
O.H. Probability II (MATH 2647 M15 1 Sequences of events and their limits 1.1 Monotone sequences of events Sequences of events arise naturally when a probabilistic experiment is repeated many times. For
More informationSets and Motivation for Boolean algebra
SET THEORY Basic concepts Notations Subset Algebra of sets The power set Ordered pairs and Cartesian product Relations on sets Types of relations and their properties Relational matrix and the graph of
More information18.440: Lecture 19 Normal random variables
18.440 Lecture 19 18.440: Lecture 19 Normal random variables Scott Sheffield MIT Outline Tossing coins Normal random variables Special case of central limit theorem Outline Tossing coins Normal random
More information2. Variance and Covariance: We will now derive some classic properties of variance and covariance. Assume real-valued random variables X and Y.
CS450 Final Review Problems Fall 08 Solutions or worked answers provided Problems -6 are based on the midterm review Identical problems are marked recap] Please consult previous recitations and textbook
More information9 RELATIONS. 9.1 Reflexive, symmetric and transitive relations. MATH Foundations of Pure Mathematics
MATH10111 - Foundations of Pure Mathematics 9 RELATIONS 9.1 Reflexive, symmetric and transitive relations Let A be a set with A. A relation R on A is a subset of A A. For convenience, for x, y A, write
More informationDiscrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 20
CS 70 Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 20 Today we shall discuss a measure of how close a random variable tends to be to its expectation. But first we need to see how to compute
More informationrandom variables T T T T H T H H
random variables T T T T H T H H random variables A random variable X assigns a real number to each outcome in a probability space. Ex. Let H be the number of Heads when 20 coins are tossed Let T be the
More informationCS280, Spring 2004: Final
CS280, Spring 2004: Final 1. [4 points] Which of the following relations on {0, 1, 2, 3} is an equivalence relation. (If it is, explain why. If it isn t, explain why not.) Just saying Yes or No with no
More informationLESSON RELATIONS & FUNCTION THEORY
2 Definitions LESSON RELATIONS & FUNCTION THEORY Ordered Pair Ordered pair of elements taken from any two sets P and Q is a pair of elements written in small brackets and grouped together in a particular
More informationChapter 2 - Relations
Chapter 2 - Relations Chapter 2: Relations We could use up two Eternities in learning all that is to be learned about our own world and the thousands of nations that have arisen and flourished and vanished
More informationWeek 2. Review of Probability, Random Variables and Univariate Distributions
Week 2 Review of Probability, Random Variables and Univariate Distributions Probability Probability Probability Motivation What use is Probability Theory? Probability models Basis for statistical inference
More informationCSC Discrete Math I, Spring Discrete Probability
CSC 125 - Discrete Math I, Spring 2017 Discrete Probability Probability of an Event Pierre-Simon Laplace s classical theory of probability: Definition of terms: An experiment is a procedure that yields
More informationNotes on the second moment method, Erdős multiplication tables
Notes on the second moment method, Erdős multiplication tables January 25, 20 Erdős multiplication table theorem Suppose we form the N N multiplication table, containing all the N 2 products ab, where
More informationJUSTIN HARTMANN. F n Σ.
BROWNIAN MOTION JUSTIN HARTMANN Abstract. This paper begins to explore a rigorous introduction to probability theory using ideas from algebra, measure theory, and other areas. We start with a basic explanation
More information2.1 Lecture 5: Probability spaces, Interpretation of probabilities, Random variables
Chapter 2 Kinetic Theory 2.1 Lecture 5: Probability spaces, Interpretation of probabilities, Random variables In the previous lectures the theory of thermodynamics was formulated as a purely phenomenological
More informationCHAPTER 1. Relations. 1. Relations and Their Properties. Discussion
CHAPTER 1 Relations 1. Relations and Their Properties 1.1. Definition of a Relation. Definition 1.1.1. A binary relation from a set A to a set B is a subset R A B. If (a, b) R we say a is Related to b
More informationProbability Theory and Simulation Methods
Feb 28th, 2018 Lecture 10: Random variables Countdown to midterm (March 21st): 28 days Week 1 Chapter 1: Axioms of probability Week 2 Chapter 3: Conditional probability and independence Week 4 Chapters
More informationDept. of Linguistics, Indiana University Fall 2015
L645 Dept. of Linguistics, Indiana University Fall 2015 1 / 34 To start out the course, we need to know something about statistics and This is only an introduction; for a fuller understanding, you would
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Determine whether a relation is an equivalence relation by determining whether it is Reflexive Symmetric
More informationM378K In-Class Assignment #1
The following problems are a review of M6K. M7K In-Class Assignment # Problem.. Complete the definition of mutual exclusivity of events below: Events A, B Ω are said to be mutually exclusive if A B =.
More informationRandom Variables Chris Piech CS109, Stanford University. Piech, CS106A, Stanford University
Random Variables Chris Piech CS109, Stanford University Piech, CS106A, Stanford University Piech, CS106A, Stanford University Let s Play a Game Game set-up We have a fair coin (come up heads with p = 0.5)
More informationBinomial and Poisson Probability Distributions
Binomial and Poisson Probability Distributions Esra Akdeniz March 3, 2016 Bernoulli Random Variable Any random variable whose only possible values are 0 or 1 is called a Bernoulli random variable. What
More informationAutomata Theory for Presburger Arithmetic Logic
Automata Theory for Presburger Arithmetic Logic References from Introduction to Automata Theory, Languages & Computation and Constraints in Computational Logic Theory & Application Presented by Masood
More information1 Stat 605. Homework I. Due Feb. 1, 2011
The first part is homework which you need to turn in. The second part is exercises that will not be graded, but you need to turn it in together with the take-home final exam. 1 Stat 605. Homework I. Due
More informationNotes. Relations. Introduction. Notes. Relations. Notes. Definition. Example. Slides by Christopher M. Bourke Instructor: Berthe Y.
Relations Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 7.1, 7.3 7.5 of Rosen cse235@cse.unl.edu
More informationThis exam contains 5 pages (including this cover page) and 4 questions. The total number of points is 100. Grade Table
MAT115A-21 Summer Session 2 2018 Practice Final Solutions Name: Time Limit: 1 Hour 40 Minutes Instructor: Nathaniel Gallup This exam contains 5 pages (including this cover page) and 4 questions. The total
More informationLecture 4.3: Closures and Equivalence Relations
Lecture 4.3: Closures and CS 250, Discrete Structures, Fall 2015 Nitesh Saxena Adopted from previous lectures by Cinda Heeren Course Admin Mid-Term 2 Exam Solution will be posted soon Should have the results
More informationNotes 12 Autumn 2005
MAS 08 Probability I Notes Autumn 005 Conditional random variables Remember that the conditional probability of event A given event B is P(A B) P(A B)/P(B). Suppose that X is a discrete random variable.
More information1 Presessional Probability
1 Presessional Probability Probability theory is essential for the development of mathematical models in finance, because of the randomness nature of price fluctuations in the markets. This presessional
More informationDiscrete Random Variables
CPSC 53 Systems Modeling and Simulation Discrete Random Variables Dr. Anirban Mahanti Department of Computer Science University of Calgary mahanti@cpsc.ucalgary.ca Random Variables A random variable is
More informationSome Basic Concepts of Probability and Information Theory: Pt. 2
Some Basic Concepts of Probability and Information Theory: Pt. 2 PHYS 476Q - Southern Illinois University January 22, 2018 PHYS 476Q - Southern Illinois University Some Basic Concepts of Probability and
More informationTopic 3 Random variables, expectation, and variance, II
CSE 103: Probability and statistics Fall 2010 Topic 3 Random variables, expectation, and variance, II 3.1 Linearity of expectation If you double each value of X, then you also double its average; that
More informationCS37300 Class Notes. Jennifer Neville, Sebastian Moreno, Bruno Ribeiro
CS37300 Class Notes Jennifer Neville, Sebastian Moreno, Bruno Ribeiro 2 Background on Probability and Statistics These are basic definitions, concepts, and equations that should have been covered in your
More informationIAM 530 ELEMENTS OF PROBABILITY AND STATISTICS LECTURE 3-RANDOM VARIABLES
IAM 530 ELEMENTS OF PROBABILITY AND STATISTICS LECTURE 3-RANDOM VARIABLES VARIABLE Studying the behavior of random variables, and more importantly functions of random variables is essential for both the
More information2. Suppose (X, Y ) is a pair of random variables uniformly distributed over the triangle with vertices (0, 0), (2, 0), (2, 1).
Name M362K Final Exam Instructions: Show all of your work. You do not have to simplify your answers. No calculators allowed. There is a table of formulae on the last page. 1. Suppose X 1,..., X 1 are independent
More informationDiscrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland
Discrete Mathematics W. Ethan Duckworth Fall 2017, Loyola University Maryland Contents 1 Introduction 4 1.1 Statements......................................... 4 1.2 Constructing Direct Proofs................................
More informationOutline. We will now investigate the structure of this important set.
The Reals Outline As we have seen, the set of real numbers, R, has cardinality c. This doesn't tell us very much about the reals, since there are many sets with this cardinality and cardinality doesn't
More informationUCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis
UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis Lecture 10 Class URL: http://vlsicad.ucsd.edu/courses/cse21-s14/ Lecture 10 Notes Midterm Good job overall! = 81; =
More informationChapter 2. Random Variable. Define single random variables in terms of their PDF and CDF, and calculate moments such as the mean and variance.
Chapter 2 Random Variable CLO2 Define single random variables in terms of their PDF and CDF, and calculate moments such as the mean and variance. 1 1. Introduction In Chapter 1, we introduced the concept
More information