Apart from this page, you are not permitted to read the contents of this question paper until instructed to do so by an invigilator.
|
|
- Solomon Stephens
- 5 years ago
- Views:
Transcription
1 B. Sc. Examination by course unit 216 MTH6934: Topics in Probability & Stochastic Processes[SOLUTIONS] Duration: 2 hours Date and time: To Be Determined Apart from this page, you are not permitted to read the contents of this question paper until instructed to do so by an invigilator. You should attempt ALL questions. Marks awarded are shown next to the questions. Calculators are NOT permitted in this examination. The unauthorised use of a calculator constitutes an examination offence. Complete all rough workings in the answer book and cross through any work that is not to be assessed. Possession of unauthorised material at any time when under examination conditions is an assessment offence and can lead to expulsion from QMUL. Check now to ensure you do not have any notes, mobile phones, smartwatches or unauthorised electronic devices on your person. If you do, raise your hand and give them to an invigilator immediately. It is also an offence to have any writing of any kind on your person, including on your body. If you are found to have hidden unauthorised material elsewhere, including toilets and cloakrooms it shall be treated as being found in your possession. Unauthorised material found on your mobile phone or other electronic device will be considered the same as being in possession of paper notes. A mobile phone that causes a disruption in the exam is also an assessment offence. Exam papers must not be removed from the examination room. Examiner(s): Dr Dudley Stark, Dr Jens Starke TURN OVER
2 Page 2 MTH6934 (216) Question 1. (a) [Stated in lecture] N(t) = max{n 1 : S n t}. 5 (b) [Proved in lecture] M(t) = E(N(t)) = P(N(t) n). 2 n=1 We know that Therefore, {N(t) n} = {S n t}. 3 M(t) = P(S n t) = F n (t). 2 n=1 n=1 (c) [Proved in Lecture/Similar to Coursework] The p.d.f. of an Exponential(θ) distributed random variable is f(x) = θe θx and the c.d.f. is F (x) = 1 e θx. 2 µ = 1 µ x xf(x) dx = [1 F (u)du = θ = θ xθe θx dx = θ 1 1. x x [1 (1 e θu ]du e θu du = θ(θ 1 (1 e θx )) = 1 e θx = F (x). 5
3 MTH6934 (216) Page 3 Question 2. (a) (i) [Stated in lecture] It is the semi-markov process with transition matrix P i,j 1 for which the process always stays in a state exactly one unit of time before making a transition. 1 (ii) [Stated in lecture] The equations for the stationary distribution are π i = j π j P j,i 2 and (iii) [Coursework problem] The equations become π i = 1. 1 i π 1 = π 2, π 2 = π 1, π 3 = π 4, π 4 = π 3, 4 π i = 1. 2 i=1 The solution to them is (b) [Similar to coursework] (π 1, π 2, π 3, π 4 ) = (α, α, 1/2 α, 1/2 α), α 1/2. 2 Let X i be the time of the ith trip from Birmingham to Manchester. Let Y i be the time of the ith trip from Manchester to Birmingham. E(X i ) = (6 + 12)/2 = 9 minutes, 2 E(Y i ) = (6 + 1)/2 = 8 minutes, 2 By the Renewal Rewards theorem with reward R i = Y i, 2 the proportion of time driving from Manchester to Birmingham is E(Y i ) E(X i ) + E(Y i ) 3 = = 8 17 = TURN OVER
4 Page 4 MTH6934 (216) Question 3. (a) [Similar to examples presented in lecture] (i) If X Exponential(θ), then P(X > s + t X > s) = P(X > t). 3 (ii) P(X > s + t X > s) = (b) (i) The answer is e /5!. 3 = P({X > s + t} {X > s}) P(X > s) P(X > s + t) 2 P(X > s) = e θ(s+t) e θs 2 = e θt 1 = P(X > t). 1 (ii) The probability that exactly one customer arrived in the first 2 minutes is ( ) 5 (1/3) 1 (2/3) 4 = 8/
5 MTH6934 (216) Page 5 Question 4. (a) [Stated and proved in lecture] (i) P(t) = e tg 2 (ii) P (t) = GP(t) 2 P (t) = P(t)G 2 (b) [Similar to coursework] (i) Let λ = 3, 1/µ = 1/4 µ = 4. 1 P(X(h) = 1 X() = ) = λh + o(h) q,1 = λ. P(X(h) = 2 X() = ) = o(h) q,2 = P(X(h) = X() = 1) = (µh + o(h))(1 λh + o(h)) = µh + o(h) q 1, = µ. P(X(h) = 2 X() = 1) = λh + o(h) q 1,2 = λ P(X(h) = 1 X() = 2) = ( ) 2 (µh + o(h))(1 µh + o(h)) 1 = 2µh + o(h) q 2,1 = 2µ. P(X(h) = X() = 2) = o(h) q 2, =. The rows of the G must sum to. We have λ λ G = µ λ µ λ = 2µ 2µ /3 mark for each entry of G (rounded to the nearest integer). (ii) The π i must satisfy the equations 3π + 4π 1 = 1 (1) 3π 7π 1 + 8π 2 = 1 (2) 3π 1 8π 2 = 1 (3) π + π 1 + π 2 = 1. 1 (4) TURN OVER
6 Page 6 MTH6934 (216) These equations can be solved in the following way, for example. From (1), we have π = 4 3 π 1. From (3) we have π 2 = 3 8 π 1. Putting the above expressions in (4) gives ( 4 π ) = 1 8 so π 1 = π = 32 65, π 2 =
7 MTH6934 (216) Page 7 Question 5. (a) [Stated in lecture] B(t) N(, t). 4 (b) Derived in lecture] B(t) N(, t) is easily seen to be a Gaussian process. In detail, suppose that α i and t i, i = 1, 2,..., n are constants and time points. Then n i=1 α i B(t i ) = n i=1 α i(b(t + t i ) B(t )) = n i=1 α ib(t + t i ) + ( n i=1 α i)b(t ) is normally distributed because B(t) is a Gaussian process. 2 Therefore, B(t) is a Gaussian process. 2 Moreover, for s t, since we know Cov(B(t 1 ), B(t 2 )) = min(t 1, t 2 ), Cov( B(s), B(t)) = Cov(B(t + s) B(t ), B(t + t) B(t )) = Cov(B(t + s), B(t + t)) Cov(B(t ), B(t + t)) Cov(B(t + s), B(t )) + Cov(B(t ), B(t )) = (t + s) t t + t = s = Cov(B(s), B(t)). 5 B(t) is a Gaussian process with the same expectation and covariance functions as B(t), therefore it is identical to B(t) 2. (c) [Coursework problem] Let A be a subset of realizations of B(t). Then, ( ) S nt lim P A = P (B(t) A), n n where x is the largest integer less than or equal to x. 5 End of Paper.
Apart from this page, you are not permitted to read the contents of this question paper until instructed to do so by an invigilator.
B. Sc. Examiatio by course uit 26 MTH734U: Topics i Probability & Stochastic Processes[SOLUTIONS] Duratio: 3 hours Date ad time: To Be Determied Apart from this page, you are ot permitted to read the cotets
More informationMTH4101: Calculus II [SOLUTIONS]
MTH40: Calculus II [SOLUTIONS] Duration: hours Date and time: 7th May 06, 4:30 6:30 Apart from this page, you are not permitted to read the contents of this question paper until instructed to do so by
More informationMTH6134 / MTH6134P: Statistical Modelling II
Main Examination period 2017 MTH6134 / MTH6134P: Statistical Modelling II Duration: 2 hours Student number Desk number Name and type of calculator used Apart from this page, you are not permitted to read
More informationApart from this page, you are not permitted to read the contents of this question paper until instructed to do so by an invigilator.
B. Sc. Examination by course unit 2014 MTH5120 Statistical Modelling I Duration: 2 hours Date and time: 16 May 2014, 1000h 1200h Apart from this page, you are not permitted to read the contents of this
More informationMTH4107 / MTH4207: Introduction to Probability
Main Examination period 2018 MTH4107 / MTH4207: Introduction to Probability Duration: 2 hours Student number Desk number Make and model of calculator used Apart from this page, you are not permitted to
More informationPHY413 Quantum Mechanics B Duration: 2 hours 30 minutes
BSc/MSci Examination by Course Unit Thursday nd May 4 : - :3 PHY43 Quantum Mechanics B Duration: hours 3 minutes YOU ARE NOT PERMITTED TO READ THE CONTENTS OF THIS QUESTION PAPER UNTIL INSTRUCTED TO DO
More informationSPA7023P/SPA7023U/ASTM109 Stellar Structure and Evolution Duration: 2.5 hours
MSc/MSci Examination Day 28th April 2015 18:30 21:00 SPA7023P/SPA7023U/ASTM109 Stellar Structure and Evolution Duration: 2.5 hours YOU ARE NOT PERMITTED TO READ THE CONTENTS OF THIS QUESTION PAPER UNTIL
More informationASTM109 Stellar Structure and Evolution Duration: 2.5 hours
MSc Examination Day 15th May 2014 14:30 17:00 ASTM109 Stellar Structure and Evolution Duration: 2.5 hours YOU ARE NOT PERMITTED TO READ THE CONTENTS OF THIS QUESTION PAPER UNTIL INSTRUCTED TO DO SO BY
More informationPHY214 Thermal & Kinetic Physics Duration: 2 hours 30 minutes
BSc Examination by course unit. Friday 5th May 01 10:00 1:30 PHY14 Thermal & Kinetic Physics Duration: hours 30 minutes YOU ARE NOT PERMITTED TO READ THE CONTENTS OF THIS QUESTION PAPER UNTIL INSTRUCTED
More informationBSc/MSci MidTerm Test
BSc/MSci MidTerm Test PHY-217 Vibrations and Waves Time Allowed: 40 minutes Date: 18 th Nov, 2011 Time: 9:10-9:50 Instructions: Answer ALL questions in section A. Answer ONLY ONE questions from section
More informationExponential Distribution and Poisson Process
Exponential Distribution and Poisson Process Stochastic Processes - Lecture Notes Fatih Cavdur to accompany Introduction to Probability Models by Sheldon M. Ross Fall 215 Outline Introduction Exponential
More informationThe exponential distribution and the Poisson process
The exponential distribution and the Poisson process 1-1 Exponential Distribution: Basic Facts PDF f(t) = { λe λt, t 0 0, t < 0 CDF Pr{T t) = 0 t λe λu du = 1 e λt (t 0) Mean E[T] = 1 λ Variance Var[T]
More informationTHE ROYAL STATISTICAL SOCIETY GRADUATE DIPLOMA
THE ROYAL STATISTICAL SOCIETY 4 EXAINATIONS SOLUTIONS GRADUATE DIPLOA PAPER I STATISTICAL THEORY & ETHODS The Societ provides these solutions to assist candidates preparing for the examinations in future
More informationStatistics 253/317 Introduction to Probability Models. Winter Midterm Exam Friday, Feb 8, 2013
Statistics 253/317 Introduction to Probability Models Winter 2014 - Midterm Exam Friday, Feb 8, 2013 Student Name (print): (a) Do not sit directly next to another student. (b) This is a closed-book, closed-note
More informationYOU ARE NOT PERMITTED TO READ THE CONTENTS OF THIS QUESTION PAPER UNTIL INSTRUCTED TO DO SO BY AN INVIGILATOR.
BSc/MSci Examination by course unit.???day??th??? 2013 10:00 12:30 PHY4116 From Newton to Einstein Duration: 2 hours 30 minutes YOU ARE NOT PERMITTED TO READ THE CONTENTS OF THIS QUESTION PAPER UNTIL INSTRUCTED
More informationChapter 6: Random Processes 1
Chapter 6: Random Processes 1 Yunghsiang S. Han Graduate Institute of Communication Engineering, National Taipei University Taiwan E-mail: yshan@mail.ntpu.edu.tw 1 Modified from the lecture notes by Prof.
More informationRecap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks
Recap Probability, stochastic processes, Markov chains ELEC-C7210 Modeling and analysis of communication networks 1 Recap: Probability theory important distributions Discrete distributions Geometric distribution
More information(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 informationMATHEMATICAL METHODS
Victorian Certificate of Education 2016 SUPERVISOR TO ATTACH PROCESSING LABEL HERE Letter STUDENT NUMBER MATHEMATICAL METHODS Written examination 1 Wednesday 2 November 2016 Reading time: 9.00 am to 9.15
More informationRenewal theory and its applications
Renewal theory and its applications Stella Kapodistria and Jacques Resing September 11th, 212 ISP Definition of a Renewal process Renewal theory and its applications If we substitute the Exponentially
More informationQuestion Points Score Total: 70
The University of British Columbia Final Examination - April 204 Mathematics 303 Dr. D. Brydges Time: 2.5 hours Last Name First Signature Student Number Special Instructions: Closed book exam, no calculators.
More informationMath 180C, Spring Supplement on the Renewal Equation
Math 18C Spring 218 Supplement on the Renewal Equation. These remarks supplement our text and set down some of the material discussed in my lectures. Unexplained notation is as in the text or in lecture.
More informationELEMENTS OF PROBABILITY THEORY
ELEMENTS OF PROBABILITY THEORY Elements of Probability Theory A collection of subsets of a set Ω is called a σ algebra if it contains Ω and is closed under the operations of taking complements and countable
More informationStatistics 253/317 Introduction to Probability Models. Winter Midterm Exam Monday, Feb 10, 2014
Statistics 253/317 Introduction to Probability Models Winter 2014 - Midterm Exam Monday, Feb 10, 2014 Student Name (print): (a) Do not sit directly next to another student. (b) This is a closed-book, closed-note
More informationCDA5530: Performance Models of Computers and Networks. Chapter 3: Review of Practical
CDA5530: Performance Models of Computers and Networks Chapter 3: Review of Practical Stochastic Processes Definition Stochastic ti process X = {X(t), t T} is a collection of random variables (rvs); one
More informationChapter 2. Poisson Processes. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan
Chapter 2. Poisson Processes Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan Outline Introduction to Poisson Processes Definition of arrival process Definition
More informationBe sure this exam has 9 pages including the cover. The University of British Columbia
Be sure this exam has 9 pages including the cover The University of British Columbia Sessional Exams 2011 Term 2 Mathematics 303 Introduction to Stochastic Processes Dr. D. Brydges Last Name: First Name:
More informationCDA6530: Performance Models of Computers and Networks. Chapter 3: Review of Practical Stochastic Processes
CDA6530: Performance Models of Computers and Networks Chapter 3: Review of Practical Stochastic Processes Definition Stochastic process X = {X(t), t2 T} is a collection of random variables (rvs); one rv
More informationName of the Student: Problems on Discrete & Continuous R.Vs
Engineering Mathematics 08 SUBJECT NAME : Probability & Random Processes SUBJECT CODE : MA645 MATERIAL NAME : University Questions REGULATION : R03 UPDATED ON : November 07 (Upto N/D 07 Q.P) (Scan the
More informationMATHEMATICAL METHODS
Victorian Certificate of Education 018 SUPERVISOR TO ATTACH PROCESSING LABEL HERE Letter STUDENT NUMBER MATHEMATICAL METHODS Written examination 1 Friday 1 June 018 Reading time:.00 pm to.15 pm (15 minutes)
More informationMath 321 Final Exam 8:30am, Tuesday, April 20, 2010 Duration: 150 minutes
Math 321 Final Exam 8:30am, Tuesday, April 20, 2010 Duration: 150 minutes Name: Student Number: Do not open this test until instructed to do so! This exam should have 17 pages, including this cover sheet.
More informationQ = (c) Assuming that Ricoh has been working continuously for 7 days, what is the probability that it will remain working at least 8 more days?
IEOR 4106: Introduction to Operations Research: Stochastic Models Spring 2005, Professor Whitt, Second Midterm Exam Chapters 5-6 in Ross, Thursday, March 31, 11:00am-1:00pm Open Book: but only the Ross
More informationMATHEMATICAL METHODS (CAS) PILOT STUDY
Victorian CertiÞcate of Education 2005 SUPERVISOR TO ATTACH PROCESSING LABEL HERE STUDENT NUMBER Letter Figures Words MATHEMATICAL METHODS (CAS) PILOT STUDY Written examination 2 (Analysis task) Monday
More informationThe multidimensional Ito Integral and the multidimensional Ito Formula. Eric Mu ller June 1, 2015 Seminar on Stochastic Geometry and its applications
The multidimensional Ito Integral and the multidimensional Ito Formula Eric Mu ller June 1, 215 Seminar on Stochastic Geometry and its applications page 2 Seminar on Stochastic Geometry and its applications
More informationPoisson Processes. Stochastic Processes. Feb UC3M
Poisson Processes Stochastic Processes UC3M Feb. 2012 Exponential random variables A random variable T has exponential distribution with rate λ > 0 if its probability density function can been written
More informationManual for SOA Exam MLC.
Chapter 10. Poisson processes. Section 10.5. Nonhomogenous Poisson processes Extract from: Arcones Fall 2009 Edition, available at http://www.actexmadriver.com/ 1/14 Nonhomogenous Poisson processes Definition
More informationQualifying Exam CS 661: System Simulation Summer 2013 Prof. Marvin K. Nakayama
Qualifying Exam CS 661: System Simulation Summer 2013 Prof. Marvin K. Nakayama Instructions This exam has 7 pages in total, numbered 1 to 7. Make sure your exam has all the pages. This exam will be 2 hours
More informationSolution: The process is a compound Poisson Process with E[N (t)] = λt/p by Wald's equation.
Solutions Stochastic Processes and Simulation II, May 18, 217 Problem 1: Poisson Processes Let {N(t), t } be a homogeneous Poisson Process on (, ) with rate λ. Let {S i, i = 1, 2, } be the points of the
More informationStatistics & Data Sciences: First Year Prelim Exam May 2018
Statistics & Data Sciences: First Year Prelim Exam May 2018 Instructions: 1. Do not turn this page until instructed to do so. 2. Start each new question on a new sheet of paper. 3. This is a closed book
More informationDecember 2010 Mathematics 302 Name Page 2 of 11 pages
December 2010 Mathematics 302 Name Page 2 of 11 pages [9] 1. An urn contains red balls, 10 green balls and 1 yellow balls. You randomly select balls, without replacement. (a What ( is( the probability
More informationName of the Student: Problems on Discrete & Continuous R.Vs
Engineering Mathematics 05 SUBJECT NAME : Probability & Random Process SUBJECT CODE : MA6 MATERIAL NAME : University Questions MATERIAL CODE : JM08AM004 REGULATION : R008 UPDATED ON : Nov-Dec 04 (Scan
More informationPoisson Cluster process as a model for teletraffic arrivals and its extremes
Poisson Cluster process as a model for teletraffic arrivals and its extremes Barbara González-Arévalo, University of Louisiana Thomas Mikosch, University of Copenhagen Gennady Samorodnitsky, Cornell University
More informationWithout fully opening the exam, check that you have pages 1 through 11.
MTH 33 Solutions to Final Exam May, 8 Name: Section: Recitation Instructor: INSTRUCTIONS Fill in your name, etc. on this first page. Without fully opening the exam, check that you have pages through. Show
More informationMAS108 Probability I
1 BSc Examination 2008 By Course Units 2:30 pm, Thursday 14 August, 2008 Duration: 2 hours MAS108 Probability I Do not start reading the question paper until you are instructed to by the invigilators.
More informationUCSD ECE250 Handout #27 Prof. Young-Han Kim Friday, June 8, Practice Final Examination (Winter 2017)
UCSD ECE250 Handout #27 Prof. Young-Han Kim Friday, June 8, 208 Practice Final Examination (Winter 207) There are 6 problems, each problem with multiple parts. Your answer should be as clear and readable
More informationMassachusetts Institute of Technology Department of Electrical Engineering & Computer Science 6.041/6.431: Probabilistic Systems Analysis
6.04/6.43: Probabilistic Systems Analysis Question : Multiple choice questions. CLEARLY circle the best answer for each question below. Each question is worth 4 points each, with no partial credit given.
More informationData analysis and stochastic modeling
Data analysis and stochastic modeling Lecture 7 An introduction to queueing theory Guillaume Gravier guillaume.gravier@irisa.fr with a lot of help from Paul Jensen s course http://www.me.utexas.edu/ jensen/ormm/instruction/powerpoint/or_models_09/14_queuing.ppt
More informationEXAM IN COURSE TMA4265 STOCHASTIC PROCESSES Wednesday 7. August, 2013 Time: 9:00 13:00
Norges teknisk naturvitenskapelige universitet Institutt for matematiske fag Page 1 of 7 English Contact: Håkon Tjelmeland 48 22 18 96 EXAM IN COURSE TMA4265 STOCHASTIC PROCESSES Wednesday 7. August, 2013
More informationIEOR 6711: Stochastic Models I SOLUTIONS to the First Midterm Exam, October 7, 2008
IEOR 6711: Stochastic Models I SOLUTIONS to the First Midterm Exam, October 7, 2008 Justify your answers; show your work. 1. A sequence of Events. (10 points) Let {B n : n 1} be a sequence of events in
More informationTest Problems for Probability Theory ,
1 Test Problems for Probability Theory 01-06-16, 010-1-14 1. Write down the following probability density functions and compute their moment generating functions. (a) Binomial distribution with mean 30
More informationExam 1 September 11, 2013
Exam 1 Instructions: You have 60 minutes to complete this exam. This is a closed-book, closed-notes exam. You are allowed to use an approved calculator during the exam. Usage of mobile phones and other
More informationMATHEMATICAL METHODS (CAS) Written examination 1
Victorian Certificate of Education 2010 SUPERVISOR TO ATTACH PROCESSING LABEL HERE STUDENT NUMBER Letter Figures Words MATHEMATICAL METHODS (CAS) Written examination 1 Friday 5 November 2010 Reading time:
More informationECE302 Spring 2006 Practice Final Exam Solution May 4, Name: Score: /100
ECE302 Spring 2006 Practice Final Exam Solution May 4, 2006 1 Name: Score: /100 You must show ALL of your work for full credit. This exam is open-book. Calculators may NOT be used. 1. As a function of
More informationMath 180B Homework 9 Solutions
Problem 1 (Pinsky & Karlin, Exercise 5.1.3). Let X and Y be independent Poisson distributed random variables with parameters α and β, respectively. Determine the conditional distribution of X, given that
More informationSTAT 430/510 Probability Lecture 12: Central Limit Theorem and Exponential Distribution
STAT 430/510 Probability Lecture 12: Central Limit Theorem and Exponential Distribution Pengyuan (Penelope) Wang June 15, 2011 Review Discussed Uniform Distribution and Normal Distribution Normal Approximation
More informationBasics of Stochastic Modeling: Part II
Basics of Stochastic Modeling: Part II Continuous Random Variables 1 Sandip Chakraborty Department of Computer Science and Engineering, INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR August 10, 2016 1 Reference
More informationCalifornia State University Northridge MATH 280: Applied Differential Equations Midterm Exam 1
California State University Northridge MATH 280: Applied Differential Equations Midterm Exam 1 October 9, 2013. Duration: 75 Minutes. Instructor: Jing Li Student Name: Student number: Take your time to
More information1 Simulating normal (Gaussian) rvs with applications to simulating Brownian motion and geometric Brownian motion in one and two dimensions
Copyright c 2007 by Karl Sigman 1 Simulating normal Gaussian rvs with applications to simulating Brownian motion and geometric Brownian motion in one and two dimensions Fundamental to many applications
More informationProbability Models. 4. What is the definition of the expectation of a discrete random variable?
1 Probability Models The list of questions below is provided in order to help you to prepare for the test and exam. It reflects only the theoretical part of the course. You should expect the questions
More informationMATHEMATICAL METHODS (CAS)
Victorian Certificate of Education 2015 SUPERVISOR TO ATTACH PROCESSING LABEL HERE Letter STUDENT NUMBER MATHEMATICAL METHODS (CAS) Written examination 1 Wednesday 4 November 2015 Reading time: 9.00 am
More informationExam 2 October 17, 2013
Exam 2 Instructions: You have 60 minutes to complete this exam. This is a closed-book, closed-notes exam. You are allowed to use an approved calculator during the exam. Usage of mobile phones and other
More informationMATHEMATICAL METHODS (CAS) Written examination 1
Victorian Certificate of Education 2008 SUPERVISOR TO ATTACH PROCESSING LABEL HERE STUDENT NUMBER Letter Figures Words MATHEMATICAL METHODS (CAS) Written examination 1 Friday 7 November 2008 Reading time:
More informationE[X n ]= dn dt n M X(t). ). What is the mgf? Solution. Found this the other day in the Kernel matching exercise: 1 M X (t) =
Chapter 7 Generating functions Definition 7.. Let X be a random variable. The moment generating function is given by M X (t) =E[e tx ], provided that the expectation exists for t in some neighborhood of
More informationStat 150 Practice Final Spring 2015
Stat 50 Practice Final Spring 205 Instructor: Allan Sly Name: SID: There are 8 questions. Attempt all questions and show your working - solutions without explanation will not receive full credit. Answer
More informationChapter 2. Continuous random variables
Chapter 2 Continuous random variables Outline Review of probability: events and probability Random variable Probability and Cumulative distribution function Review of discrete random variable Introduction
More informationSolutions to Problem Set 5
UC Berkeley, CS 74: Combinatorics and Discrete Probability (Fall 00 Solutions to Problem Set (MU 60 A family of subsets F of {,,, n} is called an antichain if there is no pair of sets A and B in F satisfying
More informationFigure 10.1: Recording when the event E occurs
10 Poisson Processes Let T R be an interval. A family of random variables {X(t) ; t T} is called a continuous time stochastic process. We often consider T = [0, 1] and T = [0, ). As X(t) is a random variable
More informationMath 102- Final examination University of British Columbia December 14, 2012, 3:30 pm to 6:00 pm
Math 102- Final examination University of British Columbia December 14, 2012, 3:30 pm to 6:00 pm Name (print): ID number: Section number: This exam is closed book. Calculators or other electronic aids
More informationContinuous-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 informationChapter 5 continued. Chapter 5 sections
Chapter 5 sections Discrete univariate distributions: 5.2 Bernoulli and Binomial distributions Just skim 5.3 Hypergeometric distributions 5.4 Poisson distributions Just skim 5.5 Negative Binomial distributions
More informationSolutions to Homework Discrete Stochastic Processes MIT, Spring 2011
Exercise 1 Solutions to Homework 6 6.262 Discrete Stochastic Processes MIT, Spring 2011 Let {Y n ; n 1} be a sequence of rv s and assume that lim n E[ Y n ] = 0. Show that {Y n ; n 1} converges to 0 in
More informationMaster s Written Examination - Solution
Master s Written Examination - Solution Spring 204 Problem Stat 40 Suppose X and X 2 have the joint pdf f X,X 2 (x, x 2 ) = 2e (x +x 2 ), 0 < x < x 2
More informationContinuous Time Markov Chains
Continuous Time Markov Chains Stochastic Processes - Lecture Notes Fatih Cavdur to accompany Introduction to Probability Models by Sheldon M. Ross Fall 2015 Outline Introduction Continuous-Time Markov
More informationClosed book and notes. 60 minutes. Cover page and four pages of exam. No calculators.
IE 230 Seat # Closed book and notes. 60 minutes. Cover page and four pages of exam. No calculators. Score Exam #3a, Spring 2002 Schmeiser Closed book and notes. 60 minutes. 1. True or false. (for each,
More informationELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process
Department of Electrical Engineering University of Arkansas ELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process Dr. Jingxian Wu wuj@uark.edu OUTLINE 2 Definition of stochastic process (random
More informationGS-2017 (Mathematics) TATA INSTITUTE OF FUNDAMENTAL RESEARCH
MTH GS-2017 (Mathematics) TATA INSTITUTE OF FUNDAMENTAL RESEARCH Written Test in MATHEMATICS December 11, 2016 For the Ph.D. Programs at TIFR, Mumbai and CAM & ICTS, Bangalore and for the Int. Ph.D. Programs
More informationProblem Out of Score Problem Out of Score Total 45
Midterm Exam #1 Math 11, Section 5 January 3, 15 Duration: 5 minutes Name: Student Number: Do not open this test until instructed to do so! This exam should have 8 pages, including this cover sheet. No
More informationn px p x (1 p) n x. p x n(n 1)... (n x + 1) x!
Lectures 3-4 jacques@ucsd.edu 7. Classical discrete distributions D. The Poisson Distribution. If a coin with heads probability p is flipped independently n times, then the number of heads is Bin(n, p)
More informationLecture 9. d N(0, 1). Now we fix n and think of a SRW on [0,1]. We take the k th step at time k n. and our increments are ± 1
Random Walks and Brownian Motion Tel Aviv University Spring 011 Lecture date: May 0, 011 Lecture 9 Instructor: Ron Peled Scribe: Jonathan Hermon In today s lecture we present the Brownian motion (BM).
More informationMATHEMATICAL METHODS (CAS) PILOT STUDY
Victorian Certificate of Education 2004 SUPERVISOR TO ATTACH PROCESSING LABEL HERE MATHEMATICAL METHODS (CAS) PILOT STUDY Written examination 2 (Analysis task) Monday 8 November 2004 Reading time: 9.00
More informationQUALIFYING EXAM IN SYSTEMS ENGINEERING
QUALIFYING EXAM IN SYSTEMS ENGINEERING Written Exam: MAY 23, 2017, 9:00AM to 1:00PM, EMB 105 Oral Exam: May 25 or 26, 2017 Time/Location TBA (~1 hour per student) CLOSED BOOK, NO CHEAT SHEETS BASIC SCIENTIFIC
More informationWithout fully opening the exam, check that you have pages 1 through 12.
MTH 33 Exam 2 April th, 208 Name: Section: Recitation Instructor: INSTRUCTIONS Fill in your name, etc. on this first page. Without fully opening the exam, check that you have pages through 2. Show all
More informationM/G/1 and M/G/1/K systems
M/G/1 and M/G/1/K systems Dmitri A. Moltchanov dmitri.moltchanov@tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Description of M/G/1 system; Methods of analysis; Residual life approach; Imbedded
More informationExam 3 December 1, 2010
Exam 3 Instructions: You have 60 minutes to complete this exam. This is a closed-book, closed-notes exam. You are allowed to use a calculator during the exam. All work must be shown to receive credit.
More informationLecture 5: Moment generating functions
Lecture 5: Moment generating functions Definition 2.3.6. The moment generating function (mgf) of a random variable X is { x e tx f M X (t) = E(e tx X (x) if X has a pmf ) = etx f X (x)dx if X has a pdf
More informationRandom 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 informationChapter 5. Statistical Models in Simulations 5.1. Prof. Dr. Mesut Güneş Ch. 5 Statistical Models in Simulations
Chapter 5 Statistical Models in Simulations 5.1 Contents Basic Probability Theory Concepts Discrete Distributions Continuous Distributions Poisson Process Empirical Distributions Useful Statistical Models
More informationMAT SYS 5120 (Winter 2012) Assignment 5 (not to be submitted) There are 4 questions.
MAT 4371 - SYS 5120 (Winter 2012) Assignment 5 (not to be submitted) There are 4 questions. Question 1: Consider the following generator for a continuous time Markov chain. 4 1 3 Q = 2 5 3 5 2 7 (a) Give
More informationQUESTION BOOKLET 2016 Subject : Paper III : Mathematics
QUESTION BOOKLET 06 Subject : Paper III : Mathematics ** Question Booklet Version Roll No. Question Booklet Sr. No. (Write this number on your Answer Sheet) Answer Sheet No. (Write this number on your
More informationMTH 133 Solutions to Exam 2 April 19, Without fully opening the exam, check that you have pages 1 through 12.
MTH 33 Solutions to Exam 2 April 9, 207 Name: Section: Recitation Instructor: INSTRUCTIONS Fill in your name, etc. on this first page. Without fully opening the exam, check that you have pages through
More informationReading Time: 15 minutes Writing Time: 1 hour. Structure of Booklet. Number of questions to be answered
Reading Time: 15 minutes Writing Time: 1 hour Student Name: Structure of Booklet Number of questions Number of questions to be answered Number of marks 10 10 40 Students are permitted to bring into the
More informationLECTURE #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 informationPreliminary statistics
1 Preliminary statistics The solution of a geophysical inverse problem can be obtained by a combination of information from observed data, the theoretical relation between data and earth parameters (models),
More informationPart IA Probability. Definitions. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015
Part IA Probability Definitions Based on lectures by R. Weber Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after lectures.
More informationECE Lecture #10 Overview
ECE 450 - Lecture #0 Overview Introduction to Random Vectors CDF, PDF Mean Vector, Covariance Matrix Jointly Gaussian RV s: vector form of pdf Introduction to Random (or Stochastic) Processes Definitions
More informationBrownian Motion. 1 Definition Brownian Motion Wiener measure... 3
Brownian Motion Contents 1 Definition 2 1.1 Brownian Motion................................. 2 1.2 Wiener measure.................................. 3 2 Construction 4 2.1 Gaussian process.................................
More informationMTH 133 Solutions to Exam 2 November 15, Without fully opening the exam, check that you have pages 1 through 13.
MTH 33 Solutions to Exam 2 November 5, 207 Name: Section: Recitation Instructor: INSTRUCTIONS Fill in your name, etc. on this first page. Without fully opening the exam, check that you have pages through
More informationThe story of the film so far... Mathematics for Informatics 4a. Continuous-time Markov processes. Counting processes
The story of the film so far... Mathematics for Informatics 4a José Figueroa-O Farrill Lecture 19 28 March 2012 We have been studying stochastic processes; i.e., systems whose time evolution has an element
More informationWithout fully opening the exam, check that you have pages 1 through 10.
MTH 234 Solutions to Exam 2 April 11th 216 Name: Section: Recitation Instructor: INSTRUTIONS Fill in your name, etc. on this first page. Without fully opening the exam, check that you have pages 1 through
More informationMATH 104 : Final Exam
MATH 104 : Final Exam 10 May, 2017 Name: You have 3 hours to answer the questions. You are allowed one page (front and back) worth of notes. The page should not be larger than a standard US letter size.
More information