Discrete and Continuous Random Variables

Size: px
Start display at page:

Download "Discrete and Continuous Random Variables"

Transcription

1 Discrete and Continuous Random Variables Friday, January 31, :03 PM Homework 1 will be posted over the weekend; due in a couple of weeks. Important examples of random variables on discrete state spaces 1. Random variables on finite state spaces. Then, up to isomorphism, one can number the states as (or other choices like ) would be a way to represent a state space with a finite number M elements. One then simply defines a probability distribution for such that and. We had an example of this in last lecture for the disease state of an immigrant from a country with endemic TB, with M=3. a. By the definition of some textbooks, the example I gave might not be considered a random variable because some books require that state spaces always be subsets of real or complex Euclidean space. b. An important special case of a probability distribution on finite state spaces is the uniform distribution (aka classical probability models) where all possible values occur with equal probability. That is, if the state space has cardinality, then for all. It's just like M-sided dice in Dungeons and Dragons, whatever that is. 2. Infinite discrete state spaces are, by definition of "discrete", countably infinite, meaning they can be put into a one-to-one correpsondence with the set of integers. Typical examples are: or or or or a subset of one of these. Integer lattice state spaces could represent discretized space in applications in atomic physics, ecology. Stoch14 Page 1

2 A particularly widely used example of a random variable on a countably infinite discrete state space is the Poisson random variable for The Poisson distribution involves one parameter which must be positive and in fact can be shown to be equal to the mean of the Poisson distribution:. So what's so special about this particular probability distribution? It appears in a wide variety of applications because of the Poisson limit theorem (which is an analogue of the central limit theorem which explains why Gaussian/normal random variables appear so frequently). If one is quantifying the total number of occurrences of some incident, and if the incident itself can be represented as a sum of a large number of independent rare incidents, then the quantity of interest can be well modelled by a Poisson distribution. Common application of this idea: The number of incoming "agents" to a "node" over some time interval customers at a store, cars entering an entrance ramp on an expressway, demands on a server, incoming pulses to a neuron Another important probability distribution on the whole numbers (nonnegative integers) is the geometric distribution: for Geometric distribution also requires one parameter to specify it. The canonical way of thinking about the geometric distribution is that one is taking an unbounded sequence of repeated independent trials, with each trial having a success probability of p. The geometric distribution describes how many failures occur before the first success. Note that you'll see geometric distribution defined with variations of this idea, i.e., the number of trials you need until the first success, in which case x is shifted by 1. This distribution appears in discrete-time stochastic processes because it is the only probability distribution on the set of nonnegative integers that has the Stoch14 Page 2

3 memoryless property. (Lack of memory means that the success or failure probability at a given epoch does not depend on the success or failure at previous epochs.) Random variables on continuous state space One cannot take the tactic of simply defining the probability for the random variable to take any given value in the state space, otherwise, one runs into contradictions due to the uncountable infinities involved. The reason one can't define a probability distribution simply in terms of probabilities of singletons is the same reason that in continuum mechanics, one does not try to talk about the mass at a given point. The resolution is to describe the continuously distributed quantity in terms of density (i.e., mass density in continuum solid or fluid mechanics). One can do the same for a broad range of continuously distributed random variables. Definition: An absolutely continuously distributed random variable X is a random variable whose probability distribution can be expressed in terms of a function, called a probability density which has the property that: for all where and In practice, that means one can define an absolutely continuous random variable by specifying any probability density satisfying the above properties. Beware that the probability density is not a probability! So there's no reason that Some important examples (for us) of absolutely continuous random variable models are: 1. Uniform distribution (X is uniformly distributed on the interval [a,b]), Stoch14 Page 3

4 Or equivalently (perhaps more commonly), one takes, 2. Probabilities are obtained by integrating the probability density over the set of interest. The built in random number generator in most operating systems and software distributions is a pseudorandom algorithm for simulating U(0,1). Exponential distribution is another particularly useful absolutely continuous probability distribution. or where is a single parameter needed to define the distribution. One can check that Stoch14 Page 4

5 Now we have a nonuniform probability density, what does it actually mean? To be really precise, one should always talk about the probability for the random variable to fall in nice (Borel) sets like intervals, and for a given interval size, the probability the random variable will fall in that interval is generally larger if the probability density is larger there. And if one wants to give the probability density itself meaning, then one can show using the mean value theorem that, if is continuous at then: The exponential distribution arises frequently in stochastic processes when one is describing the amount of time to wait until some random event occurs (in continuous time) when the waiting time has a memoryless property meaning that the amount of time you have left to wait does not depend on how long you have been waiting. In mathematical terms this means that if is a random variable that is memoryless in this sense, we want: Stoch14 Page 5

6 The exponential distribution is the only absolutely continuous probability distribution that satisfies this memoryless equation, and the geometric distribution is the only discrete probability distribution that satisfies this equation. It's no accident they're both self-similar distributions. And this can be formulated as a rigorous theorem. Of course Gaussian/normal distributions are another very widely used class of absolutely continuous probability distributions, but we won't see much of them in this class. Not every random variable need be discrete or absolutely continuous. There are hybrid random variables that are neither, but can appear in application. And even nastier cases of singular continuous random variables that don't fit in either framework, and do appear in some (but not many) applications like the spectra of random media. Stoch14 Page 6

I will post Homework 1 soon, probably over the weekend, due Friday, September 30.

I will post Homework 1 soon, probably over the weekend, due Friday, September 30. Random Variables Friday, September 09, 2011 2:02 PM I will post Homework 1 soon, probably over the weekend, due Friday, September 30. No class or office hours next week. Next class is on Tuesday, September

More information

Notes on Continuous Random Variables

Notes 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 information

Mathematical Framework for Stochastic Processes

Mathematical Framework for Stochastic Processes Mathematical Foundations of Discrete-Time Markov Chains Tuesday, February 04, 2014 2:04 PM Homework 1 posted, due Friday, February 21. Reading: Lawler, Ch. 1 Mathematical Framework for Stochastic Processes

More information

Poisson Point Processes

Poisson Point Processes Poisson Point Processes Tuesday, April 22, 2014 2:00 PM Homework 4 posted; due Wednesday, May 7. We'll begin with Poisson point processes in one dimension which actually are an example of both a Poisson

More information

Introduce complex-valued transcendental functions via the complex exponential defined as:

Introduce complex-valued transcendental functions via the complex exponential defined as: Complex exponential and logarithm Monday, September 30, 2013 1:59 PM Homework 2 posted, due October 11. Introduce complex-valued transcendental functions via the complex exponential defined as: where We'll

More information

This is now an algebraic equation that can be solved simply:

This is now an algebraic equation that can be solved simply: Simulation of CTMC Monday, November 23, 2015 1:55 PM Homework 4 will be posted by tomorrow morning, due Friday, December 11 at 5 PM. Let's solve the Kolmogorov forward equation for the Poisson counting

More information

CMPSCI 240: Reasoning Under Uncertainty

CMPSCI 240: Reasoning Under Uncertainty CMPSCI 240: Reasoning Under Uncertainty Lecture 5 Prof. Hanna Wallach wallach@cs.umass.edu February 7, 2012 Reminders Pick up a copy of B&T Check the course website: http://www.cs.umass.edu/ ~wallach/courses/s12/cmpsci240/

More information

Let's contemplate a continuous-time limit of the Bernoulli process:

Let's contemplate a continuous-time limit of the Bernoulli process: Mathematical Foundations of Markov Chains Thursday, September 17, 2015 2:04 PM Reading: Lawler Ch. 1 Homework 1 due Friday, October 2 at 5 PM. Office hours today are moved to 6-7 PM. Let's revisit the

More information

Homework 4 due on Thursday, December 15 at 5 PM (hard deadline).

Homework 4 due on Thursday, December 15 at 5 PM (hard deadline). Large-Time Behavior for Continuous-Time Markov Chains Friday, December 02, 2011 10:58 AM Homework 4 due on Thursday, December 15 at 5 PM (hard deadline). How are formulas for large-time behavior of discrete-time

More information

, 500, 250, 125, , 2, 4, 7, 11, 16, , 3, 9, 27, , 3, 2, 7, , 2 2, 4, 4 2, 8

, 500, 250, 125, , 2, 4, 7, 11, 16, , 3, 9, 27, , 3, 2, 7, , 2 2, 4, 4 2, 8 Warm Up Look for a pattern and predict the next number or expression in the list. 1. 1000, 500, 250, 125, 62.5 2. 1, 2, 4, 7, 11, 16, 22 3. 1, 3, 9, 27, 81 4. 8, 3, 2, 7, -12 5. 2, 2 2, 4, 4 2, 8 6. 7a

More information

Chapter 1 Statistical Reasoning Why statistics? Section 1.1 Basics of Probability Theory

Chapter 1 Statistical Reasoning Why statistics? Section 1.1 Basics of Probability Theory Chapter 1 Statistical Reasoning Why statistics? Uncertainty of nature (weather, earth movement, etc. ) Uncertainty in observation/sampling/measurement Variability of human operation/error imperfection

More information

Mathematical Foundations of Finite State Discrete Time Markov Chains

Mathematical Foundations of Finite State Discrete Time Markov Chains Mathematical Foundations of Finite State Discrete Time Markov Chains Friday, February 07, 2014 2:04 PM Stochastic update rule for FSDT Markov Chain requires an initial condition. Most generally, this can

More information

POISSON PROCESSES 1. THE LAW OF SMALL NUMBERS

POISSON PROCESSES 1. THE LAW OF SMALL NUMBERS POISSON PROCESSES 1. THE LAW OF SMALL NUMBERS 1.1. The Rutherford-Chadwick-Ellis Experiment. About 90 years ago Ernest Rutherford and his collaborators at the Cavendish Laboratory in Cambridge conducted

More information

Classification of Countable State Markov Chains

Classification of Countable State Markov Chains Classification of Countable State Markov Chains Friday, March 21, 2014 2:01 PM How can we determine whether a communication class in a countable state Markov chain is: transient null recurrent positive

More information

Section 7.5: Cardinality

Section 7.5: Cardinality Section 7: Cardinality In this section, we shall consider extend some of the ideas we have developed to infinite sets One interesting consequence of this discussion is that we shall see there are as many

More information

Sequences are ordered lists of elements

Sequences are ordered lists of elements Sequences are ordered lists of elements Definition: A sequence is a function from the set of integers, either set {0,1,2,3, } or set {1,2,3,4,..}, to a set S. We use the notation a n to denote the image

More information

Math 3361-Modern Algebra Lecture 08 9/26/ Cardinality

Math 3361-Modern Algebra Lecture 08 9/26/ Cardinality Math 336-Modern Algebra Lecture 08 9/26/4. Cardinality I started talking about cardinality last time, and you did some stuff with it in the Homework, so let s continue. I said that two sets have the same

More information

Random Variables Example:

Random Variables Example: Random Variables Example: We roll a fair die 6 times. Suppose we are interested in the number of 5 s in the 6 rolls. Let X = number of 5 s. Then X could be 0, 1, 2, 3, 4, 5, 6. X = 0 corresponds to the

More information

Random Variables. Definition: A random variable (r.v.) X on the probability space (Ω, F, P) is a mapping

Random Variables. Definition: A random variable (r.v.) X on the probability space (Ω, F, P) is a mapping Random Variables Example: We roll a fair die 6 times. Suppose we are interested in the number of 5 s in the 6 rolls. Let X = number of 5 s. Then X could be 0, 1, 2, 3, 4, 5, 6. X = 0 corresponds to the

More information

Introductory Analysis I Fall 2014 Homework #5 Solutions

Introductory Analysis I Fall 2014 Homework #5 Solutions Introductory Analysis I Fall 2014 Homework #5 Solutions 6. Let M be a metric space, let C D M. Now we can think of C as a subset of the metric space M or as a subspace of the metric space D (D being a

More information

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 27

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 27 CS 70 Discrete Mathematics for CS Spring 007 Luca Trevisan Lecture 7 Infinity and Countability Consider a function f that maps elements of a set A (called the domain of f ) to elements of set B (called

More information

Examples of Countable State Markov Chains Thursday, October 16, :12 PM

Examples of Countable State Markov Chains Thursday, October 16, :12 PM stochnotes101608 Page 1 Examples of Countable State Markov Chains Thursday, October 16, 2008 12:12 PM Homework 2 solutions will be posted later today. A couple of quick examples. Queueing model (without

More information

Continuous Probability Spaces

Continuous Probability Spaces Continuous Probability Spaces Ω is not countable. Outcomes can be any real number or part of an interval of R, e.g. heights, weights and lifetimes. Can not assign probabilities to each outcome and add

More information

Reading: Karlin and Taylor Ch. 5 Resnick Ch. 3. A renewal process is a generalization of the Poisson point process.

Reading: Karlin and Taylor Ch. 5 Resnick Ch. 3. A renewal process is a generalization of the Poisson point process. Renewal Processes Wednesday, December 16, 2015 1:02 PM Reading: Karlin and Taylor Ch. 5 Resnick Ch. 3 A renewal process is a generalization of the Poisson point process. The Poisson point process is completely

More information

Theorem 1.7 [Bayes' Law]: Assume that,,, are mutually disjoint events in the sample space s.t.. Then Pr( )

Theorem 1.7 [Bayes' Law]: Assume that,,, are mutually disjoint events in the sample space s.t.. Then Pr( ) Theorem 1.7 [Bayes' Law]: Assume that,,, are mutually disjoint events in the sample space s.t.. Then Pr Pr = Pr Pr Pr() Pr Pr. We are given three coins and are told that two of the coins are fair and the

More information

MATH/STAT 395. Introduction to Probability Models. Jan 7, 2013

MATH/STAT 395. Introduction to Probability Models. Jan 7, 2013 MATH/STAT 395 Introduction to Probability Models Jan 7, 2013 1.0 Random Variables Definition: A random variable X is a measurable function from the sample space Ω to the real line R. X : Ω R Ω is the set

More information

First Passage Time Calculations

First Passage Time Calculations First Passage Time Calculations Friday, April 24, 2015 2:01 PM Homework 4 will be posted over the weekend; due Wednesday, May 13 at 5 PM. We'll now develop some framework for calculating properties of

More information

Weierstrass Products and More on Analytic Continuation

Weierstrass Products and More on Analytic Continuation Weierstrass Products and More on Analytic Continuation Thursday, December 05, 2013 1:58 PM Hard deadline for Homework 4: Wednesday, December 11 at 5 PM. rapid grading on or after Friday, December 6 Final

More information

Queueing Systems: Lecture 3. Amedeo R. Odoni October 18, Announcements

Queueing Systems: Lecture 3. Amedeo R. Odoni October 18, Announcements Queueing Systems: Lecture 3 Amedeo R. Odoni October 18, 006 Announcements PS #3 due tomorrow by 3 PM Office hours Odoni: Wed, 10/18, :30-4:30; next week: Tue, 10/4 Quiz #1: October 5, open book, in class;

More information

Probability and Statistics Concepts

Probability and Statistics Concepts University of Central Florida Computer Science Division COT 5611 - Operating Systems. Spring 014 - dcm Probability and Statistics Concepts Random Variable: a rule that assigns a numerical value to each

More information

Theorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers

Theorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers Page 1 Theorems Wednesday, May 9, 2018 12:53 AM Theorem 1.11: Greatest-Lower-Bound Property Suppose is an ordered set with the least-upper-bound property Suppose, and is bounded below be the set of lower

More information

CSE 20 DISCRETE MATH. Fall

CSE 20 DISCRETE MATH. Fall CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Define and compute the cardinality of a set. Use functions to compare the sizes of sets. Classify sets

More information

MA 3280 Lecture 05 - Generalized Echelon Form and Free Variables. Friday, January 31, 2014.

MA 3280 Lecture 05 - Generalized Echelon Form and Free Variables. Friday, January 31, 2014. MA 3280 Lecture 05 - Generalized Echelon Form and Free Variables Friday, January 31, 2014. Objectives: Generalize echelon form, and introduce free variables. Material from Section 3.5 starting on page

More information

b. ( ) ( ) ( ) ( ) ( ) 5. Independence: Two events (A & B) are independent if one of the conditions listed below is satisfied; ( ) ( ) ( )

b. ( ) ( ) ( ) ( ) ( ) 5. Independence: Two events (A & B) are independent if one of the conditions listed below is satisfied; ( ) ( ) ( ) 1. Set a. b. 2. Definitions a. Random Experiment: An experiment that can result in different outcomes, even though it is performed under the same conditions and in the same manner. b. Sample Space: This

More information

MITOCW ocw f99-lec23_300k

MITOCW ocw f99-lec23_300k MITOCW ocw-18.06-f99-lec23_300k -- and lift-off on differential equations. So, this section is about how to solve a system of first order, first derivative, constant coefficient linear equations. And if

More information

MITOCW MIT6_041F11_lec15_300k.mp4

MITOCW MIT6_041F11_lec15_300k.mp4 MITOCW MIT6_041F11_lec15_300k.mp4 The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for

More information

Transience: Whereas a finite closed communication class must be recurrent, an infinite closed communication class can be transient:

Transience: Whereas a finite closed communication class must be recurrent, an infinite closed communication class can be transient: Stochastic2010 Page 1 Long-Time Properties of Countable-State Markov Chains Tuesday, March 23, 2010 2:14 PM Homework 2: if you turn it in by 5 PM on 03/25, I'll grade it by 03/26, but you can turn it in

More information

In other words, we are interested in what is happening to the y values as we get really large x values and as we get really small x values.

In other words, we are interested in what is happening to the y values as we get really large x values and as we get really small x values. Polynomial functions: End behavior Solutions NAME: In this lab, we are looking at the end behavior of polynomial graphs, i.e. what is happening to the y values at the (left and right) ends of the graph.

More information

Random variables. DS GA 1002 Probability and Statistics for Data Science.

Random variables. DS GA 1002 Probability and Statistics for Data Science. Random variables DS GA 1002 Probability and Statistics for Data Science http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall17 Carlos Fernandez-Granda Motivation Random variables model numerical quantities

More information

Homework #3: 1.4.1, a & b, 1.5.1, 1.5.3, 1.5.6, 1.5.7, 1.5.8, Prove that the set of all real numbers is uncountable.

Homework #3: 1.4.1, a & b, 1.5.1, 1.5.3, 1.5.6, 1.5.7, 1.5.8, Prove that the set of all real numbers is uncountable. Lecture 3 Homework #3: 1.4.1, 1.4.2 a & b, 1.5.1, 1.5.3, 1.5.6, 1.5.7, 1.5.8, Prove that the set of all real numbers is uncountable. Note that this lecture will likely run over but the net one is very

More information

Chapter 4 Part 3. Sections Poisson Distribution October 2, 2008

Chapter 4 Part 3. Sections Poisson Distribution October 2, 2008 Chapter 4 Part 3 Sections 4.10-4.12 Poisson Distribution October 2, 2008 Goal: To develop an understanding of discrete distributions by considering the binomial (last lecture) and the Poisson distributions.

More information

One-to-one functions and onto functions

One-to-one functions and onto functions MA 3362 Lecture 7 - One-to-one and Onto Wednesday, October 22, 2008. Objectives: Formalize definitions of one-to-one and onto One-to-one functions and onto functions At the level of set theory, there are

More information

Probability Experiments, Trials, Outcomes, Sample Spaces Example 1 Example 2

Probability Experiments, Trials, Outcomes, Sample Spaces Example 1 Example 2 Probability Probability is the study of uncertain events or outcomes. Games of chance that involve rolling dice or dealing cards are one obvious area of application. However, probability models underlie

More information

MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017

MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 Definition: A set A is finite if there exists a nonnegative integer c such that there exists a bijection from A

More information

Some Background Material

Some Background Material Chapter 1 Some Background Material In the first chapter, we present a quick review of elementary - but important - material as a way of dipping our toes in the water. This chapter also introduces important

More information

Discrete Mathematics 2007: Lecture 5 Infinite sets

Discrete Mathematics 2007: Lecture 5 Infinite sets Discrete Mathematics 2007: Lecture 5 Infinite sets Debrup Chakraborty 1 Countability The natural numbers originally arose from counting elements in sets. There are two very different possible sizes for

More information

Birth-death chain models (countable state)

Birth-death chain models (countable state) Countable State Birth-Death Chains and Branching Processes Tuesday, March 25, 2014 1:59 PM Homework 3 posted, due Friday, April 18. Birth-death chain models (countable state) S = We'll characterize the

More information

We are going to start studying today, and for quite a while, the linear second-order differential equation with

We are going to start studying today, and for quite a while, the linear second-order differential equation with MITOCW 18-03_L9 We're going to start. We are going to start studying today, and for quite a while, the linear second-order differential equation with constant coefficients. In standard form, it looks like,

More information

Basic set-theoretic techniques in logic Part II, Counting beyond infinity: Ordinal numbers

Basic set-theoretic techniques in logic Part II, Counting beyond infinity: Ordinal numbers Basic set-theoretic techniques in logic Part II, Counting beyond infinity: Ordinal numbers Benedikt Löwe Universiteit van Amsterdam Grzegorz Plebanek Uniwersytet Wroc lawski ESSLLI, Ljubliana August 2011

More information

Discrete Structures for Computer Science

Discrete Structures for Computer Science Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #10: Sequences and Summations Based on materials developed by Dr. Adam Lee Today s Topics Sequences

More information

Countable state discrete time Markov Chains

Countable state discrete time Markov Chains Countable state discrete time Markov Chains Tuesday, March 18, 2014 2:12 PM Readings: Lawler Ch. 2 Karlin & Taylor Chs. 2 & 3 Resnick Ch. 1 Countably infinite state spaces are of practical utility in situations

More information

MgtOp 215 Chapter 5 Dr. Ahn

MgtOp 215 Chapter 5 Dr. Ahn MgtOp 215 Chapter 5 Dr. Ahn Random variable: a variable that assumes its values corresponding to a various outcomes of a random experiment, therefore its value cannot be predicted with certainty. Discrete

More information

14.2 THREE IMPORTANT DISCRETE PROBABILITY MODELS

14.2 THREE IMPORTANT DISCRETE PROBABILITY MODELS 14.2 THREE IMPORTANT DISCRETE PROBABILITY MODELS In Section 14.1 the idea of a discrete probability model was introduced. In the examples of that section the probability of each basic outcome of the experiment

More information

X 1 ((, a]) = {ω Ω : X(ω) a} F, which leads us to the following definition:

X 1 ((, a]) = {ω Ω : X(ω) a} F, which leads us to the following definition: nna Janicka Probability Calculus 08/09 Lecture 4. Real-valued Random Variables We already know how to describe the results of a random experiment in terms of a formal mathematical construction, i.e. the

More information

Since D has an exponential distribution, E[D] = 0.09 years. Since {A(t) : t 0} is a Poisson process with rate λ = 10, 000, A(0.

Since D has an exponential distribution, E[D] = 0.09 years. Since {A(t) : t 0} is a Poisson process with rate λ = 10, 000, A(0. IEOR 46: Introduction to Operations Research: Stochastic Models Chapters 5-6 in Ross, Thursday, April, 4:5-5:35pm SOLUTIONS to Second Midterm Exam, Spring 9, Open Book: but only the Ross textbook, the

More information

III. What Are the Prices in 7-11?

III. What Are the Prices in 7-11? III. What Are the Prices in 7-11? There are many ways to search for the answer to a problem. To be effective, particularly when the domain of possible solutions is very large, you have to organize the

More information

Mittag-Leffler and Principle of the Argument

Mittag-Leffler and Principle of the Argument Mittag-Leffler and Principle of the Argument Thursday, November 21, 2013 1:54 PM Homework 3 due Friday, November 22 at 5 PM. Homework 4 will be posted tonight, due Wednesday, December 11 at 5 PM. We'll

More information

(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes?

(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes? IEOR 3106: Introduction to Operations Research: Stochastic Models Fall 2006, Professor Whitt SOLUTIONS to Final Exam Chapters 4-7 and 10 in Ross, Tuesday, December 19, 4:10pm-7:00pm Open Book: but only

More information

CS 361: Probability & Statistics

CS 361: Probability & Statistics February 26, 2018 CS 361: Probability & Statistics Random variables The discrete uniform distribution If every value of a discrete random variable has the same probability, then its distribution is called

More information

Algorithms: Lecture 2

Algorithms: Lecture 2 1 Algorithms: Lecture 2 Basic Structures: Sets, Functions, Sequences, and Sums Jinwoo Kim jwkim@jjay.cuny.edu 2.1 Sets 2 1 2.1 Sets 3 2.1 Sets 4 2 2.1 Sets 5 2.1 Sets 6 3 2.1 Sets 7 2.2 Set Operations

More information

Recurrent Neural Networks

Recurrent Neural Networks Recurrent Neural Networks Datamining Seminar Kaspar Märtens Karl-Oskar Masing Today's Topics Modeling sequences: a brief overview Training RNNs with back propagation A toy example of training an RNN Why

More information

Announcements. CS243: Discrete Structures. Sequences, Summations, and Cardinality of Infinite Sets. More on Midterm. Midterm.

Announcements. CS243: Discrete Structures. Sequences, Summations, and Cardinality of Infinite Sets. More on Midterm. Midterm. Announcements CS43: Discrete Structures Sequences, Summations, and Cardinality of Infinite Sets Işıl Dillig Homework is graded, scores on Blackboard Graded HW and sample solutions given at end of this

More information

MATH 56A: STOCHASTIC PROCESSES CHAPTER 6

MATH 56A: STOCHASTIC PROCESSES CHAPTER 6 MATH 56A: STOCHASTIC PROCESSES CHAPTER 6 6. Renewal Mathematically, renewal refers to a continuous time stochastic process with states,, 2,. N t {,, 2, 3, } so that you only have jumps from x to x + and

More information

Randomized Algorithms

Randomized Algorithms Randomized Algorithms Prof. Tapio Elomaa tapio.elomaa@tut.fi Course Basics A new 4 credit unit course Part of Theoretical Computer Science courses at the Department of Mathematics There will be 4 hours

More information

Why study probability? Set theory. ECE 6010 Lecture 1 Introduction; Review of Random Variables

Why study probability? Set theory. ECE 6010 Lecture 1 Introduction; Review of Random Variables ECE 6010 Lecture 1 Introduction; Review of Random Variables Readings from G&S: Chapter 1. Section 2.1, Section 2.3, Section 2.4, Section 3.1, Section 3.2, Section 3.5, Section 4.1, Section 4.2, Section

More information

Discrete Mathematics. Spring 2017

Discrete Mathematics. Spring 2017 Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: rule of inference Mathematical Induction: Conjecturing and Proving Climbing an Infinite Ladder

More information

MITOCW watch?v=4x0sggrxdii

MITOCW watch?v=4x0sggrxdii MITOCW watch?v=4x0sggrxdii The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for free. To

More information

Continuing the calculation of the absorption probability for a branching process. Homework 3 is due Tuesday, November 29.

Continuing the calculation of the absorption probability for a branching process. Homework 3 is due Tuesday, November 29. Extinction Probability for Branching Processes Friday, November 11, 2011 2:05 PM Continuing the calculation of the absorption probability for a branching process. Homework 3 is due Tuesday, November 29.

More information

CSE 105 THEORY OF COMPUTATION

CSE 105 THEORY OF COMPUTATION CSE 105 THEORY OF COMPUTATION Spring 2016 http://cseweb.ucsd.edu/classes/sp16/cse105-ab/ Today's learning goals Sipser Ch 1.4 Give an example of a non-regular language Outline two strategies for proving

More information

Random Variable. Discrete Random Variable. Continuous Random Variable. Discrete Random Variable. Discrete Probability Distribution

Random Variable. Discrete Random Variable. Continuous Random Variable. Discrete Random Variable. Discrete Probability Distribution Random Variable Theoretical Probability Distribution Random Variable Discrete Probability Distributions A variable that assumes a numerical description for the outcome of a random eperiment (by chance).

More information

the time it takes until a radioactive substance undergoes a decay

the time it takes until a radioactive substance undergoes a decay 1 Probabilities 1.1 Experiments with randomness Wewillusethetermexperimentinaverygeneralwaytorefertosomeprocess that produces a random outcome. Examples: (Ask class for some first) Here are some discrete

More information

MITOCW 9ocw-6-451_ mar k_512kb-mp4

MITOCW 9ocw-6-451_ mar k_512kb-mp4 MITOCW 9ocw-6-451_4-261-02mar2005-220k_512kb-mp4 PROFESSOR: So if you want to hand in your problem sets, we have three handouts. The old problem set solutions, the new problem set, and we're also handing

More information

Lecture 3. Discrete Random Variables

Lecture 3. Discrete Random Variables Math 408 - Mathematical Statistics Lecture 3. Discrete Random Variables January 23, 2013 Konstantin Zuev (USC) Math 408, Lecture 3 January 23, 2013 1 / 14 Agenda Random Variable: Motivation and Definition

More information

Definition: A random variable X is a real valued function that maps a sample space S into the space of real numbers R. X : S R

Definition: A random variable X is a real valued function that maps a sample space S into the space of real numbers R. X : S R Random Variables Definition: A random variable X is a real valued function that maps a sample space S into the space of real numbers R. X : S R As such, a random variable summarizes the outcome of an experiment

More information

MITOCW watch?v=y6ma-zn4olk

MITOCW watch?v=y6ma-zn4olk MITOCW watch?v=y6ma-zn4olk PROFESSOR: We have to ask what happens here? This series for h of u doesn't seem to stop. You go a 0, a 2, a 4. Well, it could go on forever. And what would happen if it goes

More information

Homework 1 (revised) Solutions

Homework 1 (revised) Solutions Homework 1 (revised) Solutions 1. Textbook, 1.1.1, # 1.1.2 (p. 24) Let S be an ordered set. Let A be a non-empty finite subset. Then A is bounded and sup A, inf A A Solution. The hint was: Use induction,

More information

2DI90 Probability & Statistics. 2DI90 Chapter 4 of MR

2DI90 Probability & Statistics. 2DI90 Chapter 4 of MR 2DI90 Probability & Statistics 2DI90 Chapter 4 of MR Recap - Random Variables ( 2.8 MR)! Example: X is the random variable corresponding to the temperature of the room at time t. x is the measured temperature

More information

Probability Method in Civil Engineering Prof. Dr. Rajib Maity Department of Civil Engineering Indian Institute of Technology, Kharagpur

Probability Method in Civil Engineering Prof. Dr. Rajib Maity Department of Civil Engineering Indian Institute of Technology, Kharagpur Probability Method in Civil Engineering Prof. Dr. Rajib Maity Department of Civil Engineering Indian Institute of Technology, Kharagpur Lecture No. # 34 Probability Models using Discrete Probability Distributions

More information

2. Introduction to commutative rings (continued)

2. Introduction to commutative rings (continued) 2. Introduction to commutative rings (continued) 2.1. New examples of commutative rings. Recall that in the first lecture we defined the notions of commutative rings and field and gave some examples of

More information

LECTURE #6 BIRTH-DEATH PROCESS

LECTURE #6 BIRTH-DEATH PROCESS LECTURE #6 BIRTH-DEATH PROCESS 204528 Queueing Theory and Applications in Networks Assoc. Prof., Ph.D. (รศ.ดร. อน นต ผลเพ ม) Computer Engineering Department, Kasetsart University Outline 2 Birth-Death

More information

EE126: Probability and Random Processes

EE126: Probability and Random Processes EE126: Probability and Random Processes Lecture 19: Poisson Process Abhay Parekh UC Berkeley March 31, 2011 1 1 Logistics 2 Review 3 Poisson Processes 2 Logistics 3 Poisson Process A continuous version

More information

Chapter 8: Continuous Probability Distributions

Chapter 8: Continuous Probability Distributions Chapter 8: Continuous Probability Distributions 8.1 Introduction This chapter continued our discussion of probability distributions. It began by describing continuous probability distributions in general,

More information

We have been going places in the car of calculus for years, but this analysis course is about how the car actually works.

We have been going places in the car of calculus for years, but this analysis course is about how the car actually works. Analysis I We have been going places in the car of calculus for years, but this analysis course is about how the car actually works. Copier s Message These notes may contain errors. In fact, they almost

More information

Introduction to Empirical Processes and Semiparametric Inference Lecture 08: Stochastic Convergence

Introduction to Empirical Processes and Semiparametric Inference Lecture 08: Stochastic Convergence Introduction to Empirical Processes and Semiparametric Inference Lecture 08: Stochastic Convergence Michael R. Kosorok, Ph.D. Professor and Chair of Biostatistics Professor of Statistics and Operations

More information

Homework 11. Solutions

Homework 11. Solutions Homework 11. Solutions Problem 2.3.2. Let f n : R R be 1/n times the characteristic function of the interval (0, n). Show that f n 0 uniformly and f n µ L = 1. Why isn t it a counterexample to the Lebesgue

More information

Random Walk on a Graph

Random Walk on a Graph IOR 67: Stochastic Models I Second Midterm xam, hapters 3 & 4, November 2, 200 SOLUTIONS Justify your answers; show your work.. Random Walk on a raph (25 points) Random Walk on a raph 2 5 F B 3 3 2 Figure

More information

Spring 2014 Advanced Probability Overview. Lecture Notes Set 1: Course Overview, σ-fields, and Measures

Spring 2014 Advanced Probability Overview. Lecture Notes Set 1: Course Overview, σ-fields, and Measures 36-752 Spring 2014 Advanced Probability Overview Lecture Notes Set 1: Course Overview, σ-fields, and Measures Instructor: Jing Lei Associated reading: Sec 1.1-1.4 of Ash and Doléans-Dade; Sec 1.1 and A.1

More information

2. Continuous Distributions

2. Continuous Distributions 1 of 12 7/16/2009 5:35 AM Virtual Laboratories > 3. Distributions > 1 2 3 4 5 6 7 8 2. Continuous Distributions Basic Theory As usual, suppose that we have a random experiment with probability measure

More information

2. AXIOMATIC PROBABILITY

2. AXIOMATIC PROBABILITY IA Probability Lent Term 2. AXIOMATIC PROBABILITY 2. The axioms The formulation for classical probability in which all outcomes or points in the sample space are equally likely is too restrictive to develop

More information

Stat 609: Mathematical Statistics I (Fall Semester, 2016) Introduction

Stat 609: Mathematical Statistics I (Fall Semester, 2016) Introduction Stat 609: Mathematical Statistics I (Fall Semester, 2016) Introduction Course information Instructor Professor Jun Shao TA Mr. Han Chen Office 1235A MSC 1335 MSC Phone 608-262-7938 608-263-5948 Email shao@stat.wisc.edu

More information

Continuous-time Markov Chains

Continuous-time Markov Chains Continuous-time Markov Chains Gonzalo Mateos Dept. of ECE and Goergen Institute for Data Science University of Rochester gmateosb@ece.rochester.edu http://www.ece.rochester.edu/~gmateosb/ October 23, 2017

More information

Office hours: Mondays 5-6 PM (undergraduate class preference) Tuesdays 5-6 PM (this class preference) Thursdays 5-6 PM (free-for-all)

Office hours: Mondays 5-6 PM (undergraduate class preference) Tuesdays 5-6 PM (this class preference) Thursdays 5-6 PM (free-for-all) Probability Theory Foundations Thursday, September 03, 2015 1:57 PM Office hours: Mondays 5-6 PM (undergraduate class preference) Tuesdays 5-6 PM (this class preference) Thursdays 5-6 PM (free-for-all)

More information

ABOUT THE CLASS AND NOTES ON SET THEORY

ABOUT THE CLASS AND NOTES ON SET THEORY ABOUT THE CLASS AND NOTES ON SET THEORY About the Class Evaluation. Final grade will be based 25%, 25%, 25%, 25%, on homework, midterm 1, midterm 2, final exam. Exam dates. Midterm 1: Oct 4. Midterm 2:

More information

Statistics for Economists. Lectures 3 & 4

Statistics for Economists. Lectures 3 & 4 Statistics for Economists Lectures 3 & 4 Asrat Temesgen Stockholm University 1 CHAPTER 2- Discrete Distributions 2.1. Random variables of the Discrete Type Definition 2.1.1: Given a random experiment with

More information

MATH 13 FINAL EXAM SOLUTIONS

MATH 13 FINAL EXAM SOLUTIONS MATH 13 FINAL EXAM SOLUTIONS WINTER 2014 Problem 1 (15 points). For each statement below, circle T or F according to whether the statement is true or false. You do NOT need to justify your answers. T F

More information

Session-Based Queueing Systems

Session-Based Queueing Systems Session-Based Queueing Systems Modelling, Simulation, and Approximation Jeroen Horters Supervisor VU: Sandjai Bhulai Executive Summary Companies often offer services that require multiple steps on the

More information

Northwestern University Department of Electrical Engineering and Computer Science

Northwestern University Department of Electrical Engineering and Computer Science Northwestern University Department of Electrical Engineering and Computer Science EECS 454: Modeling and Analysis of Communication Networks Spring 2008 Probability Review As discussed in Lecture 1, probability

More information

MATH 341, Section 001 FALL 2014 Introduction to the Language and Practice of Mathematics

MATH 341, Section 001 FALL 2014 Introduction to the Language and Practice of Mathematics MATH 341, Section 001 FALL 2014 Introduction to the Language and Practice of Mathematics Class Meetings: MW 9:30-10:45 am in EMS E424A, September 3 to December 10 [Thanksgiving break November 26 30; final

More information

1 of 8 7/15/2009 3:43 PM Virtual Laboratories > 1. Foundations > 1 2 3 4 5 6 7 8 9 6. Cardinality Definitions and Preliminary Examples Suppose that S is a non-empty collection of sets. We define a relation

More information

MITOCW ocw f99-lec05_300k

MITOCW ocw f99-lec05_300k MITOCW ocw-18.06-f99-lec05_300k This is lecture five in linear algebra. And, it will complete this chapter of the book. So the last section of this chapter is two point seven that talks about permutations,

More information