SIMULATION - PROBLEM SET 1
|
|
- Lynette Fleming
- 6 years ago
- Views:
Transcription
1 SIMULATION - PROBLEM SET 1 " if! Ÿ B Ÿ 1. The random variable X has probability density function 0ÐBÑ œ " $ if Ÿ B Ÿ.! otherwise Using the inverse transform method of simulation, find the random observation generated by the (uniform decimal) random number r œ.716. A).358 B).608 C).716 D).858 E) 1.16 ". A binomial distribution with n œ 3 and p œ.4 is simulated by the inverse transform method with the uniform random numbers.31,.71,.66,.48,.19. How many of the generated random variables are equal to? A) 1 B) C) 3 D) 4 E) 5 3. A mixed exponential" distribution has P[ X œ 0 ] œ p (0 p 1) and density function -x f(x) œ (1 p) - e for x 0. The distribution can be simulated by the inverse transform method as follows: if U is a random uniform (0,1) value and U p, then X œ 0 ; if p Ÿ U 1 then X œ 1 1 p 1 1 p 1 U A) - ln(1 U) B) - ln(1 U) C) - ln Š 1 U D) - ln Š 1 U E) - ln Š 1p sin x 4. X has density function f(x) =, 0 Ÿ x Ÿ 1, and f(x) = 0 elsewhere. Use the inverse transform method to simulate three values of X based on uniform [0, 1] values È 1 + È3 u 1 = È, u =.5, u 3 =. Find the mean of the simulated values x 1, x, x A) 36 B) 4 C) 36 D) 4 E) 1 5. You are given a probability distribution with the following probability density function: The inverse transformation method was used to generate a random observation this distribution by using <, a uniform random number between 0 and 1. Determine the value of <. " " $ & & A) ' B) $ C) ) D) " E) ' B œ $Þ& " from
2 6. You are to use the inverse transform method to generate two random observations from the $ B " Ÿ B Ÿ " distribution with probability density function 0ÐBÑ œ œ.! elsewhere You are to use the following random numbers from the uniform distribution on Ò!ß "Ó:!Þ&!!& ß!Þ! Calculate the sum of the resulting random observations. A)!Þ( B)!Þ' C)!Þ& D)!Þ E)!Þ$ 7. The random variable \ has distribution function JÐBÑ. You are given: w " " w " JÐ!Ñœ!ßJÐBÑœ ) for!b, TÒ\œÓœ, JÐBÑœ for B$, JÐ$Ñœ" You simulate \ by using a function of Y, the uniform distribution on the interval Ò!ß"Ó, and $ " " ( obtain the following sequence of values from Y: ß ß ß ). Determine \, the sample mean. "* "( A) ' B) 1 C) D) ) E) 3 8. A company is insured against liability suits. The number of suits for a given year is distributed as follows: Number of suits: Probability: For each of three years, you simulate the number of suits per year by generating one uniform random number from the interval Ò!ß "Ó and then applying the inverse transformation method. Your three random numbers are 0.83, 0.59, The liability loss from an individual suit is a random variable with the following cumulative! for B! distribution function JÐBÑ œ " for Bœ!. B "! for!bÿ"! You generate uniform random numbers from the interval Ò!ß "Ó and apply the inverse transformation method to simulate the amounts of the individual losses. The first nine uniform random numbers, in order, are: 0.51, 0.01, 0.78, 0.74, 0.03, 0.69, 0.17, 0.86, 0.8 Use, in order, as many of these random numbers as needed to simulate the company's total loss due to liability suits over the three year period. A) 0.0 B) 0. C) 5.6 D) 5.8 E) 14.4
3 9. Your company insures a risk that is modeled as a surplus process as follows: (i) Interarrival times for claims are independent and exponentially distributed with mean 1/3. (ii) Claim size equals "! >, where t equals the time the claim occurs. (iii) Initial surplus equals 5. (iv) Premium is collected continuously at rate ->. (v) 3œ! You simulate the interarrival times for the first three claims by using 0.5, 0., and 0.1, respectively, from the uniform distribution on Ò!ß "Ó, where small random numbers correspond to long interarrival times. Of the following, which is the smallest - such that your company does not become insolvent from any of these three claims? A) B) 35 C) 49 D) 113 E) When generating random variables, it is important to consider how much time it takes to complete the process. Consider a discrete random variable \ with the following distribution: 5 " $ & T <9,Ð\ œ 5Ñ Þ"& Þ"! Þ& Þ! Þ$! Of the following algorithms, which is the most efficient way to simulate \? A) If YÞ"& set \œ" and stop. If YÞ& set \œ and stop. If YÞ&! set \œ$ and stop. If YÞ(! set \œ and stop. Otherwise set \œ& and stop. B) If YÞ$! set \œ& and stop. If YÞ&! set \œ and stop. If YÞ(& set \œ$ and stop. If YÞ)& set \œ and stop. Otherwise set \œ" and stop. C) If YÞ"! set \œ and stop. If YÞ& set \œ" and stop. If YÞ& set \œ and stop. If YÞ(! set \œ$ and stop. Otherwise set \œ& and stop. D) If YÞ$! set \œ& and stop. If YÞ&& set \œ$ and stop. If YÞ(& set \œ and stop. If YÞ*! set \œ" and stop. Otherwise set \œ and stop. E) If YÞ! set \œ and stop. If YÞ$& set \œ" and stop. If YÞ& set \œ and stop. If YÞ(& set \œ& and stop. Otherwise set \œ$ and stop.
4 Problems 11 and 1 relate to the following situation. A random sample _ of size 30 is taken from the distribution of the random variable \. The sample mean is \ $! œ Þ)!*, and the sample variance is W$! œ "Þ'$ Þ 10 additional random values are drawn in the following order: \ $" œ $Þ) ß \ $ œ Þ ß &Þ& ß &Þ" ß Þ& ß Þ! ß $Þ! ß Þ ß $Þ* ß &Þ* Þ 11. It is decided that sampling will stop when the estimated standard deviation of \ 5 is first less than.. How many samples values after the 30th are needed to satisfy this criterion? A) B) 4 C) 6 D) 8 E) It is decided that sampling will stop when the width of the 95 confidence interval for. is first less than Þ(& (the 97.5 percentile of the standard normal distribution is 1.96). Ho many sample values after the 30th are needed to satisfy this criterion? A) B) 4 C) 6 D) 8 E) An estimate is being made of the probability : of flipping a head with a particular coin. The coin will be flipped until the estimated standard deviation of the estimated value of : is less than.075. In the first 40 coin flips there are 5 heads and 15 tails. The next 10 coin flips are T H H H T H H T H H. With which flip is the stopping criterion reached? A) 41 B) 4 C) 43 D) 44 E) To estimate IÒ\Ó, you have simulated \ß\ß\ß\ " $ and \& with the following results: You want the standard deviation of the estimator of IÒ\Óto be less than Estimate the total number of simulations needed. A) Less than 150 B) At least 150, but less than 400 C) At least 400, but less than 650 D) At least 650, but less than 900 E) At least A random sample of 18 data points has a sample mean of 8 and an unbiased sample variance of 4. \"* œ & and \! œ * are added to the sample. Find the updated unbiased sample variance based on all 0 data points. A) 4.0 B) 4.1 C) 4. D) 4.3 E) (CAS) A scientist perform experiments, each with a 60 success rate. Let \ represent the number of trials until the first success. Use the inverse transform method to simulate the random variable, \, and the following random numbers (where low numbers correspond to a high number of trials): 0.15, 0.6, 0.37, Generate the total number of trials until three successes result. A) 3 B) 4 C) 5 D) 6 E) 7
5 17. (CAS) Two actuaries are simulating the number of automobile claims for a book of business. For the population that are studying: i) The claim frequency for each individual driver has a Poisson distribution. ii) The means of the Poisson distributions are distributed as a random variable, A. iii) A has a gamma distribution. In the first actuary's simulation, a driver is selected and one year's experience is generated. This process of selecting a driver and simulating one year is repeated R times. In the second actuary's simulation, a driver is selected an R years of experience are generated for that driver. Which of the following is/are true? I. The ratio of the number of claims the first actuary simulates to the number of claims the second actuary simulates should tend towards 1 as R tends to infinity. II. The ratio of the number of claims the first actuary simulates to the number of claims the second actuary simulates will equal 1, provided that the same uniform random numbers are used. III. When the variances of the two sequences of claim counts are compared the first actuary's sequence will have a smaller variance because more random numbers are used in computing it. A) I only B) I and II only C) I and III only D) II and II only E) None of I, II, or III is true 18. (SOA) Insurance for a city s snow removal costs covers four winter months. (i) There is a deductible of 10,000 per month. (ii) The insurer assumes that the city s monthly costs are independent and normally distributed with mean 15,000 and standard deviation,000. (iii) To simulate four months of claim costs, the insurer uses the Inverse Transform Method (where small random numbers correspond to low costs). (iv) The four numbers drawn from the uniform distribution on [0,1] are: Calculate the insurer s simulated claim cost. (A) 13,400 (B) 14,400 (C) 17,800 (D) 0,000 (E) 6, (SOA) You are simulating a continuous surplus process, where claims occur according to a Poisson process with frequency, and severity is given by a Pareto distribution with parameters α œ and ) œ "!!!. The initial surplus is 000, and the relative security loading is 0.1. Premium is collected continuously, and the process terminates if surplus is ever negative. You simulate the time between claims using the inverse transform method (where small numbers correspond to small times between claims) using the following values from the uniform distribution on [0,1]: 0.83, 0.54, 0.48, You simulate the severities of the claims using the inverse transform method (where small numbers correspond to small claim sizes) using the following values from the uniform distribution on [0,1]: 0.89, 0.36, 0.70, Calculate the simulated surplus at time 1. (A) 1109 (B) 1935 (C) 185 (D) 400 (E) Surplus becomes negative at some time in [0,1].
6 (SOA) Use the following information for Questions 0 and 1. Lucky Tom finds coins on his 60 minute walk to work at a Poisson rate of per minute. 60 of the coins are worth 1 each; 0 are worth 5 each; 0 are worth 10 each. The denominations of the coins found are independent. Two actuaries are simulating Tom s 60 minute walk to work. (i) The first actuary begins by simulating the number of coins found, using the procedure of repeatedly simulating the time until the next coin is found, until the length of the walk has been exceeded. For each coin found, he simulates its denomination, using the inverse transform algorithm. The expected number of random numbers he needs for one simulation of the walk is J. (ii) The second actuary uses the same algorithm for simulating the times between events. However, she first simulates finding coins worth 1, then simulates finding coins worth 5, then simulates finding coins worth 10, in each case simulating until the 60 minutes are exceeded. The expected number of random numbers she needs for one complete simulation of Tom s walk is KÞ 0. Which of the following statements is true? (A) Neither is a valid method for simulating the process. (B) The first actuary s method is valid; the second actuary s is not. (C) The second actuary s method is valid; the first actuary s is not. (D) Both methods are valid, but they may produce different results from the same sequence of random numbers. (E) Both methods are valid, and will produce identical results from the same sequence of random numbers. 1. Determine which of the following ranges contains the ratio JK /. (A) 0.0 J/ KŸ0.4 (B) 0.4 J/ KŸ0.8 (C) 0.8 J/ KŸ1. (D) 1. J/ KŸ1.6 (E) 1.6 J/ K. (SOA) You wish to simulate a value, ], from a two point mixture. With probability 0.3, ] is exponentially distributed with mean 0.5. With probability 0.7, ] is uniformly distributed on Ò$ß $Ó. You simulate the mixing variable where low values correspond to the exponential distribution. Then you simulate the value of ], where low random numbers correspond to low values of ]. Your uniform random numbers from Ò! ß "Ó are 0.5 and 0.69 in that order. Calculate the simulated value of Y. (A) 0.19 (B) 0.38 (C) 0.59 (D) 0.77 (E) 0.95
7 3. (SOA) An actuary is evaluating two methods for simulating XÐBCÑ, the future lifetime of the joint-life status of independent lives ÐBÑ and ÐCÑ: (i) Mortality for ÐBÑ and ÐCÑ follows De Moivre s law with = œ "!!., which states that > JXÐDÑÐ>Ñ œ " "!!D for! D "!! and! > "!! D. (ii)! B Ÿ C "!! (iii) Both methods select random numbers V", and V independently from the uniform distribution on Ò!ß "Ó. (iv) Method 1 sets: (a) X ÐBÑ œ Ð"!!BÑV" ß (b) X ÐCÑ œ Ð"!!CÑV ß (c) XÐBCÑ œ smaller of XÐBÑand XÐCÑ (v) Method first determines which lifetime is shorter: (a) If V" Ÿ!Þ&!, it chooses that ÐBÑ is the first to die, and sets XÐBCÑ œ XÐBÑ œ Ð"!!BÑV. (b) If R "!Þ&!, it chooses that ÐCÑis the first to die, and sets XÐBCÑ œ XÐCÑ œ Ð"!!CÑV. Which of the following is correct? (A) Method 1 is valid for BœCbut not for BC; Method is never valid. (B) Method 1 is valid for BœCbut not for BC; Method is valid for BœCbut not for BC. (C) Method 1 is valid for BœCbut not for BC; Method is valid for all Band C. (D) Method 1 is valid for all B and C; Method is never valid. (E) Method 1 is valid for all B and C; Method is valid for B œ C but not for B C. 4. (SOA) You are simulating a compound claims distribution. (i) The number of claims, R, is binomial with 7 œ $ and mean 1.8. (ii) Claim amounts are uniformly distributed on Ö"ß ß $ß ß &. (iii) Claim amounts are independent and are independent of the number of claims. (iv) You simulate the number of claims, R, and the amounts of each of those claims, \" ß \ ß ÞÞÞß \ R. Then you repeat another R, its claim amounts, and so on until you have performed the desired number of simulations. (v) When the simulated number of claims is!, you do not simulate any claims amounts. (vi) All simulations use the inverse transform method, with low random numbers corresponding to few claims or small claim amounts. (vii) Your random numbers from Ð!ß "Ñ are 0.7, 0.1, 0.3, 0.1, 0.9, 0.5, 0.5, 0.7, 0.3, and 0.1. Calculate the aggregate claim amount associated with your third simulated value of R. (A) 3 (B) 5 (C) 7 (D) 9 (E) \ is a mixture of two exponential distributions. Distribution 1 has a mean of 1 and a mixing weight of.5 and distribution has a mean of and a mixing weight of.75. \ is simulated using the inverse transformation method with a uniform Ð!ß "Ñ value of.7. Find the simulated value of \.
8 SIMULATION - PROBLEM SET 1 SOLUTIONS 3 x if 0 Ÿ x Ÿ 1. F(x) = 0 if x Ÿ 0, F(x) = 1 if x 4, and F(x) = š x if Ÿ x Ÿ 4 1 r =.716 œjðbñ= x p x =.608. Answer: B. 1. s : (s) J (s) A binomial value of will be simulated by a uniform (0,1) value that is both greater than or equal to.648 and less than.936. Thus, the uniform numbers.71 and.66 result in simulated binomial values of. Answer: B. 3. For x 0, F(x) = P[ X Ÿ x ] = P[ X = 0 ] + P[ 0 X Ÿ x] = p + ' -t (1 p) - e dt! if B! -x = p + (1 p)(1 e ). Thus, F(x) = : if B œ! -B : Ð" :ÑÐ" / Ñ if B! Thus, for U p, the inversion method implies that -x 1 1p U = F(x) = p + (1 p)(1 e ) p x = - ln Š 1U. Answer: D.! x B 4. The c.d.f. is F(x) = ' sin t 1 cos x! dt = for 0 Ÿ x Ÿ cos x By the inversion method, for uniform u we have x = F (u), or equivalently, u =. È 1 1 cos x1 1 1 u 1= = cos x 1 = x 1 =, È Ä È Ä 4 1 u =.5 Ä cos x = 0 Ä x =, + È3 È3 51 x 1 + x + x3 191 u 3 = 4 Ä cos x 3 = Ä x 3 = 6. 3 = 36. Answer: A. 5. From the diagram of the density function we must have " " " ÐÑ ÐÑ œ " p œ ', since the total probability Ÿ\Ÿ) is 1. From the inverse transformation method, " " " & < œ J\ ÐBÑ œ J\ Ð$Þ&Ñ œ ÐÑÐ ' Ñ Ð"Þ&ÑÐ ' Ñ œ " (this is the integral of 0ÐBÑ from to 3.5). Answer: D $ B 6. J\ ÐBÑœ' B" " 0Ð>Ñ.>œ "ŸBŸ". We solve?œj\ ÐBÑ for B. $ $ B" " B" Þ&!!& œ p B" œ Þ", Þ! œ p B œ Þ). B" B œ Þ(. Answer: A
9 ! B Ÿ!!B B 7. \ has a mixed distribution with cdf ) $ JÐBÑ œ Bœ. B" B$ " B $ According to the inversion method of simulation, given a uniform random number? from Ò!ß "Ó, the simulated value of \ is " " $ $ Bœ)? if!ÿ?, Bœ if Ÿ?Ÿ, Bœ?" if?ÿ". $ " " ( & Then,?" œ p B" œ ß? œ p B œ ß? $ œ p B$ œ ß? œ ) p B œ. The sample mean is Þ& "( œ ). Answer: D 8. The cdf of R (number of suits per year) is 8 À! " $ JÐ8Ñ À Þ& Þ( Þ* " The simulated numbers of suits in the three years are?" œ Þ)$ p 8" œ ß? œ Þ&* p 8 œ " ß? $ œ Þ"* p 8$ œ!. The liability loss \ from a suit has a mixed distribution. If?Þ& then Bœ!, and if B " Þ&Ÿ?Ÿ" then?œjðbñœ! Þ The simulated liability losses from the 3 suits are B" " B$ "?" œþ&"œ! pb" œþ ß? œþ!"pb œ! ß? $ œþ()œ! pb" œ&þ'. Total liability losses in 3 years œþ!&þ)œ&þ). Answer: D 9. The interarrival time for claims is exponential. We must simulate the three claim times. We are told that where small random numbers correspond to long interarrival times. This is the opposite of the usual inverse transform method. Instead of solving for interarrival claim time > from?œjð>ñ(the simulation method that has small random number? corresponding to small interarrival time > ), we solve for > from the equation? œ "JÐ>Ñ. Since interarrival time for " claims is exponential with mean $, "JÐ>Ñœ/$>. $> The simulated interarrival times are > ß> and >, where Þ&œ/ " " $ p > " œþ$", $> $> $ Þœ/ p> œþ&$', and Þ"œ/ p> $ œþ('). These are interarrival times, so the actual successive claim times are at times.31,.767, and Þ$" Þ('( "Þ&$& The claim amounts are "! œ "Þ(!, "! œ &Þ)&, and "! œ $Þ). Þ$" & The total premium received up to time.31 is ' Þ$"! ->.> œ - & œ Þ!!!"$-. Þ('( & The total premium received up to time.767 is ' Þ('(! ->.> œ - & œ Þ!&$-. "Þ&$& & The total premium received up to time is ' "Þ&$&! ->.> œ - & œ "Þ(-. Surplus at time each of the claim times is: - at time.31 surplus is & Þ!!!"$- "Þ(!!, - at time.767 surplus is & Þ!&$- "Þ( &Þ)& œ Þ!&$- Þ&&, and - at time surplus is & "Þ(- "Þ(! &Þ)& $Þ) œ "Þ(- $'Þ)$. In order for the company to be solvent at each claim time it must be true that Þ!&$- Þ&&, and "Þ(- $'Þ)$ p - )Þ" and - "Þ(. Answer: C
10 10. In order to generate \ values as quickly as possible, we want the \-value with the largest probability to be the first possible one generated, and second largest probability to be the second possible one generated, etc. We place the \-values in order of largest to smallest probability: \ œ 5 & $ " : 5 Þ$! Þ& Þ! Þ"& Þ"! Cumulative Þ$! Þ&& Þ(& Þ*! " The simulation procedure with generate \œ& if YÞ$!, it would generate \œ$ if Þ$!ŸY Þ&&, it would generate \œ if Þ&&ŸY Þ(&, it would generate \œ" if Þ(&ŸY Þ*!, and it would generate \œ if Þ*!ŸY. The reason this method results in the least time required for simulation is that the probability that the stopping time occurs on the first step is higher than any of the other simulation methods. For instance, with YœÞ&$ the stopping points for each of the 5 methods given are A. Þ&! Ÿ Þ&$ Þ(! so set \ œ (stop on the 4th step) B. Þ&! Ÿ Þ&$ Þ(& so set \ œ $ (stop on the 3rd step) C. Þ& Ÿ Þ&$ Þ(! so set \ œ $ (stop on the 4th step) D. Þ$! Ÿ Þ&$ Þ&& so set \ œ $ (stop on the nd step) E. Þ& Ÿ Þ&$ Þ(& so set \ œ & (stop on the 4th step) D stops sooner than the other methods. In general, method D stops at the same time or sooner than any of the other four methods, but never later. Note that all five answers result in a valid simulation method since they reproduce the probabilities correctly. Answer: D W5 W$! "Þ'$ 11. The stopping rule is È Þ Þ 5 È œé $! $! œþ!( ÞÞ \ \ Successive sample means can be found from the relationship \ 5" œ \ 5 5" 5 5" : \ \ \ œ \ $" $! $Þ)Þ)!* ÞÞ((' $" $! $" œ Þ)!* $" œ Þ((' ß \ $ œ Þ((' $ œ Þ'*' ß &Þ&Þ'*' \ $$ œ Þ'*' $$ œ Þ(! ß \ $ œ Þ($" ß \ $& œ Þ( ß \ $' œ Þ(! ß \ $( œ Þ'&) ß \ $) œ Þ'&" ß \ $* œ Þ'$ ß \! œ Þ'' Þ Successive sample variances can be found from the relationship 5" W5" œ Ð 5 ÑW5 Ð5 "ÑÐ\ 5" \ 5Ñ : * W$" W$" œ Ð $! ÑW$! $"Ð\ $" \ $! Ñ œ "Þ& p È œ Þ!" Þ Þ $" $! W$ W$ œ Ð $" ÑW$" $Ð\ $ \ $" Ñ œ "Þ"* p È œ Þ"" Þ Þ $ W$$ W$ W$$ œ "Þ$* p È œ Þ!' Þ Þ W$ œ "Þ$&' p œ Þ"**( Þ Þ $$ È$ We see that the stopping rule is reached at the 34-th data point. Answer: B
11 1. The width of the 95 confidence interval is 5 È 5. From the calculations in Problem 9, we see that 5 œ $! p interval width is Ð$Þ*ÑÉ $! œ Þ)! ß 5 œ $" p interval width is Ð$Þ*ÑÉ $" œ Þ()* ß 5 œ $ p interval width is Ð$Þ*ÑÉ $ œ Þ)& ß 5 œ $$ p interval width is Ð$Þ*ÑÉ $$ œ Þ)!' ß 5 œ $ p interval width is Ð$Þ*ÑÉ $ œ Þ()$ Þ Continuing with the calculations in Problem 9, W$& œ "Þ$") p interval width is Ð$Þ*ÑÉ $& œ Þ('", W$' œ "Þ*& p interval width is Ð$Þ*ÑÉ $' œ Þ($ Þ We see that the stopping rule is reached at the 36-th data point. Answer: C 13. \ œ " if head.. if tail \ 3 š 5! œ number of heads in 5 flips 5 The stopping criterion is É \ Ð"\ 5 5 Ñ 5 Þ!(&. & After the first 40 flips, we have \! œ œ Þ'& ß so that É \! Ð"\! Ñ!! œ Þ!('& Þ & 5 œ " p \ " œ œ Þ'"! p É \" Ð"\ " Ñ " " œ Þ!(' ß ' 5 œ p \ œ œ Þ'"* p É \" Ð"\ " Ñ " œ Þ!(* Þ Answer: B 14. The estimator of IÒ\Ó is the sample mean \, which has variance Z+<Ò\Ó Z+<Ò\Óœ 8, if there are 8simulated observations. ÈZ+<Ò\Ó The standard deviation of \ is È. From the data given, the estimated variance of \ is 8 = œ " ÐB BÑ œ " & \ D 3 ÒÐÑ Ð"Ñ! " Óœ. È&Î In order for the standard deviation of \ to be less than.05 we must have È Þ!&, 8 which translates to 8 "!!!. Answer: E ")\") \ "* "* 15. The sample mean based on the first 19 points is \ "* œ "* œ "*, "*\"* \! "&) and the sample mean based on all 0 points is \! œ! œ! Þ We use the relationship 5" " W œ 5" 5" 5 Ð\ 3 \ 5" Ñ œ Ð 5 Ñ W5 Ð5 "ÑÐ\ 5" \ 5Ñ to get 3œ" "( W"* œ Ð") ÑW") Ð"*ÑÐ\ "* \") Ñ, and then ") W! œ Ð"* ÑW"* Ð!ÑÐ\! \"* Ñ "( œ Ð"* ÑW") Ð")ÑÐ\ "* \") Ñ Ð!ÑÐ\! \"* Ñ "( "* "&) "* œ Ð"* ÑÐÑ Ð")ÑÐ "* )Ñ Ð!ÑÐ! "* Ñ œ Þ!*. Answer: B
12 16. To say that low numbers correspond to a low number of trials is the standard form of the inverse transform method: given a uniform random number < we find the integer 8 such that J\ Ð8"ÑŸ<J\ Ð8Ñ, and the simulated value of \ is 8. If we apply the inverse transform method in the form where low numbers correspond to a high number of trials, then given a uniform random number <, we find the integer 7such that J\ Ð7"ÑŸ"<J\ Ð7Ñ. The random variable \ is the number of success until the first trial. This is a geometric distribution with probability function :ÐBÑ and distribution function J ÐBÑ as follows: \ œ 8 " $ ÞÞÞ $ :Ð8Ñ Þ' ÐÞÑÐÞ'Ñ œ Þ ÐÞÑ ÐÞ'Ñ œ Þ!*' ÐÞÑ ÐÞ'Ñ œ Þ!$) ÞÞÞ J Ð8Ñ Þ' Þ) Þ*$' Þ*( Each uniform number < simulates the number of trials until the next success. We must simulate \ three times to get \" (the simulated number of trials until the first success, \ (the additional number of trials until the second success) and \ $ (the additional number of trials until the third success). Then the total number of trials until the third success is \" \ \ $. The first random number is < " œ!þ"&, so that " < " œ!þ)&. We see that J ÐÑ œ Þ) Ÿ Þ)& Þ*$' œ J Ð$Ñ so that the simulated value of \ is 3. This is \", the simulated number of trials until the first success. The second random number is < œ!þ', with " < œ!þ$). We see that!þ$) Þ' œ J Ð"Ñ, so that the simulated value of \ is 1. < $ œ!þ$(, so that " < $ œ!þ'$. We see that J Ð"Ñ œ Þ' Ÿ Þ'$ Þ) œ J ÐÑ, so that the simulated value of \ is. Then \ \ \ œ$"œ'. Answer: D $ " $ 17. I. The combination of a Poisson claim count with mean A and a gamma distribution for A results in a negative binomial distribution being simulated by actuary 1. The average number of claims simulated by actuary 1 in R trials is R IÒAÓ. The second actuary selects a driver with Poisson parameter - and the average number of claims in R years for that driver will be R-. RIÒAÓ The ratio R- tends to 1 only if the second actuary's driver's - is equal to IÒAÓ. False II. This is false for the same reason as I. False III. For actuary 1, the variance of the sequence generated is the variance of a negative binomial distribution. For actuary, the variance of the sequence generated is the variance of the Poisson distribution with parameter - (the -for the driver chosen by actuary ). Either variance could be larger than the other depending on the value of - for actuary 's driver. False Answer: E 18. According to the inverse transform method, given uniform [0,1] number?, the simulated standard normal ^ value is D, where TÒ^ DÓ œ?. From the given uniform values, we get? Þ&$*) Þ""&" Þ!!' Þ())" D!Þ" "Þ Þ&!Þ) The loss random variable \ has a mean of 15,000 and standard deviation of 000. The simulated values of \ are!!!d "&ß!!! À "&ß!! "ß '!! "!ß!!! "'ß '!!. After monthly deductibles, the insurer pays &ß!! ß '!!! 'ß '!! in the four winter months, for total claim cost of 14,400. Answer: B
13 " 19. The time between successive claims has an exponential distribution with mean. > The simulated inter-claim times are > where? œ JÐ> Ñ œ "/ , or equivalently, " > 3 œ 68Ð"? 3Ñ. We use the relationship? œ JÐ>Ñ because we are told that "small numbers correspond to small times between claims"; this is the standard form of the inverse transform method. The simulated inter-claim times are " " > " œ 68Ð" Þ)$Ñ œ Þ)*, > œ 68Ð" Þ&Ñ œ Þ$*. The second simulated claim occurs after time 1, so it is irrelevant. The simulated claim amount of the first claim is B, where ) α? œ J ÐBÑ œ " Ð Ñ œ " Ð "!!! B) B"!!! Ñ, or equivalently, B œ "!!! É " "? "!!!. The simulated claim amount is B œ "!!! É " "Þ)* "!!! œ!"&. ) "!!! The expected claim amount per claim is α" œ " œ "!!!, so that the expected aggregate claim per period is ÐÑÐ"!!!Ñ œ!!!. With relative security loading of.1, the premium rate is Ð"Þ"ÑÐ!!!Ñ œ!!. With initial surplus of 000, the simulated surplus at time 1 is!!!!!!"& œ ")&. Answer: C 0. D. 1. Actuary 1: Average number of times that must be simulated in one hour is Ð'!ÑÐÑ œ "!. For each one of those times, a simulation of coin denomination must be made. Average number of simulations in total is! œ J. Actuary : Denomination 1 coins are found at the rate of ÐÞ'ÑÐÑ œ "Þ per minute, so that in one hour, an average of Ð'!ÑÐ"ÞÑ œ ( times must be simulated. For denomination 5, coins are found at rate ÐÞÑÐÑ œ Þ per minute, and an average of Ð'!ÑÐÞÑ œ must be simulated. Similarly, for denomination 10, an average of 4 simulations are needed per hour. Average total is ( œ "! œ K. J ÎK œ. Answer: E. The mixing probability for the exponential distribution is.3. We are told that low values correspond to the exponential distribution when simulating the mixing variable. Therefore the exponential distribution is used if the uniform random number for simulating the mixing variable is ŸÞ$. Since the first uniform random number is Þ&ŸÞ$, we use the exponential distribution for ]. We are also told that low random numbers correspond to low values of ]. This just means that we are applying the usual inverse transformation method. The cdf of the exponential distribution with mean.5 is JÐCÑ œ "/ C. The second uniform random number is.69, so that the simulated value of ] is the value of C C which satisfies " / œ Þ'* p C œ Þ&)'. Answer: C
14 3. Under DeMovire's Law, the future lifetime of someone at age D is uniformly distributed on the interval = D. Therefore Method 1 is a valid simulation of both times of death. The two individuals are independent, so if BœCthen there is an equal chance that either is first to die. However, given that B is first to die, the conditional distribution of B's time of death is no longer uniform (same for C). Therefore Method is never valid. Answer: D 4. The distribution of R binomial with mean $; œ "Þ), so that ; œ Þ' is the probability of a claim. Then the distribution of number of claims is T ÒR œ 5Ó œ Š 5 $5 5 ÐÞ'Ñ ÐÞÑ R! " $ : Þ!' Þ)) Þ$ Þ"' J Þ!' Þ$& Þ() "Þ! The first uniform number.7 simulates claims, since Þ$& Þ( Ÿ Þ(). We then use.1 and.3 to simulate claim amounts. The next uniform number is.1 and is used to simulated the second R. This will be 1, since Þ!' Þ" Ÿ Þ$&. We use.9 to simulate the one claim amount. The next uniform number is.5, which simulates claims. The uniform numbers.5 and.7 simulate the claim amounts. The claim amount distribution is \ " $ & : Þ Þ Þ Þ Þ J Þ Þ Þ' Þ)Þ "Þ! The uniform number.5 simulates a claim amount of 3, and the uniform number.7 simulates a claim amount of 4. Aggregate claim amount simulated associated with the 3rd simulated value of R is 7. Answer: C B 5. J ÐBÑ œ ÐÞ&ÑÐ" / Ñ ÐÞ(&ÑÐ" / Ñ. B BÎ We must solve for B from the equation ÐÞ&ÑÐ" / Ñ ÐÞ(&ÑÐ" / Ñ œ Þ(. B BÎ The equation can be written as Þ&/ Þ(&/ Þ$ œ!. BÎ Substituting Cœ/ results in the quadratic equation C $C"Þœ!. $ È $ Ð"ÞÑ Solving for C we get C œ œ Þ$&( ß $Þ$&(. BÎ We ignore the negative root, since Cœ/ must be!. Solving for B, we get B œ 68ÐÞ$&(Ñ œ Þ!'. BÎ
MAY 2005 SOA EXAM C/CAS 4 SOLUTIONS
MAY 2005 SOA EXAM C/CAS 4 SOLUTIONS Prepared by Sam Broverman, to appear in ACTEX Exam C/4 Study Guide http://wwwsambrovermancom 2brove@rogerscom sam@utstattorontoedu 1 The distribution function is JÐBÑ
More informationNOVEMBER 2005 EXAM NOVEMBER 2005 CAS COURSE 3 EXAM SOLUTIONS 1. Maximum likelihood estimation: The log of the density is 68 0ÐBÑ œ 68 ) Ð) "Ñ 68 B. The loglikelihood function is & j œ 68 0ÐB Ñ œ & 68 )
More informationPART I. Multiple choice. 1. Find the slope of the line shown here. 2. Find the slope of the line with equation $ÐB CÑœ(B &.
Math 1301 - College Algebra Final Exam Review Sheet Version X This review, while fairly comprehensive, should not be the only material used to study for the final exam. It should not be considered a preview
More informationACT455H1S - TEST 2 - MARCH 25, 2008
ACT455H1S - TEST 2 - MARCH 25, 2008 Write name and student number on each page. Write your solution for each question in the space provided. For the multiple decrement questions, it is always assumed that
More informationRMSC 2001 Introduction to Risk Management
RMSC 2001 Introduction to Risk Management Tutorial 4 (2011/12) 1 February 20, 2012 Outline: 1. Failure Time 2. Loss Frequency 3. Loss Severity 4. Aggregate Claim ====================================================
More informationMath 131 Exam 4 (Final Exam) F04M
Math 3 Exam 4 (Final Exam) F04M3.4. Name ID Number The exam consists of 8 multiple choice questions (5 points each) and 0 true/false questions ( point each), for a total of 00 points. Mark the correct
More information8œ! This theorem is justified by repeating the process developed for a Taylor polynomial an infinite number of times.
Taylor and Maclaurin Series We can use the same process we used to find a Taylor or Maclaurin polynomial to find a power series for a particular function as long as the function has infinitely many derivatives.
More informationRMSC 2001 Introduction to Risk Management
RMSC 2001 Introduction to Risk Management Tutorial 4 (2011/12) 1 February 20, 2012 Outline: 1. Failure Time 2. Loss Frequency 3. Loss Severity 4. Aggregate Claim ====================================================
More informationMATH 1301 (College Algebra) - Final Exam Review
MATH 1301 (College Algebra) - Final Exam Review This review is comprehensive but should not be the only material used to study for the final exam. It should not be considered a preview of the final exam.
More informationEXCERPTS FROM ACTEX CALCULUS REVIEW MANUAL
EXCERPTS FROM ACTEX CALCULUS REVIEW MANUAL Table of Contents Introductory Comments SECTION 6 - Differentiation PROLEM SET 6 TALE OF CONTENTS INTRODUCTORY COMMENTS Section 1 Set Theory 1 Section 2 Intervals,
More informationYou may have a simple scientific calculator to assist with arithmetic, but no graphing calculators are allowed on this exam.
Math 131 Exam 3 Solutions You may have a simple scientific calculator to assist ith arithmetic, but no graphing calculators are alloed on this exam. Part I consists of 14 multiple choice questions (orth
More informationTOTAL DIFFERENTIALS. In Section B-4, we observed that.c is a pretty good approximation for? C, which is the increment of
TOTAL DIFFERENTIALS The differential was introduced in Section -4. Recall that the differential of a function œ0ðñis w. œ 0 ÐÑ.Þ Here. is the differential with respect to the independent variable and is
More informationQUALIFYING EXAMINATION II IN MATHEMATICAL STATISTICS SATURDAY, MAY 9, Examiners: Drs. K. M. Ramachandran and G. S. Ladde
QUALIFYING EXAMINATION II IN MATHEMATICAL STATISTICS SATURDAY, MAY 9, 2015 Examiners: Drs. K. M. Ramachandran and G. S. Ladde INSTRUCTIONS: a. The quality is more important than the quantity. b. Attempt
More informationMath 493 Final Exam December 01
Math 493 Final Exam December 01 NAME: ID NUMBER: Return your blue book to my office or the Math Department office by Noon on Tuesday 11 th. On all parts after the first show enough work in your exam booklet
More informationPart I consists of 14 multiple choice questions (worth 5 points each) and 5 true/false question (worth 1 point each), for a total of 75 points.
Math 131 Exam 1 Solutions Part I consists of 14 multiple choice questions (orth 5 points each) and 5 true/false question (orth 1 point each), for a total of 75 points. 1. The folloing table gives the number
More informationExample: A Markov Process
Example: A Markov Process Divide the greater metro region into three parts: city such as St. Louis), suburbs to include such areas as Clayton, University City, Richmond Heights, Maplewood, Kirkwood,...)
More informationASM Study Manual for Exam P, First Edition By Dr. Krzysztof M. Ostaszewski, FSA, CFA, MAAA Errata
ASM Study Manual for Exam P, First Edition By Dr. Krzysztof M. Ostaszewski, FSA, CFA, MAAA (krzysio@krzysio.net) Errata Effective July 5, 3, only the latest edition of this manual will have its errata
More informationACTEX CAS EXAM 3 STUDY GUIDE FOR MATHEMATICAL STATISTICS
ACTEX CAS EXAM 3 STUDY GUIDE FOR MATHEMATICAL STATISTICS TABLE OF CONTENTS INTRODUCTORY NOTE NOTES AND PROBLEM SETS Section 1 - Point Estimation 1 Problem Set 1 15 Section 2 - Confidence Intervals and
More information1. Classify each number. Choose all correct answers. b. È # : (i) natural number (ii) integer (iii) rational number (iv) real number
Review for Placement Test To ypass Math 1301 College Algebra Department of Computer and Mathematical Sciences University of Houston-Downtown Revised: Fall 2009 PLEASE READ THE FOLLOWING CAREFULLY: 1. The
More informationDr. Nestler - Math 2 - Ch 3: Polynomial and Rational Functions
Dr. Nestler - Math 2 - Ch 3: Polynomial and Rational Functions 3.1 - Polynomial Functions We have studied linear functions and quadratic functions Defn. A monomial or power function is a function of the
More informationThe Spotted Owls 5 " 5. = 5 " œ!þ")45 Ð'!% leave nest, 30% of those succeed) + 5 " œ!þ("= 5!Þ*%+ 5 ( adults live about 20 yrs)
The Spotted Owls Be sure to read the example at the introduction to Chapter in the textbook. It gives more general background information for this example. The example leads to a dynamical system which
More informationDEPARTMENT OF MATHEMATICS AND STATISTICS QUALIFYING EXAMINATION II IN MATHEMATICAL STATISTICS SATURDAY, SEPTEMBER 24, 2016
DEPARTMENT OF MATHEMATICS AND STATISTICS QUALIFYING EXAMINATION II IN MATHEMATICAL STATISTICS SATURDAY, SEPTEMBER 24, 2016 Examiners: Drs. K. M. Ramachandran and G. S. Ladde INSTRUCTIONS: a. The quality
More informationSPRING 2005 EXAM M SOLUTIONS. = When (as given in the problem), (x) dies in the second year from issue, the curtate future lifetime x + 1 is 0, so
SPRING 005 EXAM M SOLUTIONS Question # Key: B Let K be the curtate future lifetime of (x + k) K + k L 000v 000Px :3 ak + When (as given in the problem), (x) dies in the second year from issue, the curtate
More informationSTAT 2122 Homework # 3 Solutions Fall 2018 Instr. Sonin
STAT 2122 Homeork Solutions Fall 2018 Instr. Sonin Due Friday, October 5 NAME (25 + 5 points) Sho all ork on problems! (4) 1. In the... Lotto, you may pick six different numbers from the set Ö"ß ß $ß ÞÞÞß
More informationASM Study Manual for Exam P, Second Edition By Dr. Krzysztof M. Ostaszewski, FSA, CFA, MAAA Errata
ASM Study Manual for Exam P, Second Edition By Dr. Krzysztof M. Ostaszewski, FSA, CFA, MAAA (krzysio@krzysio.net) Errata Effective July 5, 3, only the latest edition of this manual will have its errata
More informationCAS Exam MAS-1. Howard Mahler. Stochastic Models
CAS Exam MAS-1 Howard Mahler Stochastic Models 2019 Stochastic Models, HCM 12/31/18, Page 1 The slides are in the same order as the sections of my study guide. Section # Section Name 1 Introduction 2 Exponential
More informationEngineering Mathematics (E35 317) Final Exam December 18, 2007
Engineering Mathematics (E35 317) Final Exam December 18, 2007 This exam contains 18 multile-choice roblems orth to oints each, five short-anser roblems orth one oint each, and nine true-false roblems
More informationErrata for the ASM Study Manual for Exam P, Fourth Edition By Dr. Krzysztof M. Ostaszewski, FSA, CFA, MAAA
Errata for the ASM Study Manual for Exam P, Fourth Edition By Dr. Krzysztof M. Ostaszewski, FSA, CFA, MAAA (krzysio@krzysio.net) Effective July 5, 3, only the latest edition of this manual will have its
More informationPractice Exam 1. (A) (B) (C) (D) (E) You are given the following data on loss sizes:
Practice Exam 1 1. Losses for an insurance coverage have the following cumulative distribution function: F(0) = 0 F(1,000) = 0.2 F(5,000) = 0.4 F(10,000) = 0.9 F(100,000) = 1 with linear interpolation
More informationProofs Involving Quantifiers. Proof Let B be an arbitrary member Proof Somehow show that there is a value
Proofs Involving Quantifiers For a given universe Y : Theorem ÐaBÑ T ÐBÑ Theorem ÐbBÑ T ÐBÑ Proof Let B be an arbitrary member Proof Somehow show that there is a value of Y. Call it B œ +, say Þ ÐYou can
More informationMixture distributions in Exams MLC/3L and C/4
Making sense of... Mixture distributions in Exams MLC/3L and C/4 James W. Daniel Jim Daniel s Actuarial Seminars www.actuarialseminars.com February 1, 2012 c Copyright 2012 by James W. Daniel; reproduction
More informationHere are proofs for some of the results about diagonalization that were presented without proof in class.
Suppose E is an 8 8 matrix. In what follows, terms like eigenvectors, eigenvalues, and eigenspaces all refer to the matrix E. Here are proofs for some of the results about diagonalization that were presented
More information1. If X has density. cx 3 e x ), 0 x < 0, otherwise. Find the value of c that makes f a probability density. f(x) =
1. If X has density f(x) = { cx 3 e x ), 0 x < 0, otherwise. Find the value of c that makes f a probability density. 2. Let X have density f(x) = { xe x, 0 < x < 0, otherwise. (a) Find P (X > 2). (b) Find
More informationMath 132, Spring 2003 Exam 2: Solutions
Math 132, Spring 2003 Exam 2: Solutions No calculators with a CAS are allowed. e sure your calculator is set for radians, not degrees if you do any calculus computations with trig functions. Part I, Multiple
More informationYou may use a calculator. Translation: Show all of your work; use a calculator only to do final calculations and/or to check your work.
GROUND RULES: Print your name at the top of this page. This is a closed-book and closed-notes exam. You may use a calculator. Translation: Show all of your work; use a calculator only to do final calculations
More informationThe Experts In Actuarial Career Advancement. Product Preview. For More Information: or call 1(800)
P U B L I C A T I O N S The Experts In Actuarial Career Advancement Product Previe For More Information: email Support@ActexMadRivercom or call 1(800) 282-2839 SECTION 1 - BASIC PROBABILITY CONCEPTS 37
More informationSection 1.3 Functions and Their Graphs 19
23. 0 1 2 24. 0 1 2 y 0 1 0 y 1 0 0 Section 1.3 Functions and Their Graphs 19 3, Ÿ 1, 0 25. y œ 26. y œ œ 2, 1 œ, 0 Ÿ " 27. (a) Line through a!ß! band a"ß " b: y œ Line through a"ß " band aß! b: y œ 2,
More informationMath 131, Exam 2 Solutions, Fall 2010
Math 131, Exam 2 Solutions, Fall 2010 Part I consists of 14 multiple choice questions (orth 5 points each) and 5 true/false questions (orth 1 point each), for a total of 75 points. Mark the correct anser
More informationTABLE OF CONTENTS - VOLUME 1
TABLE OF CONTENTS - VOLUME 1 INTRODUCTORY COMMENTS MODELING SECTION 1 - PROBABILITY REVIEW PROBLEM SET 1 LM-1 LM-9 SECTION 2 - REVIEW OF RANDOM VARIABLES - PART I PROBLEM SET 2 LM-19 LM-29 SECTION 3 -
More informationDr. H. Joseph Straight SUNY Fredonia Smokin' Joe's Catalog of Groups: Direct Products and Semi-direct Products
Dr. H. Joseph Straight SUNY Fredonia Smokin' Joe's Catalog of Groups: Direct Products and Semi-direct Products One of the fundamental problems in group theory is to catalog all the groups of some given
More informationEngineering Mathematics (E35 317) Final Exam December 15, 2006
Engineering Mathematics (E35 317) Final Exam December 15, 2006 This exam contains six free-resonse roblems orth 36 oints altogether, eight short-anser roblems orth one oint each, seven multile-choice roblems
More informationSIMULTANEOUS CONFIDENCE BANDS FOR THE PTH PERCENTILE AND THE MEAN LIFETIME IN EXPONENTIAL AND WEIBULL REGRESSION MODELS. Ping Sa and S.J.
SIMULTANEOUS CONFIDENCE BANDS FOR THE PTH PERCENTILE AND THE MEAN LIFETIME IN EXPONENTIAL AND WEIBULL REGRESSION MODELS " # Ping Sa and S.J. Lee " Dept. of Mathematics and Statistics, U. of North Florida,
More informationDefinition Suppose M is a collection (set) of sets. M is called inductive if
Definition Suppose M is a collection (set) of sets. M is called inductive if a) g M, and b) if B Mß then B MÞ Then we ask: are there any inductive sets? Informally, it certainly looks like there are. For
More informationMath 129 Past Exam Questions
Math 9 Past Exam Questions Here are some questions that appeared on common exams in past semesters. This is not a sample exam, but it is a reasonable guide to the style and level of common exam given by
More informationProbability basics. Probability and Measure Theory. Probability = mathematical analysis
MA 751 Probability basics Probability and Measure Theory 1. Basics of probability 2 aspects of probability: Probability = mathematical analysis Probability = common sense Probability basics A set-up of
More informationCourse 1 Solutions November 2001 Exams
Course Solutions November Exams . A For i =,, let R = event that a red ball is drawn form urn i i B = event that a blue ball is drawn from urn i. i Then if x is the number of blue balls in urn, ( R R)
More informationMahler s Guide to Stochastic Models
HCMSA-S07-3-1A, Stochastic Models, 11/22/06, Page 1 Mahler s Guide to Stochastic Models Copyright 2007 by Howard C. Mahler. Information in bold or sections whose title is in bold are more important for
More informationContinuous-Valued Probability Review
CS 6323 Continuous-Valued Probability Review Prof. Gregory Provan Department of Computer Science University College Cork 2 Overview Review of discrete distributions Continuous distributions 3 Discrete
More information: œ Ö: =? À =ß> real numbers. œ the previous plane with each point translated by : Ðfor example,! is translated to :)
â SpanÖ?ß@ œ Ö =? > @ À =ß> real numbers : SpanÖ?ß@ œ Ö: =? > @ À =ß> real numbers œ the previous plane with each point translated by : Ðfor example, is translated to :) á In general: Adding a vector :
More informationPage Max. Possible Points Total 100
Math 3215 Exam 2 Summer 2014 Instructor: Sal Barone Name: GT username: 1. No books or notes are allowed. 2. You may use ONLY NON-GRAPHING and NON-PROGRAMABLE scientific calculators. All other electronic
More informationInner Product Spaces. Another notation sometimes used is X.?
Inner Product Spaces X In 8 we have an inner product? @? @?@ ÞÞÞ? 8@ 8Þ Another notation sometimes used is X? ß@? @? @? @ ÞÞÞ? @ 8 8 The inner product in?@ ß in 8 has several essential properties ( see
More informationSTAT 414: Introduction to Probability Theory
STAT 414: Introduction to Probability Theory Spring 2016; Homework Assignments Latest updated on April 29, 2016 HW1 (Due on Jan. 21) Chapter 1 Problems 1, 8, 9, 10, 11, 18, 19, 26, 28, 30 Theoretical Exercises
More informationInner Product Spaces
Inner Product Spaces In 8 X, we defined an inner product? @? @?@ ÞÞÞ? 8@ 8. Another notation sometimes used is? @? ß@. The inner product in 8 has several important properties ( see Theorem, p. 33) that
More informationGene expression experiments. Infinite Dimensional Vector Spaces. 1. Motivation: Statistical machine learning and reproducing kernel Hilbert Spaces
MA 751 Part 3 Gene expression experiments Infinite Dimensional Vector Spaces 1. Motivation: Statistical machine learning and reproducing kernel Hilbert Spaces Gene expression experiments Question: Gene
More informationCS 361: Probability & Statistics
February 26, 2018 CS 361: Probability & Statistics Random variables The discrete uniform distribution If every value of a discrete random variable has the same probability, then its distribution is called
More informationSTAT 418: Probability and Stochastic Processes
STAT 418: Probability and Stochastic Processes Spring 2016; Homework Assignments Latest updated on April 29, 2016 HW1 (Due on Jan. 21) Chapter 1 Problems 1, 8, 9, 10, 11, 18, 19, 26, 28, 30 Theoretical
More informationThe Rational Numbers
The Rational Numbers Fields The system of integers that e formally defined is an improvement algebraically on the hole number system = (e can subtract in ) But still has some serious deficiencies: for
More informationRandom Processes. DS GA 1002 Probability and Statistics for Data Science.
Random Processes DS GA 1002 Probability and Statistics for Data Science http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall17 Carlos Fernandez-Granda Aim Modeling quantities that evolve in time (or space)
More informationÆ Å not every column in E is a pivot column (so EB œ! has at least one free variable) Æ Å E has linearly dependent columns
ßÞÞÞß @ is linearly independent if B" @" B# @# ÞÞÞ B: @: œ! has only the trivial solution EB œ! has only the trivial solution Ðwhere E œ Ò@ @ ÞÞÞ@ ÓÑ every column in E is a pivot column E has linearly
More informationNotes for Math 324, Part 20
7 Notes for Math 34, Part Chapter Conditional epectations, variances, etc.. Conditional probability Given two events, the conditional probability of A given B is defined by P[A B] = P[A B]. P[B] P[A B]
More informationRandom variables (section 6.1)
Random variables (section 6.1) random variable: a number attached to the outcome of a random process (r.v is usually denoted with upper case letter, such as \) discrete random variables discrete random
More informationPractice Exam #1 CAS Exam 3L
Practice Exam #1 CAS Exam 3L These practice exams should be used during the last month prior to your exam. This practice exam contains 25 questions, of equal value, corresponding to an exam of about 2.5
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 informationSystems of Equations 1. Systems of Linear Equations
Lecture 1 Systems of Equations 1. Systems of Linear Equations [We will see examples of how linear equations arise here, and how they are solved:] Example 1: In a lab experiment, a researcher wants to provide
More informationEngineering Mathematics (E35 317) Exam 3 November 7, 2007
Engineering Mathematics (E35 317) Exam 3 November 7, 2007 This exam contains four multile-choice roblems worth two oints each, twelve true-false roblems worth one oint each, and four free-resonse roblems
More informationMath 1M03 (Version 1) Sample Exam
Math 1M03 (Version 1) Sample Exam Name: (Last Name) (First Name) Student Number: Day Class Duration: 3 Hours Maximum Mark: 40 McMaster University Sample Final Examination This examination paper consists
More informatione) D œ < f) D œ < b) A parametric equation for the line passing through Ð %, &,) ) and (#,(, %Ñ.
Page 1 Calculus III : Bonus Problems: Set 1 Grade /42 Name Due at Exam 1 6/29/2018 1. (2 points) Give the equations for the following geometrical objects : a) A sphere of radius & centered at the point
More informationStat 643 Problems. a) Show that V is a sub 5-algebra of T. b) Let \ be an integrable random variable. Find EÐ\lVÑÞ
Stat 643 Problems 1. Let ( HT, ) be a measurable space. Suppose that., T and Uare 5-finite positive measures on this space with T Uand U...T.T.U a) Show that T. and œ a.s......u.....u.u Š.. b) Show that
More informationNotes for Math 324, Part 17
126 Notes for Math 324, Part 17 Chapter 17 Common discrete distributions 17.1 Binomial Consider an experiment consisting by a series of trials. The only possible outcomes of the trials are success and
More informationEquivalent Sets. It is intuitively clear that for finite sets E F iff Eand Fhave the same number of elementsþ
Equivalent Sets Definition Let Eß F be sets. We say that E is equivalent to F iff there exists a bijection 0ÀEÄF. If Eis equivalent to F, we write E FÐor E For EµFor something similar: the notation varies
More informationMATH/STAT 3360, Probability
MATH/STAT 3360, Probability Sample Final Examination This Sample examination has more questions than the actual final, in order to cover a wider range of questions. Estimated times are provided after each
More informationEleventh Problem Assignment
EECS April, 27 PROBLEM (2 points) The outcomes of successive flips of a particular coin are dependent and are found to be described fully by the conditional probabilities P(H n+ H n ) = P(T n+ T n ) =
More information18.05 Practice Final Exam
No calculators. 18.05 Practice Final Exam Number of problems 16 concept questions, 16 problems. Simplifying expressions Unless asked to explicitly, you don t need to simplify complicated expressions. For
More informationSTT 315 Problem Set #3
1. A student is asked to calculate the probability that x = 3.5 when x is chosen from a normal distribution with the following parameters: mean=3, sd=5. To calculate the answer, he uses this command: >
More informationACTEX. SOA Exam P Study Manual. With StudyPlus Edition Samuel A. Broverman, Ph.D., ASA. ACTEX Learning Learn Today. Lead Tomorrow.
ACTEX SOA Exam P Study Manual With StudyPlus + StudyPlus + gives you digital access* to: Flashcards & Formula Sheet Actuarial Exam & Career Strategy Guides Technical Skill elearning Tools Samples of Supplemental
More informationIntroduction to Diagonalization
Introduction to Diagonalization For a square matrix E, a process called diagonalization can sometimes give us more insight into how the transformation B ÈE B works. The insight has a strong geometric flavor,
More information2. Let 0 be as in problem 1. Find the Fourier coefficient,&. (In other words, find the constant,& the Fourier series for 0.)
Engineering Mathematics (ESE 317) Exam 4 April 23, 200 This exam contains seven multiple-choice problems worth two points each, 11 true-false problems worth one point each, and some free-response problems
More informationEXAM. Exam #1. Math 3342 Summer II, July 21, 2000 ANSWERS
EXAM Exam # Math 3342 Summer II, 2 July 2, 2 ANSWERS i pts. Problem. Consider the following data: 7, 8, 9, 2,, 7, 2, 3. Find the first quartile, the median, and the third quartile. Make a box and whisker
More informationCHAPTER 4 DECIMALS. 4.1 Reading and Writing Decimals. 4.1 Reading and Writing Decimals Margin Exercises. ten-thousandths.
4.1 Reading and Writing Decimals 113 CHAPTER 4 DECIMALS 4.1 Reading and Writing Decimals 4.1 Margin Exercises 1. (a The figure has equal parts; part is shaded. ; Þ ; one tenth (b The figure has equal parts;
More informationIEOR 3106: Introduction to Operations Research: Stochastic Models. Professor Whitt. SOLUTIONS to Homework Assignment 2
IEOR 316: Introduction to Operations Research: Stochastic Models Professor Whitt SOLUTIONS to Homework Assignment 2 More Probability Review: In the Ross textbook, Introduction to Probability Models, read
More informationCellular Automaton Growth on # : Theorems, Examples, and Problems
Cellular Automaton Growth on : Theorems, Examples, and Problems (Excerpt from Advances in Applied Mathematics) Exactly 1 Solidification We will study the evolution starting from a single occupied cell
More informationExample Let VœÖÐBßCÑ À b-, CœB - ( see the example above). Explain why
Definition If V is a relation from E to F, then a) the domain of V œ dom ÐVÑ œ Ö+ E À b, F such that Ð+ß,Ñ V b) the range of V œ ran( VÑ œ Ö, F À b+ E such that Ð+ß,Ñ V " c) the inverse relation of V œ
More informationS n = x + X 1 + X X n.
0 Lecture 0 0. Gambler Ruin Problem Let X be a payoff if a coin toss game such that P(X = ) = P(X = ) = /2. Suppose you start with x dollars and play the game n times. Let X,X 2,...,X n be payoffs in each
More informationName: Firas Rassoul-Agha
Midterm 1 - Math 5010 - Spring 016 Name: Firas Rassoul-Agha Solve the following 4 problems. You have to clearly explain your solution. The answer carries no points. Only the work does. CALCULATORS ARE
More informationSVM example: cancer classification Support Vector Machines
SVM example: cancer classification Support Vector Machines 1. Cancer genomics: TCGA The cancer genome atlas (TCGA) will provide high-quality cancer data for large scale analysis by many groups: SVM example:
More informationMath 1AA3/1ZB3 Sample Test 3, Version #1
Math 1AA3/1ZB3 Sample Test 3, Version 1 Name: (Last Name) (First Name) Student Number: Tutorial Number: This test consists of 16 multiple choice questions worth 1 mark each (no part marks), and 1 question
More informationMath 562 Homework 1 August 29, 2006 Dr. Ron Sahoo
Math 56 Homework August 9, 006 Dr. Ron Sahoo He who labors diligently need never despair; for all things are accomplished by diligence and labor. Menander of Athens Direction: This homework worths 60 points
More informationPractice Problems Section Problems
Practice Problems Section 4-4-3 4-4 4-5 4-6 4-7 4-8 4-10 Supplemental Problems 4-1 to 4-9 4-13, 14, 15, 17, 19, 0 4-3, 34, 36, 38 4-47, 49, 5, 54, 55 4-59, 60, 63 4-66, 68, 69, 70, 74 4-79, 81, 84 4-85,
More informationInfinite Dimensional Vector Spaces. 1. Motivation: Statistical machine learning and reproducing kernel Hilbert Spaces
MA 751 Part 3 Infinite Dimensional Vector Spaces 1. Motivation: Statistical machine learning and reproducing kernel Hilbert Spaces Microarray experiment: Question: Gene expression - when is the DNA in
More informationChapter 2 Descriptive Statistics
Chapter 2 Descriptive Statistics The Mean "When she told me I was average, she was just being mean". The mean is probably the most often used parameter or statistic used to describe the central tendency
More informationPRACTICE PROBLEMS FOR EXAM 2
PRACTICE PROBLEMS FOR EXAM 2 Math 3160Q Fall 2015 Professor Hohn Below is a list of practice questions for Exam 2. Any quiz, homework, or example problem has a chance of being on the exam. For more practice,
More informationProbability and Statistics Concepts
University of Central Florida Computer Science Division COT 5611 - Operating Systems. Spring 014 - dcm Probability and Statistics Concepts Random Variable: a rule that assigns a numerical value to each
More informationIt's Only Fitting. Fitting model to data parameterizing model estimating unknown parameters in the model
It's Only Fitting Fitting model to data parameterizing model estimating unknown parameters in the model Likelihood: an example Cohort of 8! individuals observe survivors at times >œ 1, 2, 3,..., : 8",
More informationCOVENANT UNIVERSITY NIGERIA TUTORIAL KIT OMEGA SEMESTER PROGRAMME: ECONOMICS
COVENANT UNIVERSITY NIGERIA TUTORIAL KIT OMEGA SEMESTER PROGRAMME: ECONOMICS COURSE: CBS 221 DISCLAIMER The contents of this document are intended for practice and leaning purposes at the undergraduate
More information1.225J J (ESD 205) Transportation Flow Systems
1.225J J (ESD 25) Transportation Flow Systems Lecture 9 Simulation Models Prof. Ismail Chabini and Prof. Amedeo R. Odoni Lecture 9 Outline About this lecture: It is based on R16. Only material covered
More informationEE/CpE 345. Modeling and Simulation. Fall Class 5 September 30, 2002
EE/CpE 345 Modeling and Simulation Class 5 September 30, 2002 Statistical Models in Simulation Real World phenomena of interest Sample phenomena select distribution Probabilistic, not deterministic Model
More informationCorrelation: Copulas and Conditioning
Correlation: Copulas and Conditioning This note reviews two methods of simulating correlated variates: copula methods and conditional distributions, and the relationships between them. Particular emphasis
More informationTABLE OF CONTENTS CHAPTER 1 COMBINATORIAL PROBABILITY 1
TABLE OF CONTENTS CHAPTER 1 COMBINATORIAL PROBABILITY 1 1.1 The Probability Model...1 1.2 Finite Discrete Models with Equally Likely Outcomes...5 1.2.1 Tree Diagrams...6 1.2.2 The Multiplication Principle...8
More informationMath 151. Rumbos Fall Solutions to Review Problems for Final Exam
Math 5. Rumbos Fall 23 Solutions to Review Problems for Final Exam. Three cards are in a bag. One card is red on both sides. Another card is white on both sides. The third card in red on one side and white
More informationLesson 6.6 Radical Equations
Lesson 6.6 Radical Equations Activity 1 Radical Equations 1. a. To solve a radical equation, we: (1) isolate the radical, then () square both sides. Be careful when squaring a binomial! For example, #
More information