Statistical Computing: Exam 1 Chapters 1, 3, 5
|
|
- Cordelia Moody
- 5 years ago
- Views:
Transcription
1 Statistical Computing: Exam Chapters, 3, 5 Instructions: Read each question carefully before determining the best answer. Show all work; supporting computer code and output must be attached to the question for which it is used. Use computer output as a guide only; all questions must be answered in full on the exam paper. Report all final numerical answers to a precision of 4 units past the decimal point. There are total points on this exam. Do not discuss this exam or its components with anyone besides the course instructor. This exam is due February 27, 28, at 2:5 PM.. (5 points) Suppose U ~ U(,). Using the transformation technique from mathematical statistics, show that T = U ~ U(,). Be sure to clearly explain the reasoning underlying all of your steps. (Hint: work with indicator functions to explicitly show over what support ranges the variables are defined.) Let U ~ U(,). As per the Hint, the p.d.f. is clearly f U (u) = I (,) (u), where I A (u) is the indicator function that returns if u A and zero otherwise. Now take T = g(u) = U. To find f T (t) via the transformation technique we need the inverse function g (u), which is clearly g (t) = u = t for any t (,). Notice that the support of T is also the unit interval (,), so f T (t) will be defined using the indicator function I (,) (t). With this, apply Theorem 2..5 from Casella & Berger (22): f T (t) = f U (g (t)) g (t)/ t I (,) (t). Clearly f U (g (t)) = I (,) ( t), while g (t)/ t = ( t)/ t =. Thus we find f T (t) = I (,) ( t) I (,) (t) Since the product I (,) ( t)i (,) (t) always equals the result of I (,) (t), we find f T (t) = I (,) (t) which shows that T ~ U(,), as desired.
2 2. Consider the function ƒ X (x) = 4 x3 I (,2) (x). It can be seen that this is a valid p.d.f., so suppose a random variable X possesses this distribution. We wish to approximate moments of X via Monte Carlo integration using the simple Monte Carlo approach in Sec a. (5 points) Target the second moment = E[X ] = x2 ƒ X (x) dx = 4 x5 dx. Begin by transforming so that the range of integration is over the unit interval < u <, i.e., find a function (u) such that = g 2 (u) du. 2 Clearly, by setting u = x/2 we have x = 2u so that = 4 x5 dx = 4 (2u)5 (2du) = 4 26 u 5 du = Thus for = 64 4 u5 du = 6u5 du. (u) du, we require (u) = 6 u5. b. (5 points) Next, generate m =, pseudo-random variates from the U(,) distribution and use these to approximate the integral = (u) du. Before generating any Monte Carlo variates, set your seed to 2. Sample R code is: g2 = function(u) {6 * u^5 * (u>) * (u<)} m = set.seed( 2 ) u = runif( m, min=, max= ) round( mean(g2(u)), digits=4) an approximation for = E[X 2 ] of [] cont d
3 2. Monte Carlo integration for = E[X 2 ] (cont d). c. (5 points) From the random variates you employed in part (b), estimate the variance of your approximation for. Sample R code using a denominator of m in the sample variance is v2 = var(g2(u))/m round( v2, digits=6 ) [].592 If you choose to use a denominator of m in the variance, sample code is var(g2(u))*(m-)/m^2 essentially the same value: [].598
4 3. Return to the p.d.f. from Problem #2 and in particular to the integral = (u) du. a. ( points) Mimic the approach you took in Problem #2(b) but now approximate using antithetic variables. To do so, generate a new set of m=,/2 Monte Carlo variates after setting your seed to 3. Sample R code is: m = set.seed( 3 ) u = runif( m/2, min=, max=) w = (g2(u) + g2(-u))/2 round( mean( w ), digits=4 ) # uses only /2 = 5 variates an antithetic approximation for = [] u5 du of b. ( points) From the random variates you employed in part (a), estimate the variance of your approximation for. (Use the usual sample variance with a denominator of m.) Also calculate the percent reduction in variance over the approximation from Problem #2(c). Sample R code using a denominator of m in the sample variance is v3 = var(w)/(m/2) print( v3 ) [] or The % reduction can be found via the R code round( (v2-v3)/v2, digits=6 ) [] i.e., a % reduction in variance.
5 4. Return to the p.d.f. from Problem #2 and in particular to the integral = (u) du. a. (5 points) Now approximate using control variates. The target integrand here is (u) from Problem #2(a). For the control variate use h(u) = 6u 6. To find the correlation between (U) and h(u), generate a preliminary Monte Carlo sample of m = 5, variates, using a seed of 4. Report (i) the approximated Correlation between (U) and h(u) = 6U 6 and (ii) the consequent value of c* you will use for the control-variate approximation of. We will need the population mean of the control variate: μ = E[h(U)] = h(u) du = 6 u6 dx = 6 7 u7 = 6 7. This is employed in the control variate expression (U) + c*[h(u) μ] where (U) = 6U 5. Sample R code is: m = 5 h = function(u) {6 * u^6 * (u>) * (u<)}; mu = 6/7 set.seed( 4 ); u = runif( m ) cstar = -cov(g2(u),h(u))/var(h(u)) #c* for future use c( cor(g2(u),h(u)), cstar) #print out requested values [] i.e., (6U 5,6U 6 ) =.9964 (near ±., as desired) and c* =.57. (Note that we can determine the Covariance and hence the Correlation analytically for this problem, due to the elementary forms of and h. The actual value is [6U 5,6U 6 ] = ) b. ( points) Next, to employ the control variate algorithm generate a new set of m=, Monte Carlo variates after re-setting your seed to 4. Use these to compute a control-variate approximation for. Sample R code [including c* =.57 and μ = 6/7 from part (a)] is: m = set.seed( 4 ); u = runif( m ) theta.g = g2(u) theta.control = theta.g + cstar*(h(u) - mu) round( c(mean(theta.g), mean(theta.control)), digits=4 ) [] That is, another approximation for using simple Monte Carlo integration as in Problem #2(b) is the first value of , while a control-variate approximation for is cont d
6 4. Control variate integration for = (u) du (cont d). c. ( points) From the random variates you employed in parts (a)-(b), calculate the variance of your estimate of. (Use the usual sample variance with a denominator of m.) Also calculate the percent reduction in variance over the simple Monte Carlo approximation you found in Problem #2(c). Sample R code using a denominator of m in the sample variance is v4 = var(theta.control)/m print( v4 ) [].39866e-5 i.e., The % reduction can be found via the R code round( (v2-v4)/v2, digits=6) [] i.e., a sizeable % reduction in variance.
7 5. Return to the p.d.f. from Problem #2 and in particular to the integral = (x) dx. Now approximate using importance sampling. Take (u) from Problem #2(a) and for the importance function ƒ(x) consider each of the following possible choices. In each case, (i) approximate using a Monte Carlo sample of m =, simulated variates and (ii) estimate the variance of that estimate from the Monte Carlo sample. a. ( points) ƒ(x) = 2( x) I (,) (x). Set your seed to 5. The importance function here is the Beta(,2) density. So, sample from X ~ Beta(,2) and calculate the objective ratio (x) ƒ(x) = 6x 5 2( x) = 8 x 5 ( x). Sample R code (fairly simple, since X ~ Beta(,2) has the same target support): m = set.seed(5) x = rbeta(m,,2) gfratio = 8 * (x^5) / (-x) c( mean(gfratio), var(gfratio)/m ) produces [] i.e. (i) estimate as with (ii) variance =.455. If instead using the inverse probability transform to generate X ~ Beta(,2), find the c.d.f. as F(x) = x, so that F (u) = ( u) /2 produces the desired X from U ~ U(,). Sample R code: m = set.seed(5) x = - sqrt( - runif(m)) gfratio = 8 * (x^5) / (-x) c( mean(gfratio), var(gfratio)/m ) produces [] i.e. (i) estimate as with (ii) variance =.24. cont d
8 5. Importance sampling integration for = (u) du (cont d). b. ( points) ƒ(x) = e x I (, ) (x). Set your seed to 52. The importance function here is the Exp() density. So, sample from X ~ Exp() and calculate the objective ratio (x) ƒ(x) = 6x5 I (,) (x) e x I (, ) (x) = 6 x 5 e x I (,) (x). Notice the use of an indicator function to discard any values of x >. Sample R code is: m = set.seed(52) x = rexp(m,) gfratio = 6 * (x^5) * exp(x) * (x>) * (x<) c( mean(gfratio), var(gfratio)/m ) [] i.e. (i) estimate as with (ii) variance = cont d
9 5. Importance sampling integration for = (u) du (cont d). c. (5 points) ƒ(x) = 6x 5 I (,) (x). Use any seed you wish. Explain the unfamiliar result that results. The importance function here is the Beta(6,) density, so we sample from X ~ Beta(6,) and calculate the objective ratio (x) ƒ(x) = 6x5 6x 5 = 6 6 But this is exactly constant and not a function of x! The corresponding R code is rather trivial (for any choice of seed, the answer is always the same): m = set.seed( ) x = rbeta( m,6, ) #this is never used! gfratio = 6/6 c( mean(gfratio), var(gfratio)/m ) [] NA What has happened? If we can find an importance function ƒ(x) that produces an exactly constant importance ratio, (x)/ƒ(x), over a finite range of integration, importance sampling integrates that constant over the finite range. This should produce the exact answer for the integral. Here, it is 6/6 = Notice the NA for the variance: there is only value for gfratio, as it doesn t depend upon x, and R cannot compute a variance for value. In effect, all the simulated values are the same so there is no observed variation in the simulated sample.
RYERSON UNIVERSITY DEPARTMENT OF MATHEMATICS MTH 514 Stochastic Processes
RYERSON UNIVERSITY DEPARTMENT OF MATHEMATICS MTH 514 Stochastic Processes Midterm 2 Assignment Last Name (Print):. First Name:. Student Number: Signature:. Date: March, 2010 Due: March 18, in class. Instructions:
More informationThis exam is closed book and closed notes. (You will have access to a copy of the Table of Common Distributions given in the back of the text.
TEST #3 STA 5326 December 4, 214 Name: Please read the following directions. DO NOT TURN THE PAGE UNTIL INSTRUCTED TO DO SO Directions This exam is closed book and closed notes. (You will have access to
More information1. There are 8 questions spanning 9 pages total (including this cover page). Please make sure that you have all 9 pages before starting.
Instructor: K. Rotz Name: Solution PUID: 00000-00000 Instructions and tips: 1. There are 8 questions spanning 9 pages total (including this cover page). Please make sure that you have all 9 pages before
More informationThis exam contains 6 questions. The questions are of equal weight. Print your name at the top of this page in the upper right hand corner.
GROUND RULES: This exam contains 6 questions. The questions are of equal weight. Print your name at the top of this page in the upper right hand corner. This exam is closed book and closed notes. Show
More informationChapter 5: Integrals
Chapter 5: Integrals Section 5.5 The Substitution Rule (u-substitution) Sec. 5.5: The Substitution Rule We know how to find the derivative of any combination of functions Sum rule Difference rule Constant
More informationSemester , Example Exam 1
Semester 1 2017, Example Exam 1 1 of 10 Instructions The exam consists of 4 questions, 1-4. Each question has four items, a-d. Within each question: Item (a) carries a weight of 8 marks. Item (b) carries
More informationNUMERICAL METHODS. x n+1 = 2x n x 2 n. In particular: which of them gives faster convergence, and why? [Work to four decimal places.
NUMERICAL METHODS 1. Rearranging the equation x 3 =.5 gives the iterative formula x n+1 = g(x n ), where g(x) = (2x 2 ) 1. (a) Starting with x = 1, compute the x n up to n = 6, and describe what is happening.
More informationMath 42: Fall 2015 Midterm 2 November 3, 2015
Math 4: Fall 5 Midterm November 3, 5 NAME: Solutions Time: 8 minutes For each problem, you should write down all of your work carefully and legibly to receive full credit When asked to justify your answer,
More informationChapter 5: Integrals
Chapter 5: Integrals Section 5.3 The Fundamental Theorem of Calculus Sec. 5.3: The Fundamental Theorem of Calculus Fundamental Theorem of Calculus: Sec. 5.3: The Fundamental Theorem of Calculus Fundamental
More informationStochastic Simulation Variance reduction methods Bo Friis Nielsen
Stochastic Simulation Variance reduction methods Bo Friis Nielsen Applied Mathematics and Computer Science Technical University of Denmark 2800 Kgs. Lyngby Denmark Email: bfni@dtu.dk Variance reduction
More informationECE302 Exam 2 Version A April 21, You must show ALL of your work for full credit. Please leave fractions as fractions, but simplify them, etc.
ECE32 Exam 2 Version A April 21, 214 1 Name: Solution Score: /1 This exam is closed-book. You must show ALL of your work for full credit. Please read the questions carefully. Please check your answers
More informationFinal Exam. Math 3 Daugherty March 13, 2012
Final Exam Math 3 Daugherty March 3, 22 Name (Print): Last First On this, the Final Math 3 exams in Winter 22, I will work individually, neither giving nor receiving help, guided by the Dartmouth Academic
More informationExercise 5 Release: Due:
Stochastic Modeling and Simulation Winter 28 Prof. Dr. I. F. Sbalzarini, Dr. Christoph Zechner (MPI-CBG/CSBD TU Dresden, 87 Dresden, Germany Exercise 5 Release: 8..28 Due: 5..28 Question : Variance of
More informationStatistics 3657 : Moment Approximations
Statistics 3657 : Moment Approximations Preliminaries Suppose that we have a r.v. and that we wish to calculate the expectation of g) for some function g. Of course we could calculate it as Eg)) by the
More informationBindel, Fall 2011 Intro to Scientific Computing (CS 3220) Week 14: Monday, May 2
Logistics Week 14: Monday, May 2 Welcome to the last week of classes! Project 3 is due Friday, May 6. Final is Friday, May 13. Lecture Wednesday will be a review, and section this week will be devoted
More informationYORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH A Test #2 June 11, Solutions
YORK UNIVERSITY Faculty of Science Department of Mathematics and Statistics MATH 2. A Test #2 June, 2 Solutions. (5 + 5 + 5 pts) The probability of a student in MATH 4 passing a test is.82. Suppose students
More informationChapter 4 Continuous Random Variables and Probability Distributions
Chapter 4 Continuous Random Variables and Probability Distributions Part 1: Continuous Random Variables Section 4.1 Continuous Random Variables Section 4.2 Probability Distributions & Probability Density
More informationMidterm Examination. STA 215: Statistical Inference. Due Wednesday, 2006 Mar 8, 1:15 pm
Midterm Examination STA 215: Statistical Inference Due Wednesday, 2006 Mar 8, 1:15 pm This is an open-book take-home examination. You may work on it during any consecutive 24-hour period you like; please
More informationContinuous random variables
Continuous random variables Can take on an uncountably infinite number of values Any value within an interval over which the variable is definied has some probability of occuring This is different from
More informationMA 1128: Lecture 19 4/20/2018. Quadratic Formula Solving Equations with Graphs
MA 1128: Lecture 19 4/20/2018 Quadratic Formula Solving Equations with Graphs 1 Completing-the-Square Formula One thing you may have noticed when you were completing the square was that you followed the
More informationECE 302 Division 1 MWF 10:30-11:20 (Prof. Pollak) Final Exam Solutions, 5/3/2004. Please read the instructions carefully before proceeding.
NAME: ECE 302 Division MWF 0:30-:20 (Prof. Pollak) Final Exam Solutions, 5/3/2004. Please read the instructions carefully before proceeding. If you are not in Prof. Pollak s section, you may not take this
More informationEco517 Fall 2004 C. Sims MIDTERM EXAM
Eco517 Fall 2004 C. Sims MIDTERM EXAM Answer all four questions. Each is worth 23 points. Do not devote disproportionate time to any one question unless you have answered all the others. (1) We are considering
More informationPage Points Score Total: 100
Math 1130 Spring 2019 Sample Midterm 2a 2/28/19 Name (Print): Username.#: Lecturer: Rec. Instructor: Rec. Time: This exam contains 10 pages (including this cover page) and 9 problems. Check to see if any
More informationContinuous RVs. 1. Suppose a random variable X has the following probability density function: π, zero otherwise. f ( x ) = sin x, 0 < x < 2
STAT 4 Exam I Continuous RVs Fall 27 Practice. Suppose a random variable X has the following probability density function: f ( x ) = sin x, < x < 2 π, zero otherwise. a) Find P ( X < 4 π ). b) Find µ =
More informationChapter 5 Class Notes
Chapter 5 Class Notes Sections 5.1 and 5.2 It is quite common to measure several variables (some of which may be correlated) and to examine the corresponding joint probability distribution One example
More informationMATH5835 Statistical Computing. Jochen Voss
MATH5835 Statistical Computing Jochen Voss September 27, 2011 Copyright c 2011 Jochen Voss J.Voss@leeds.ac.uk This text is work in progress and may still contain typographical and factual mistakes. Reports
More informationQuestion Points Score Total: 76
Math 447 Test 2 March 17, Spring 216 No books, no notes, only SOA-approved calculators. true/false or fill-in-the-blank question. You must show work, unless the question is a Name: Question Points Score
More informationStatistics Ph.D. Qualifying Exam: Part I October 18, 2003
Statistics Ph.D. Qualifying Exam: Part I October 18, 2003 Student Name: 1. Answer 8 out of 12 problems. Mark the problems you selected in the following table. 1 2 3 4 5 6 7 8 9 10 11 12 2. Write your answer
More informationSTT 441 Final Exam Fall 2013
STT 441 Final Exam Fall 2013 (12:45-2:45pm, Thursday, Dec. 12, 2013) NAME: ID: 1. No textbooks or class notes are allowed in this exam. 2. Be sure to show all of your work to receive credit. Credits are
More informationLecture 1: Random number generation, permutation test, and the bootstrap. August 25, 2016
Lecture 1: Random number generation, permutation test, and the bootstrap August 25, 2016 Statistical simulation 1/21 Statistical simulation (Monte Carlo) is an important part of statistical method research.
More informationThe bootstrap. Patrick Breheny. December 6. The empirical distribution function The bootstrap
Patrick Breheny December 6 Patrick Breheny BST 764: Applied Statistical Modeling 1/21 The empirical distribution function Suppose X F, where F (x) = Pr(X x) is a distribution function, and we wish to estimate
More informationSTAT:2020 Probability and Statistics for Engineers Exam 2 Mock-up. 100 possible points
STAT:2020 Probability and Statistics for Engineers Exam 2 Mock-up 100 possible points Student Name Section [letter/#] Section [day/time] Instructions: 1) Make sure you have the correct number of pages.
More informationApplied Statistics and Probability for Engineers. Sixth Edition. Chapter 4 Continuous Random Variables and Probability Distributions.
Applied Statistics and Probability for Engineers Sixth Edition Douglas C. Montgomery George C. Runger Chapter 4 Continuous Random Variables and Probability Distributions 4 Continuous CHAPTER OUTLINE Random
More informationChapter 4 Continuous Random Variables and Probability Distributions
Applied Statistics and Probability for Engineers Sixth Edition Douglas C. Montgomery George C. Runger Chapter 4 Continuous Random Variables and Probability Distributions 4 Continuous CHAPTER OUTLINE 4-1
More informationSTAT/MA 416 Midterm Exam 3 Monday, November 19, Circle the section you are enrolled in:
STAT/MA 46 Midterm Exam 3 Monday, November 9, 27 Name Purdue student ID ( digits) Circle the section you are enrolled in: STAT/MA 46-- STAT/MA 46-2- 9: AM :5 AM 3: PM 4:5 PM REC 4 UNIV 23. The testing
More informationFinal exam (practice) UCLA: Math 31B, Spring 2017
Instructor: Noah White Date: Final exam (practice) UCLA: Math 31B, Spring 2017 This exam has 8 questions, for a total of 80 points. Please print your working and answers neatly. Write your solutions in
More informationExam 3, Math Fall 2016 October 19, 2016
Exam 3, Math 500- Fall 06 October 9, 06 This is a 50-minute exam. You may use your textbook, as well as a calculator, but your work must be completely yours. The exam is made of 5 questions in 5 pages,
More informationProbability Midterm Exam 2:15-3:30 pm Thursday, 21 October 1999
Name: 2:15-3:30 pm Thursday, 21 October 1999 You may use a calculator and your own notes but may not consult your books or neighbors. Please show your work for partial credit, and circle your answers.
More informationTransformations of Standard Uniform Distributions
Transformations of Standard Uniform Distributions We have seen that the R function runif uses a random number generator to simulate a sample from the standard uniform distribution UNIF(0, 1). All of our
More informationMultiple Choice Answers. MA 114 Calculus II Spring 2013 Final Exam 1 May Question
MA 114 Calculus II Spring 2013 Final Exam 1 May 2013 Name: Section: Last 4 digits of student ID #: This exam has six multiple choice questions (six points each) and five free response questions with points
More informationClass 8 Review Problems 18.05, Spring 2014
1 Counting and Probability Class 8 Review Problems 18.05, Spring 2014 1. (a) How many ways can you arrange the letters in the word STATISTICS? (e.g. SSSTTTIIAC counts as one arrangement.) (b) If all arrangements
More informationLast/Family Name First/Given Name Seat #
Math 2, Fall 27 Schaeffer/Kemeny Final Exam (December th, 27) Last/Family Name First/Given Name Seat # Failure to follow the instructions below will constitute a breach of the Stanford Honor Code: You
More informationFinal exam (practice) UCLA: Math 31B, Spring 2017
Instructor: Noah White Date: Final exam (practice) UCLA: Math 3B, Spring 207 This exam has 8 questions, for a total of 80 points. Please print your working and answers neatly. Write your solutions in the
More informationp. 6-1 Continuous Random Variables p. 6-2
Continuous Random Variables Recall: For discrete random variables, only a finite or countably infinite number of possible values with positive probability (>). Often, there is interest in random variables
More informationb) Write the contrapositive of this given statement: If I finish ALEKS, then I get points.
Math 141 Name: QUIZ 1A (CHAPTER 0: PRELIMINARY TOPICS) MATH 141 SPRING 2019 KUNIYUKI 90 POINTS TOTAL No notes or books allowed. A scientific calculator is allowed. Simplify as appropriate. Check one: Can
More informationSTA 4322 Exam I Name: Introduction to Statistics Theory
STA 4322 Exam I Name: Introduction to Statistics Theory Fall 2013 UF-ID: Instructions: There are 100 total points. You must show your work to receive credit. Read each part of each question carefully.
More informationSTAT 515 MIDTERM 2 EXAM November 14, 2018
STAT 55 MIDTERM 2 EXAM November 4, 28 NAME: Section Number: Instructor: In problems that require reasoning, algebraic calculation, or the use of your graphing calculator, it is not sufficient just to write
More informationIndependent Events. Two events are independent if knowing that one occurs does not change the probability of the other occurring
Independent Events Two events are independent if knowing that one occurs does not change the probability of the other occurring Conditional probability is denoted P(A B), which is defined to be: P(A and
More informationSimulation. Where real stuff starts
1 Simulation Where real stuff starts ToC 1. What is a simulation? 2. Accuracy of output 3. Random Number Generators 4. How to sample 5. Monte Carlo 6. Bootstrap 2 1. What is a simulation? 3 What is a simulation?
More informationSolving Linear Equations (in one variable)
Solving Linear Equations (in one variable) In Chapter of my Elementary Algebra text you are introduced to solving linear equations. The main idea presented throughout Sections.1. is that you need to isolate
More informationMath WW08 Solutions November 19, 2008
Math 352- WW08 Solutions November 9, 2008 Assigned problems 8.3 ww ; 8.4 ww 2; 8.5 4, 6, 26, 44; 8.6 ww 7, ww 8, 34, ww 0, 50 Always read through the solution sets even if your answer was correct. Note
More informationMAS1302 Computational Probability and Statistics
MAS1302 Computational Probability and Statistics April 23, 2008 3. Simulating continuous random behaviour 3.1 The Continuous Uniform U(0,1) Distribution We have already used this random variable a great
More informationAP Exam Practice Questions for Chapter 4
AP Exam Practice Questions for Chapter AP Exam Practice Questions for Chapter f x = x +. f x = f x dx = x + dx. The equation of the line is ( ) ( ) ( ) ( ) Use f ( ) = to find C. ( ) ( ) C f( x) = x +
More informationSTAT100 Elementary Statistics and Probability
STAT100 Elementary Statistics and Probability Exam, Sample Test, Summer 014 Solution Show all work clearly and in order, and circle your final answers. Justify your answers algebraically whenever possible.
More information2. As we shall see, we choose to write in terms of σ x because ( X ) 2 = σ 2 x.
Section 5.1 Simple One-Dimensional Problems: The Free Particle Page 9 The Free Particle Gaussian Wave Packets The Gaussian wave packet initial state is one of the few states for which both the { x } and
More informationThis exam is closed book and closed notes. (You will have access to a copy of the Table of Common Distributions given in the back of the text.
TEST #3 STA 536 December, 00 Name: Please read the following directions. DO NOT TURN THE PAGE UNTIL INSTRUCTED TO DO SO Directions This exam is closed book and closed notes. You will have access to a copy
More informationIntroduction to SparseGrid
Introduction to SparseGrid Jelmer Ypma July 31, 2013 Abstract This vignette describes how to use SparseGrid, which is an R translation 1 of the Matlab code on http://www.sparse-grids.de (Heiss and Winschel,
More informationAdvanced Statistical Regression Analysis: Mid-Term Exam Chapters 1-5
Advanced Statistical Regression Analysis: Mid-Term Exam Chapters 1-5 Instructions: Read each question carefully before determining the best answer. Show all work; supporting computer code and output must
More informationSpring 2018 Exam 1 MARK BOX HAND IN PART NAME: PIN:
problem MARK BOX points HAND IN PART - 65=x5 4 5 5 6 NAME: PIN: % INSTRUCTIONS This exam comes in two parts. () HAND IN PART. Hand in only this part. () STATEMENT OF MULTIPLE CHOICE PROBLEMS. Do not hand
More informationBefore you begin read these instructions carefully.
MATHEMATICAL TRIPOS Part IA Friday, 1 June, 2012 1:30 pm to 4:30 pm PAPER 2 Before you begin read these instructions carefully. The examination paper is divided into two sections. Each question in Section
More informationMATH 3510: PROBABILITY AND STATS July 1, 2011 FINAL EXAM
MATH 3510: PROBABILITY AND STATS July 1, 2011 FINAL EXAM YOUR NAME: KEY: Answers in blue Show all your work. Answers out of the blue and without any supporting work may receive no credit even if they are
More informationContinuous RVs. 1. Suppose a random variable X has the following probability density function: π, zero otherwise. f ( x ) = sin x, 0 < x < 2
STAT 4 Exam I Continuous RVs Fall 7 Practice. Suppose a random variable X has the following probability density function: f ( x ) = sin x, < x < π, zero otherwise. a) Find P ( X < 4 π ). b) Find µ = E
More information5.2 Continuous random variables
5.2 Continuous random variables It is often convenient to think of a random variable as having a whole (continuous) interval for its set of possible values. The devices used to describe continuous probability
More informationStatistics 427: Sample Final Exam
Statistics 427: Sample Final Exam Instructions: The following sample exam was given several quarters ago in Stat 427. The same topics were covered in the class that year. This sample exam is meant to be
More informationUniversity of Connecticut Department of Mathematics
University of Connecticut Department of Mathematics Math 1131 Sample Exam 2 Fall 2015 Name: Instructor Name: Section: TA Name: Discussion Section: This sample exam is just a guide to prepare for the actual
More informationMA 125 CALCULUS I SPRING 2007 April 27, 2007 FINAL EXAM. Name (Print last name first):... Student ID Number (last four digits):...
CALCULUS I, FINAL EXAM 1 MA 125 CALCULUS I SPRING 2007 April 27, 2007 FINAL EXAM Name (Print last name first):............................................. Student ID Number (last four digits):........................
More informationChemistry 1104 Introduction:
Chemistry 1104 Introduction: Time requirements. Start early. Need help. See instructor early and often. Only requirement: be prepared. Understanding vs. memorization. Chemistry requires practice. Use problem
More informationFall 2016 Exam 1 HAND IN PART NAME: PIN:
HAND IN PART MARK BOX problem points 0 15 1-12 60 13 10 14 15 NAME: PIN: % 100 INSTRUCTIONS This exam comes in two parts. (1) HAND IN PART. Hand in only this part. (2) STATEMENT OF MULTIPLE CHOICE PROBLEMS.
More informationSampling Distributions of Statistics Corresponds to Chapter 5 of Tamhane and Dunlop
Sampling Distributions of Statistics Corresponds to Chapter 5 of Tamhane and Dunlop Slides prepared by Elizabeth Newton (MIT), with some slides by Jacqueline Telford (Johns Hopkins University) 1 Sampling
More informationCalculus I Practice Final Exam B
Calculus I Practice Final Exam B This practice exam emphasizes conceptual connections and understanding to a greater degree than the exams that are usually administered in introductory single-variable
More informationHOMEWORK #4: LOGISTIC REGRESSION
HOMEWORK #4: LOGISTIC REGRESSION Probabilistic Learning: Theory and Algorithms CS 274A, Winter 2018 Due: Friday, February 23rd, 2018, 11:55 PM Submit code and report via EEE Dropbox You should submit a
More informationNegative Association, Ordering and Convergence of Resampling Methods
Negative Association, Ordering and Convergence of Resampling Methods Nicolas Chopin ENSAE, Paristech (Joint work with Mathieu Gerber and Nick Whiteley, University of Bristol) Resampling schemes: Informal
More informationReduction of Variance. Importance Sampling
Reduction of Variance As we discussed earlier, the statistical error goes as: error = sqrt(variance/computer time). DEFINE: Efficiency = = 1/vT v = error of mean and T = total CPU time How can you make
More informationNguyen, N., Rock, D., and Ying, V. Math 470 Spring 2011 Project 5 Problem 3.24
Problem 3.24 Here are some modifications of Example 3.8 with consequences that may not be apparent at first. Consider. (a) For and, compare the Riemann approximation with the Monte Carlo approximation.
More informationTest 2 - Answer Key Version A
MATH 8 Student s Printed Name: Instructor: CUID: Section: Fall 27 8., 8.2,. -.4 Instructions: You are not permitted to use a calculator on any portion of this test. You are not allowed to use any textbook,
More informationSo we will instead use the Jacobian method for inferring the PDF of functionally related random variables; see Bertsekas & Tsitsiklis Sec. 4.1.
2011 Page 1 Simulating Gaussian Random Variables Monday, February 14, 2011 2:00 PM Readings: Kloeden and Platen Sec. 1.3 Why does the Box Muller method work? How was it derived? The basic idea involves
More informationMonte Carlo Integration
Monte Carlo Integration SCX5005 Simulação de Sistemas Complexos II Marcelo S. Lauretto www.each.usp.br/lauretto Reference: Robert CP, Casella G. Introducing Monte Carlo Methods with R. Springer, 2010.
More informationProblem Set 2. MAS 622J/1.126J: Pattern Recognition and Analysis. Due: 5:00 p.m. on September 30
Problem Set 2 MAS 622J/1.126J: Pattern Recognition and Analysis Due: 5:00 p.m. on September 30 [Note: All instructions to plot data or write a program should be carried out using Matlab. In order to maintain
More informationAP CALCULUS BC 2006 SCORING GUIDELINES (Form B) Question 2
AP CALCULUS BC 2006 SCORING GUIDELINES (Form B) Question 2 An object moving along a curve in the xy-plane is at position ( x() t, y() t ) at time t, where dx t tan( e ) for t 0. At time t =, the object
More informationChapter 5: Monte Carlo Integration and Variance Reduction
Chapter 5: Monte Carlo Integration and Variance Reduction Lecturer: Zhao Jianhua Department of Statistics Yunnan University of Finance and Economics Outline 5.2 Monte Carlo Integration 5.2.1 Simple MC
More informationMA EXAM 2 INSTRUCTIONS VERSION 01 March 9, Section # and recitation time
MA 16600 EXAM INSTRUCTIONS VERSION 01 March 9, 016 Your name Student ID # Your TA s name Section # and recitation time 1. You must use a # pencil on the scantron sheet (answer sheet).. Check that the cover
More informationSpring 2018 Exam 1 MARK BOX HAND IN PART PIN: 17
problem MARK BOX points HAND IN PART -3 653x5 5 NAME: Solutions 5 6 PIN: 7 % INSTRUCTIONS This exam comes in two parts. () HAND IN PART. Hand in only this part. () STATEMENT OF MULTIPLE CHOICE PROBLEMS.
More informationModeling Uncertainty in the Earth Sciences Jef Caers Stanford University
Probability theory and statistical analysis: a review Modeling Uncertainty in the Earth Sciences Jef Caers Stanford University Concepts assumed known Histograms, mean, median, spread, quantiles Probability,
More informationFINAL EXAM: 3:30-5:30pm
ECE 30: Probabilistic Methods in Electrical and Computer Engineering Spring 016 Instructor: Prof. A. R. Reibman FINAL EXAM: 3:30-5:30pm Spring 016, MWF 1:30-1:0pm (May 6, 016) This is a closed book exam.
More informationCourse information: Instructor: Tim Hanson, Leconte 219C, phone Office hours: Tuesday/Thursday 11-12, Wednesday 10-12, and by appointment.
Course information: Instructor: Tim Hanson, Leconte 219C, phone 777-3859. Office hours: Tuesday/Thursday 11-12, Wednesday 10-12, and by appointment. Text: Applied Linear Statistical Models (5th Edition),
More informationSTATISTICS 1 REVISION NOTES
STATISTICS 1 REVISION NOTES Statistical Model Representing and summarising Sample Data Key words: Quantitative Data This is data in NUMERICAL FORM such as shoe size, height etc. Qualitative Data This is
More informationChapter 3 Common Families of Distributions
Lecture 9 on BST 631: Statistical Theory I Kui Zhang, 9/3/8 and 9/5/8 Review for the previous lecture Definition: Several commonly used discrete distributions, including discrete uniform, hypergeometric,
More informationMA FINAL EXAM Form A December 16, You must use a #2 pencil on the mark sense sheet (answer sheet).
MA 600 FINAL EXAM Form A December 6, 05 NAME STUDENT ID # YOUR TA S NAME RECITATION TIME. You must use a # pencil on the mark sense sheet (answer sheet).. If the cover of your question booklet is GREEN,
More informationDetermination of Density 1
Introduction Determination of Density 1 Authors: B. D. Lamp, D. L. McCurdy, V. M. Pultz and J. M. McCormick* Last Update: February 1, 2013 Not so long ago a statistical data analysis of any data set larger
More informationBasics on Probability. Jingrui He 09/11/2007
Basics on Probability Jingrui He 09/11/2007 Coin Flips You flip a coin Head with probability 0.5 You flip 100 coins How many heads would you expect Coin Flips cont. You flip a coin Head with probability
More informationMath 116 Final Exam April 21, 2016
Math 6 Final Exam April 2, 206 UMID: Instructor: Initials: Section:. Do not open this exam until you are told to do so. 2. Do not write your name anywhere on this exam. 3. This exam has 4 pages including
More informationCalculus I Practice Exam 2A
Calculus I Practice Exam 2A This practice exam emphasizes conceptual connections and understanding to a greater degree than the exams that are usually administered in introductory single-variable calculus
More informationMarkov Chain Monte Carlo Lecture 1
What are Monte Carlo Methods? The subject of Monte Carlo methods can be viewed as a branch of experimental mathematics in which one uses random numbers to conduct experiments. Typically the experiments
More informationSTA 2101/442 Assignment 2 1
STA 2101/442 Assignment 2 1 These questions are practice for the midterm and final exam, and are not to be handed in. 1. A polling firm plans to ask a random sample of registered voters in Quebec whether
More informationCSCI-6971 Lecture Notes: Monte Carlo integration
CSCI-6971 Lecture otes: Monte Carlo integration Kristopher R. Beevers Department of Computer Science Rensselaer Polytechnic Institute beevek@cs.rpi.edu February 21, 2006 1 Overview Consider the following
More informationLecture 11: Probability, Order Statistics and Sampling
5-75: Graduate Algorithms February, 7 Lecture : Probability, Order tatistics and ampling Lecturer: David Whitmer cribes: Ilai Deutel, C.J. Argue Exponential Distributions Definition.. Given sample space
More informationIE 581 Introduction to Stochastic Simulation. One page of notes, front and back. Closed book. 50 minutes. Score
One page of notes, front and back. Closed book. 50 minutes. Score Schmeiser Page 1 of 4 Test #1, Spring 2001 1. True or false. (If you wish, write an explanation of your thinking.) (a) T Data are "binary"
More informationMath Practice Final - solutions
Math 151 - Practice Final - solutions 2 1-2 -1 0 1 2 3 Problem 1 Indicate the following from looking at the graph of f(x) above. All answers are small integers, ±, or DNE for does not exist. a) lim x 1
More informationIn manycomputationaleconomicapplications, one must compute thede nite n
Chapter 6 Numerical Integration In manycomputationaleconomicapplications, one must compute thede nite n integral of a real-valued function f de ned on some interval I of
More informationSTA205 Probability: Week 8 R. Wolpert
INFINITE COIN-TOSS AND THE LAWS OF LARGE NUMBERS The traditional interpretation of the probability of an event E is its asymptotic frequency: the limit as n of the fraction of n repeated, similar, and
More information