Good luck! Problem 1. (b) The random variables X 1 and X 2 are independent and N(0, 1)-distributed. Show that the random variables X 1
|
|
- Solomon Edwards
- 7 years ago
- Views:
Transcription
1 Avd. Matematisk statistik TETAME I SF2940 SAOLIKHETSTEORI/EXAM I SF2940 PROBABILITY THE- ORY, WEDESDAY OCTOBER 26, 2016, Examinator : Boualem Djehiche, tel , boualem@kth.se Tillåtna hjälpmedel/permitted means of assistance: Appendix 2 in A. Gut: An Intermediate Course in Probability, Formulas for probability theory SF2940, L. Råde & B. Westergren: Mathematics Handbook for Science and Engineering and pocket calculator. All used notation must be explained and defined. Reasoning and the calculations must be so detailed that they are easy to follow. Each problem yields max 10 p. You may apply results stated in a part of an exam question to another part of the exam question even if you have not solved the first part. 25 points will guarantee a passing result. If you have received 5 bonus points from the home assignments, you may skip Problem 1(a. If you have received 10 bonus points, you may skip the whole Problem 1. Solutions to the exam questions will be available at starting from Friday 28 October Good luck! Problem 1 (a The random variables X 1, X 2,..., are non-negative integer-valued and independent and identically distributed (i.i.d.. The random variable Po(a, a > 0, is independent of X 1, X 2,...,. Set S = X 1 + X X. If we know that S Po(b, where 0 < b < a, show that for each k = 1, 2, 3,..., X k Be( b i.e. Bernoulli-distributed with parameter b/a. (5 p a (b The random variables X 1 and X 2 are independent and (0, 1-distributed. Show that the random variables X 1 X 2 and X1 2 + X2 2 are independent and determine their distributions. (5 p (Hint: Use polar coordinates. Problem 2 X 1, X 2,... is a sequence of independent and identically distributed random variables with mean zero and variance σ 2. The random variable is independent of the sequence (X n n 1 and Po (, > 0. Show that
2 cont. exam sf2940 Fall (a P 1, when. (2 p (b d (0, 1, when. (2 p (c X 1 + X X d (0, σ 2,. (6 p Let X and Y be random variables such that Problem 3 Y X = x (x, a 2 with X (µ, b 2. ( X (a Determine the distribution of the vector. (5 p Y (b Determine the distribution of X Y = y. (5 p Problem 4 Let X and Y be two random variables with finite second moment (square-integrable defined on the probability space (Ω, F, P. Let G be a sub-σ-algebra of F. (a Prove that if X and Y are equally distributed (have the same probability distribution then E[X G] = E[Y G] almost surely. (3 p (b Prove that if E[X Y ] = Y and E[Y X] = X, then X = Y almost surely. (3 p (c Let X 1, X 2,..., X n be identically distributed and positive random variables. Show that for any k n [ ] X1 + X X k E = k X 1 + X X n n. (4 p Problem 5 On the space of random variables on (Ω, F, P we set [ ] X Y d(x, Y := E. 1 + X Y
3 cont. exam sf2940 Fall (a Show that d is a metric, that is d(x, X = 0, d(x, Y = d(y, X and d(x, Y d(x, Z + d(z, Y. Let X 1, X 2,..., be a sequence of random variables on the probability space (Ω, F, P. (2 p (b Show that if d(x n, X 0 as n, then X n converges to X in probability as n. (4 p (c Let X 1, X 2,..., be random variables such that P (X n = 1 = 1 1 n, P (X 1/5 n = n = 1, n 2. n1/5 Determine the limit X such that d(x n, X 0 and show that X n does not converge to X in L 1 i.e. E[ X n X ] 0 as n. (4 p (Hint: the function f(t := t, t 0, may be useful. 1+t
4 Avd. Matematisk statistik Suggested solutions to the exam Wednesday October 26, Problem 1 (a Let ϕ X1 (t denote the characteristic function of X 1 and g (s = exp ((s 1 be the probability generating function of Po(a, a > 0. Using the composition formula with characteristic function (5.18 in the Lecture otes, we have ϕ S (t = g (ϕ X1 (t = exp (a(ϕ X1 (t 1. ow, if S Po(b, we should have ϕ S (t = exp (b(e it 1. Hence, which implies that (note that 0 < b/a < 1 exp (a(ϕ X1 (t 1 = exp ( b(e it 1, ϕ X1 (t = b a eit + (1 b a, that is X 1, X 2,... are all Bernoulli Be( b a -distributed. (b Introduce the transformation (X 1, X 2 := ϕ(r, Θ, R > 0, Θ (0, 2π, defined by { X1 = R cos Θ, X 2 = R sin Θ. Then, R = X1 2 + X2 2 and cotanθ = X 2 X 1. Furthermore, the corresponding Jacobian is x x r θ J ϕ := = cos θ r sin θ sin θ r sin θ = r. We have y r y θ f (R,Θ (r, θ = f (X1,X 2 (r cos θ, r sin θ J ϕ = 1 r 2 2π re 2 = fθ (θf R (r, r > 0, θ (0, 2π where, f Θ (θ = 1, θ (0, 2π which is the density of the uniform distribution over (0, 2π 2π and f R (r = re r2 2, r > 0 which is the density of the Rayleigh R(2 distribution. Θ U(0, 2π and R R(2 and are independent. Problem 2 The random variable Po( has E[] = Var( = and its characteristic function is ϕ (t = exp ((e it 1.
5 cont. exam sf2940 Fall (a This question can be solved either using Chebychev s inequality or the Cramér-Slutzky s theorem. Using Chebychev s inequality we have, for every fixed ɛ > 0, ( P 1 > ɛ = P ( > ɛ 1 ɛ 2 Var( = 2 ɛ 2 = 1 2 ɛ 2 0, as. Using the Cramér-Slutzky s theorem, then, when, We have P 1 if and only if ( t ϕ (t = ϕ d 1 if and only if ϕ = exp ((e i t 1. (t e it. But, by Lemma (in the course lecture notes we have, for every real x, where In particular, when x 0, we write e ix = n (ix k + R n (x, (1 k! k=0 ( x n+1 R n (x min (n + 1!, 2 x n. (2 n! e ix = n (ix k + o(x n, (3 k! k=0 where o(x n denotes the rest term R n (x. Hence, when, we obtain (taking n=2 e i t it = 1 + t2 t2 + o(. ( lim ϕ (t = lim exp (it t2 2 + o(t2 = e it. (b We have to show that lim ϕ (t = e t 2 2. Indeed, ( t ϕ (t = e it ϕ = exp ((e i t 1 it. We may use (3 to obtain (e i t t 2 1 = it 2 + o(t2,. oting that using (2, o( t2 0 as, we finally obtain lim ϕ (t = e t 2 2.
6 cont. exam sf2940 Fall (c Set S = X 1 + X X and let ϕ X (t denote the characteristic function of the i.i.d. variables X 1, X 2,.... We have Since S S = S /. P 1 when, by the Cramér-Slutzky s theorem it suffices to show that d (0, σ 2 as i.e. we have to show that lim ϕ S (t = e t 2 σ 2 2. Since Po(, we have ϕ S (t = ϕ S ( t ( = g ϕ X ( t ( ( = exp ϕ X ( t 1. ow, since X has finite variance σ 2, we use the fact that, when, ϕ X ( t = 1 + it E[X] t2 E[X2 ] + o( t2 and noting that E[X] = 0 and E[X 2 ] = Var(X + (E[X] 2 = σ 2, we obtain ( lim ϕ X ( t 1 = t2 2 σ2. or lim ϕ S (t = e t 2 σ 2 2. Problem 3 ( X (a We compute the characteristic function of Y. We have ϕ (X,Y (s, t = E [ e isx+ity ] = E [ E [ e isx+ity X ]] = E [ e isx E [ e ity X ]]. Since Y X (X, a 2 we have E [ e ity X ] = e itx t2 2 a2. [ ϕ (X,Y (s, t = E e isx e itx t2 a2] 2 = e t2 2 a2 E [ e i(s+tx]. Using the assumption that X (µ, b 2 we further obtain ( ϕ (X,Y (s, t = exp isµ + itµ 1 2 (s2 b 2 + 2stb 2 + (a 2 + b 2 t 2. ( X Y (( µ µ ( b 2 b, 2 b 2 a 2 + b 2.
7 cont. exam sf2940 Fall (b We have X Y = y (µ 1 2, σ1 2 2, where µ 1 2 = µ + b2 a 2 + b (y µ, 2 σ2 1 2 = b 2 (1 b4 a 2 + b = 2 b2 b2. a 2 + b 2 ote that σ > 0. Problem 4 (a Recall the definition of the conditional expectation of an integrable random variable X w.r.t. a sub σ-algebra G. Z := E[X G] is the unique G-measurable random variable for which E[ZI A ] = E[XI A ], A G. ote that if X and Y have the same distribution then E[XI C ] = E[Y I C ], C F and in particular in C G. E[E[X G]I A ] = E[XI A ] = E[Y I A ] = E[E[Y G]I A ], A G. Hence, E[X G] = E[Y G] almost surely, since the conditional expectation is unique. ote that it is implicitly assumed that X and Y are not G-measurable, simply because without this assumption, the statement is wrong. Indeed, if X and Y were G-measurable, then the statement would yield that if X = Y in distribution then X = Y almost surely, which is of course not true in general. if X and Y were G-measurable (such as taking G = F, the equality E[XI C ] = E[Y I C ], C G does not imply that X = Y almost surely. Take X (0, 1. Then we know that Y = X (0, 1. X and Y have the same distribution, but are not (almost surely equal. (b To show that X = Y almost surely it suffices to show that E[(X Y 2 ] = 0 because both are square-integrable. We have E[(X Y 2 ] = E[X 2 2XY + Y 2 ] = E[X 2 ] + E[Y 2 ] E[XY ] E[XY ]. But, using the assumption that X = E[Y X] we obtain E[XY ] = E[E[XY X]] = E[XE[Y X]] = E[X 2 ], and using that Y = E[X Y ] we also obtain E[XY ] = E[E[XY Y ]] = E[Y E[X Y ]] = E[Y 2 ]. E[(X Y 2 ] = E[X 2 ] + E[Y 2 ] E[XY ] E[XY ] = E[X 2 ] + E[Y 2 ] E[X 2 ] E[Y 2 ] = 0. (c Set, for k n, S k = X 1 + X X k. Since X 1, X 2,..., X n are identically distributed we may use (a to obtain that E[X 1 S n ] = E[X 2 S n ] =... = E[X n S n ] almost surely.
8 cont. exam sf2940 Fall But, since S n = E[S n S n ] = n j=1 E[X j S n ] = ne[x 1 S n ], it follows that This in turns yields that E[X j S n ] = S n n almost surely, j = 1,..., n. E[S k S n ] = k E[X j S n ] = k n S n j=1 almost surely. E [ Sk S n ] = E [ [ ]] Sk E S n = E S n [ ] E [Sk S n ] S n = k [ ] n E Sn = k S n n. Problem 5 The following properties of the function t f(t = the problem. (i 0 f(t < 1 and is strictly increasing since f (t = 1 (1+t 2 > 0. t, t 0 turn out useful for solving 1+t (ii f is invertible because it is continuous (in fact differentiable and strictly increasing. (iii f(t + s f(t + f(s. indeed, noting that 1 + t + s 1 + t, 1 + s, we have f(t + s = t + s 1 + t + s = t 1 + t + s + s 1 + t + s t 1 + t + s 1 + s = f(t + f(s. (iii From (i and (ii if follows that if a, b and c are non-negative and satisfy a b + c then f(a f(b + f(c. [ ] (a We have d(x, X = E X X = 0. Since X Y = Y X we get d(x, Y = d(y, X. 1+ X X Lastly, by the triangle inequality, it holds that X Z X Y + Y Z. We may apply (iii to obtain that Take expectation to get X Z 1 + X Z X Y Y Z X Y 1 + Y Z. d(x, Y d(x, Z + d(z, Y. (b If d(x n, X 0 as n we want to show that for every fixed ɛ > 0, P ( X n X > ɛ 0 as n. Indeed, using the fact that f is a strictly increasing function and invertible, we have P ( X n X > ɛ = P (f( X n X > f(ɛ 1 f(ɛ E[f( X n X ] = 1 f(ɛ d(x n, X 0, as n, noting that since ɛ > 0, f(ɛ > 0. (c We first show that d(x n, 1 0 as n. Indeed, we have [ ] Xn 1 d(x n, 1 = E = n X n n 1 n = n 1 1 0, 1/5 n n1/5
9 cont. exam sf2940 Fall as n. Hence, X = 1. On the other hand Thus, X n 1 in L 1. E [ X n 1 ] = (n 1 1 +, n. n1/5
Lecture 13: Martingales
Lecture 13: Martingales 1. Definition of a Martingale 1.1 Filtrations 1.2 Definition of a martingale and its basic properties 1.3 Sums of independent random variables and related models 1.4 Products of
More informationSF2940: Probability theory Lecture 8: Multivariate Normal Distribution
SF2940: Probability theory Lecture 8: Multivariate Normal Distribution Timo Koski 24.09.2015 Timo Koski Matematisk statistik 24.09.2015 1 / 1 Learning outcomes Random vectors, mean vector, covariance matrix,
More informationTHE CENTRAL LIMIT THEOREM TORONTO
THE CENTRAL LIMIT THEOREM DANIEL RÜDT UNIVERSITY OF TORONTO MARCH, 2010 Contents 1 Introduction 1 2 Mathematical Background 3 3 The Central Limit Theorem 4 4 Examples 4 4.1 Roulette......................................
More information6.041/6.431 Spring 2008 Quiz 2 Wednesday, April 16, 7:30-9:30 PM. SOLUTIONS
6.4/6.43 Spring 28 Quiz 2 Wednesday, April 6, 7:3-9:3 PM. SOLUTIONS Name: Recitation Instructor: TA: 6.4/6.43: Question Part Score Out of 3 all 36 2 a 4 b 5 c 5 d 8 e 5 f 6 3 a 4 b 6 c 6 d 6 e 6 Total
More informationMath 431 An Introduction to Probability. Final Exam Solutions
Math 43 An Introduction to Probability Final Eam Solutions. A continuous random variable X has cdf a for 0, F () = for 0 <
More informationSF2940: Probability theory Lecture 8: Multivariate Normal Distribution
SF2940: Probability theory Lecture 8: Multivariate Normal Distribution Timo Koski 24.09.2014 Timo Koski () Mathematisk statistik 24.09.2014 1 / 75 Learning outcomes Random vectors, mean vector, covariance
More informationMetric Spaces. Chapter 1
Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence
More informationDefinition: Suppose that two random variables, either continuous or discrete, X and Y have joint density
HW MATH 461/561 Lecture Notes 15 1 Definition: Suppose that two random variables, either continuous or discrete, X and Y have joint density and marginal densities f(x, y), (x, y) Λ X,Y f X (x), x Λ X,
More informationx a x 2 (1 + x 2 ) n.
Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number
More informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More informationWhat is Statistics? Lecture 1. Introduction and probability review. Idea of parametric inference
0. 1. Introduction and probability review 1.1. What is Statistics? What is Statistics? Lecture 1. Introduction and probability review There are many definitions: I will use A set of principle and procedures
More informationLecture Notes 1. Brief Review of Basic Probability
Probability Review Lecture Notes Brief Review of Basic Probability I assume you know basic probability. Chapters -3 are a review. I will assume you have read and understood Chapters -3. Here is a very
More informationMath 370, Spring 2008 Prof. A.J. Hildebrand. Practice Test 2 Solutions
Math 370, Spring 008 Prof. A.J. Hildebrand Practice Test Solutions About this test. This is a practice test made up of a random collection of 5 problems from past Course /P actuarial exams. Most of the
More informationAggregate Loss Models
Aggregate Loss Models Chapter 9 Stat 477 - Loss Models Chapter 9 (Stat 477) Aggregate Loss Models Brian Hartman - BYU 1 / 22 Objectives Objectives Individual risk model Collective risk model Computing
More informationCourse Notes for Math 162: Mathematical Statistics Approximation Methods in Statistics
Course Notes for Math 16: Mathematical Statistics Approximation Methods in Statistics Adam Merberg and Steven J. Miller August 18, 6 Abstract We introduce some of the approximation methods commonly used
More informationLecture 6: Discrete & Continuous Probability and Random Variables
Lecture 6: Discrete & Continuous Probability and Random Variables D. Alex Hughes Math Camp September 17, 2015 D. Alex Hughes (Math Camp) Lecture 6: Discrete & Continuous Probability and Random September
More informatione.g. arrival of a customer to a service station or breakdown of a component in some system.
Poisson process Events occur at random instants of time at an average rate of λ events per second. e.g. arrival of a customer to a service station or breakdown of a component in some system. Let N(t) be
More informationMaster s Theory Exam Spring 2006
Spring 2006 This exam contains 7 questions. You should attempt them all. Each question is divided into parts to help lead you through the material. You should attempt to complete as much of each problem
More informationThe sample space for a pair of die rolls is the set. The sample space for a random number between 0 and 1 is the interval [0, 1].
Probability Theory Probability Spaces and Events Consider a random experiment with several possible outcomes. For example, we might roll a pair of dice, flip a coin three times, or choose a random real
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
More informationIntroduction to Probability
Introduction to Probability EE 179, Lecture 15, Handout #24 Probability theory gives a mathematical characterization for experiments with random outcomes. coin toss life of lightbulb binary data sequence
More informationECE302 Spring 2006 HW5 Solutions February 21, 2006 1
ECE3 Spring 6 HW5 Solutions February 1, 6 1 Solutions to HW5 Note: Most of these solutions were generated by R. D. Yates and D. J. Goodman, the authors of our textbook. I have added comments in italics
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationSection 5.1 Continuous Random Variables: Introduction
Section 5. Continuous Random Variables: Introduction Not all random variables are discrete. For example:. Waiting times for anything (train, arrival of customer, production of mrna molecule from gene,
More informationTHE BANACH CONTRACTION PRINCIPLE. Contents
THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,
More informationMath 461 Fall 2006 Test 2 Solutions
Math 461 Fall 2006 Test 2 Solutions Total points: 100. Do all questions. Explain all answers. No notes, books, or electronic devices. 1. [105+5 points] Assume X Exponential(λ). Justify the following two
More informationFEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL
FEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL STATIsTICs 4 IV. RANDOm VECTORs 1. JOINTLY DIsTRIBUTED RANDOm VARIABLEs If are two rom variables defined on the same sample space we define the joint
More informationModern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem
More informationLarge induced subgraphs with all degrees odd
Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order
More informationCONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12
CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.
More informationMULTIVARIATE PROBABILITY DISTRIBUTIONS
MULTIVARIATE PROBABILITY DISTRIBUTIONS. PRELIMINARIES.. Example. Consider an experiment that consists of tossing a die and a coin at the same time. We can consider a number of random variables defined
More informationMATH 425, PRACTICE FINAL EXAM SOLUTIONS.
MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator
More informationOverview of Monte Carlo Simulation, Probability Review and Introduction to Matlab
Monte Carlo Simulation: IEOR E4703 Fall 2004 c 2004 by Martin Haugh Overview of Monte Carlo Simulation, Probability Review and Introduction to Matlab 1 Overview of Monte Carlo Simulation 1.1 Why use simulation?
More informationCHAPTER IV - BROWNIAN MOTION
CHAPTER IV - BROWNIAN MOTION JOSEPH G. CONLON 1. Construction of Brownian Motion There are two ways in which the idea of a Markov chain on a discrete state space can be generalized: (1) The discrete time
More informationMATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.
MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α
More informationReal Roots of Univariate Polynomials with Real Coefficients
Real Roots of Univariate Polynomials with Real Coefficients mostly written by Christina Hewitt March 22, 2012 1 Introduction Polynomial equations are used throughout mathematics. When solving polynomials
More informationn k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...
6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence
More informationProbability Generating Functions
page 39 Chapter 3 Probability Generating Functions 3 Preamble: Generating Functions Generating functions are widely used in mathematics, and play an important role in probability theory Consider a sequence
More informationInverse Functions and Logarithms
Section 3. Inverse Functions and Logarithms 1 Kiryl Tsishchanka Inverse Functions and Logarithms DEFINITION: A function f is called a one-to-one function if it never takes on the same value twice; that
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationTHE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE. Alexander Barvinok
THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexer Barvinok Papers are available at http://www.math.lsa.umich.edu/ barvinok/papers.html This is a joint work with J.A. Hartigan
More informationMATH PROBLEMS, WITH SOLUTIONS
MATH PROBLEMS, WITH SOLUTIONS OVIDIU MUNTEANU These are free online notes that I wrote to assist students that wish to test their math skills with some problems that go beyond the usual curriculum. These
More informationRolle s Theorem. q( x) = 1
Lecture 1 :The Mean Value Theorem We know that constant functions have derivative zero. Is it possible for a more complicated function to have derivative zero? In this section we will answer this question
More informationNote on some explicit formulae for twin prime counting function
Notes on Number Theory and Discrete Mathematics Vol. 9, 03, No., 43 48 Note on some explicit formulae for twin prime counting function Mladen Vassilev-Missana 5 V. Hugo Str., 4 Sofia, Bulgaria e-mail:
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationProbability Theory. Florian Herzog. A random variable is neither random nor variable. Gian-Carlo Rota, M.I.T..
Probability Theory A random variable is neither random nor variable. Gian-Carlo Rota, M.I.T.. Florian Herzog 2013 Probability space Probability space A probability space W is a unique triple W = {Ω, F,
More information14.451 Lecture Notes 10
14.451 Lecture Notes 1 Guido Lorenzoni Fall 29 1 Continuous time: nite horizon Time goes from to T. Instantaneous payo : f (t; x (t) ; y (t)) ; (the time dependence includes discounting), where x (t) 2
More informationGeneral Theory of Differential Equations Sections 2.8, 3.1-3.2, 4.1
A B I L E N E C H R I S T I A N U N I V E R S I T Y Department of Mathematics General Theory of Differential Equations Sections 2.8, 3.1-3.2, 4.1 Dr. John Ehrke Department of Mathematics Fall 2012 Questions
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 18. A Brief Introduction to Continuous Probability
CS 7 Discrete Mathematics and Probability Theory Fall 29 Satish Rao, David Tse Note 8 A Brief Introduction to Continuous Probability Up to now we have focused exclusively on discrete probability spaces
More informationPractice with Proofs
Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using
More informationI. Pointwise convergence
MATH 40 - NOTES Sequences of functions Pointwise and Uniform Convergence Fall 2005 Previously, we have studied sequences of real numbers. Now we discuss the topic of sequences of real valued functions.
More informationPrinciple of Data Reduction
Chapter 6 Principle of Data Reduction 6.1 Introduction An experimenter uses the information in a sample X 1,..., X n to make inferences about an unknown parameter θ. If the sample size n is large, then
More informationIntroduction to General and Generalized Linear Models
Introduction to General and Generalized Linear Models General Linear Models - part I Henrik Madsen Poul Thyregod Informatics and Mathematical Modelling Technical University of Denmark DK-2800 Kgs. Lyngby
More information( ) is proportional to ( 10 + x)!2. Calculate the
PRACTICE EXAMINATION NUMBER 6. An insurance company eamines its pool of auto insurance customers and gathers the following information: i) All customers insure at least one car. ii) 64 of the customers
More information10.2 Series and Convergence
10.2 Series and Convergence Write sums using sigma notation Find the partial sums of series and determine convergence or divergence of infinite series Find the N th partial sums of geometric series and
More informationFeb 28 Homework Solutions Math 151, Winter 2012. Chapter 6 Problems (pages 287-291)
Feb 8 Homework Solutions Math 5, Winter Chapter 6 Problems (pages 87-9) Problem 6 bin of 5 transistors is known to contain that are defective. The transistors are to be tested, one at a time, until the
More informationFIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.
FIRST YEAR CALCULUS WWLCHENW L c WWWL W L Chen, 1982, 2008. 2006. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It It is is
More informationCITY UNIVERSITY LONDON. BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION
No: CITY UNIVERSITY LONDON BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION ENGINEERING MATHEMATICS 2 (resit) EX2005 Date: August
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series In the preceding section we were able to find power series representations for a certain restricted class of functions. Here we investigate more general problems: Which functions
More informationCritical points of once continuously differentiable functions are important because they are the only points that can be local maxima or minima.
Lecture 0: Convexity and Optimization We say that if f is a once continuously differentiable function on an interval I, and x is a point in the interior of I that x is a critical point of f if f (x) =
More informationCovariance and Correlation
Covariance and Correlation ( c Robert J. Serfling Not for reproduction or distribution) We have seen how to summarize a data-based relative frequency distribution by measures of location and spread, such
More informationON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction
ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING Abstract. In [1] there was proved a theorem concerning the continuity of the composition mapping, and there was announced a theorem on sequential continuity
More informationA Model of Optimum Tariff in Vehicle Fleet Insurance
A Model of Optimum Tariff in Vehicle Fleet Insurance. Bouhetala and F.Belhia and R.Salmi Statistics and Probability Department Bp, 3, El-Alia, USTHB, Bab-Ezzouar, Alger Algeria. Summary: An approach about
More informationGenerating Random Numbers Variance Reduction Quasi-Monte Carlo. Simulation Methods. Leonid Kogan. MIT, Sloan. 15.450, Fall 2010
Simulation Methods Leonid Kogan MIT, Sloan 15.450, Fall 2010 c Leonid Kogan ( MIT, Sloan ) Simulation Methods 15.450, Fall 2010 1 / 35 Outline 1 Generating Random Numbers 2 Variance Reduction 3 Quasi-Monte
More information1. Let P be the space of all polynomials (of one real variable and with real coefficients) with the norm
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 005-06-15 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
More informationHES-SO Master of Science in Engineering. Clustering. Prof. Laura Elena Raileanu HES-SO Yverdon-les-Bains (HEIG-VD)
HES-SO Master of Science in Engineering Clustering Prof. Laura Elena Raileanu HES-SO Yverdon-les-Bains (HEIG-VD) Plan Motivation Hierarchical Clustering K-Means Clustering 2 Problem Setup Arrange items
More informationThe Heat Equation. Lectures INF2320 p. 1/88
The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)
More informationExam Introduction Mathematical Finance and Insurance
Exam Introduction Mathematical Finance and Insurance Date: January 8, 2013. Duration: 3 hours. This is a closed-book exam. The exam does not use scrap cards. Simple calculators are allowed. The questions
More informationPayment streams and variable interest rates
Chapter 4 Payment streams and variable interest rates In this chapter we consider two extensions of the theory Firstly, we look at payment streams A payment stream is a payment that occurs continuously,
More information4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
More informationThe Exponential Distribution
21 The Exponential Distribution From Discrete-Time to Continuous-Time: In Chapter 6 of the text we will be considering Markov processes in continuous time. In a sense, we already have a very good understanding
More informationProperties of moments of random variables
Properties of moments of rom variables Jean-Marie Dufour Université de Montréal First version: May 1995 Revised: January 23 This version: January 14, 23 Compiled: January 14, 23, 1:5pm This work was supported
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More informationFrom Binomial Trees to the Black-Scholes Option Pricing Formulas
Lecture 4 From Binomial Trees to the Black-Scholes Option Pricing Formulas In this lecture, we will extend the example in Lecture 2 to a general setting of binomial trees, as an important model for a single
More informationAdaptive Online Gradient Descent
Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650
More informationImportant Probability Distributions OPRE 6301
Important Probability Distributions OPRE 6301 Important Distributions... Certain probability distributions occur with such regularity in real-life applications that they have been given their own names.
More informationWHEN DOES A RANDOMLY WEIGHTED SELF NORMALIZED SUM CONVERGE IN DISTRIBUTION?
WHEN DOES A RANDOMLY WEIGHTED SELF NORMALIZED SUM CONVERGE IN DISTRIBUTION? DAVID M MASON 1 Statistics Program, University of Delaware Newark, DE 19717 email: davidm@udeledu JOEL ZINN 2 Department of Mathematics,
More informationHow To Understand The Theory Of Hyperreals
Ultraproducts and Applications I Brent Cody Virginia Commonwealth University September 2, 2013 Outline Background of the Hyperreals Filters and Ultrafilters Construction of the Hyperreals The Transfer
More informationMonte Carlo Methods in Finance
Author: Yiyang Yang Advisor: Pr. Xiaolin Li, Pr. Zari Rachev Department of Applied Mathematics and Statistics State University of New York at Stony Brook October 2, 2012 Outline Introduction 1 Introduction
More informationNotes on Probability Theory
Notes on Probability Theory Christopher King Department of Mathematics Northeastern University July 31, 2009 Abstract These notes are intended to give a solid introduction to Probability Theory with a
More informationA Uniform Asymptotic Estimate for Discounted Aggregate Claims with Subexponential Tails
12th International Congress on Insurance: Mathematics and Economics July 16-18, 2008 A Uniform Asymptotic Estimate for Discounted Aggregate Claims with Subexponential Tails XUEMIAO HAO (Based on a joint
More informationBayesian logistic betting strategy against probability forecasting. Akimichi Takemura, Univ. Tokyo. November 12, 2012
Bayesian logistic betting strategy against probability forecasting Akimichi Takemura, Univ. Tokyo (joint with Masayuki Kumon, Jing Li and Kei Takeuchi) November 12, 2012 arxiv:1204.3496. To appear in Stochastic
More information13.5. Click here for answers. Click here for solutions. CURL AND DIVERGENCE. 17. F x, y, z x i y j x k. 2. F x, y, z x 2z i x y z j x 2y k
SECTION CURL AND DIVERGENCE 1 CURL AND DIVERGENCE A Click here for answers. S Click here for solutions. 1 15 Find (a the curl and (b the divergence of the vector field. 1. F x, y, xy i y j x k. F x, y,
More informationMATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform
MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish
More informationOPTIMAL SELECTION BASED ON RELATIVE RANK* (the "Secretary Problem")
OPTIMAL SELECTION BASED ON RELATIVE RANK* (the "Secretary Problem") BY Y. S. CHOW, S. MORIGUTI, H. ROBBINS AND S. M. SAMUELS ABSTRACT n rankable persons appear sequentially in random order. At the ith
More informationOnline Learning, Stability, and Stochastic Gradient Descent
Online Learning, Stability, and Stochastic Gradient Descent arxiv:1105.4701v3 [cs.lg] 8 Sep 2011 September 9, 2011 Tomaso Poggio, Stephen Voinea, Lorenzo Rosasco CBCL, McGovern Institute, CSAIL, Brain
More informationConductance, the Normalized Laplacian, and Cheeger s Inequality
Spectral Graph Theory Lecture 6 Conductance, the Normalized Laplacian, and Cheeger s Inequality Daniel A. Spielman September 21, 2015 Disclaimer These notes are not necessarily an accurate representation
More information1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
More informationInvariant Option Pricing & Minimax Duality of American and Bermudan Options
Invariant Option Pricing & Minimax Duality of American and Bermudan Options Farshid Jamshidian NIB Capital Bank N.V. FELAB, Applied Math Dept., Univ. of Twente April 2005, version 1.0 Invariant Option
More informationPractice problems for Homework 11 - Point Estimation
Practice problems for Homework 11 - Point Estimation 1. (10 marks) Suppose we want to select a random sample of size 5 from the current CS 3341 students. Which of the following strategies is the best:
More informationWald s Identity. by Jeffery Hein. Dartmouth College, Math 100
Wald s Identity by Jeffery Hein Dartmouth College, Math 100 1. Introduction Given random variables X 1, X 2, X 3,... with common finite mean and a stopping rule τ which may depend upon the given sequence,
More information1. Let X and Y be normed spaces and let T B(X, Y ).
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: NVP, Frist. 2005-03-14 Skrivtid: 9 11.30 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
More informationIntroduction to Topology
Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................
More informationUNIVERSITETET I OSLO
NIVERSITETET I OSLO Det matematisk-naturvitenskapelige fakultet Examination in: Trial exam Partial differential equations and Sobolev spaces I. Day of examination: November 18. 2009. Examination hours:
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationProbability density function : An arbitrary continuous random variable X is similarly described by its probability density function f x = f X
Week 6 notes : Continuous random variables and their probability densities WEEK 6 page 1 uniform, normal, gamma, exponential,chi-squared distributions, normal approx'n to the binomial Uniform [,1] random
More informationMicroeconomic Theory: Basic Math Concepts
Microeconomic Theory: Basic Math Concepts Matt Van Essen University of Alabama Van Essen (U of A) Basic Math Concepts 1 / 66 Basic Math Concepts In this lecture we will review some basic mathematical concepts
More informationChapter 2: Binomial Methods and the Black-Scholes Formula
Chapter 2: Binomial Methods and the Black-Scholes Formula 2.1 Binomial Trees We consider a financial market consisting of a bond B t = B(t), a stock S t = S(t), and a call-option C t = C(t), where the
More informationThe Bivariate Normal Distribution
The Bivariate Normal Distribution This is Section 4.7 of the st edition (2002) of the book Introduction to Probability, by D. P. Bertsekas and J. N. Tsitsiklis. The material in this section was not included
More informationNotes on Continuous Random Variables
Notes on Continuous Random Variables Continuous random variables are random quantities that are measured on a continuous scale. They can usually take on any value over some interval, which distinguishes
More information