CAE Working Paper # Failure of a Credit System: Implications of the Large Deviation Theory. Rabi Bhattacharya and Mukul Majumdar.
|
|
- Whitney Reeves
- 5 years ago
- Views:
Transcription
1 ISS CAE Working Paper #11-01 Failure of a Credit System: Implications of the Large Deviation Theory by Rabi Bhattacharya and ukul ajumdar February 011
2 Failure of a Credit System: Implications of the Large Deviation Theory Rabi Bhattacharya and ukul ajumdar April Introduction Suppose each of A = /A customers n 1 receives a loan of A dollars from a bank, and the probability is p that the customer will return dollars to the bank at the end of the year R > 1, and the probability is p that he or she will default, returning no money to the bank 0 < p < 1. Assume also that apart from the dollars the bank lends each year, it has a backup asset of dollars per year 0. We will say that the bank fails at the end of T years if T S j T T, 1 j=1 where S j is the number of customers in the jth period returning dollars to the bank. We assume S j, 1 j T, are independent, as are the A customers in each period. Then S j has the binomial distribution Binom A, p, 1 j T, and T j=1 S j is also Binom A T, p. The probability of bank failure at the end of period T is then T T QT P S j, j=1 Department of athematics, University of Arizona Department of Economics, Cornell University 1
3 which may also be represented as A T T P Y i, 3 where Y i, 1 i A T, are i.i.d., with PY i = 1 = p, and PY i = 0 = 1 p. ote that EY i = p i. Consider two cases. Case I: p < R 1, Case II : p > 1 R. Case I. In this case, writing δ = R 1 p, δ > 0, we may express 3 as AT Q I T = P Y i A T p + δ 4 By the theory of large deviations see, e.g., Bhattacharya and Waymire 007, Theorem 4.8, pp , Q I T = e λ AT 1 + o1 as A T T A where, writing mh = Ee hy i = pe h + p, one has, 5 λ = c p + δ, c x := sup{xh lnmh}. 6 h R Clearly, c x 0. Also, for 0 < x < 1, xh lnmh as h ±. Hence c x may be obtained by solving for h the equation 0 = d peh {xh lnmh} = x dh mh, or, peh = p x { } or h = ln 1 px p1 x. Then and λ = c p + δ = 1 R p = Bln p c x = xln { } px ln p x { p ln p B ln B p B, p = px x. 7 p, 8 x } { } /R p ln /R /R
4 B := 1 R. 9 Thus the probability that the bank does not fail at the end of period T is e λt /A 1 + o1, which goes to zero exponentially fast as T /A. One may, in this case prove the stronger result that Q I T = {e λ T /A}1 + o1, 10 Q I T := Pthe bank fails at some period t, 1 t T. 11 Remark 1. ote that λ in 9 does not depend on A. Thus the exponent λt /A decreases as A increases, so that e λt /A increases as A increases. This shows that, in Case I, the probability of bank failure increases as A increases. That is, with the same capital outlay of dollars per year, the same probability p of default by a customer, and the same expected revenue Rp per year i.e., the same interest rate R 1 charged to a customer, the probability of bank failure rises as the amount of loan per customer rises. One may think of this as the effect of higher volatility, since var S j = R A A p p = R p pa although ES j = R p is not affected by A. Remark. ote that d dx c x = ln { } px, 0 < x < 1 1 p x Hence d/dxc x > 0 if px > p x, and d/dxc x < 0 if px < p x. Since pp + δ > p p δ, 1 λ = c p + δ c decreases as R increases. 13 R In other words, the chance of bank failure decreases as R or the interest rate increases - a rather obvious conclusion, but with a precise calculation of the rates. Case II. Assume now that p > R 1. Then one may rewrite 3 as A T T Q II T P Z i, 14 where Z i = Y i, 1 i A T, are i.i.d., PZ i = 1 = p, PZ i = 0 = p, EZ i = p, mh = Ee hz i = pe h + p. One now has 1 = p δ,δ := p R R 3
5 Then, by the large deviation principle, AT Q II T P Z i A T p + δ = e λat 1 + o1 16 where = e λt /A 1 + o1, as A T, [ ] λ = c p + δ, c x := sup h xh ln pe h + p. 17 By symmetry, or by direct calculation as in 7, 8, one may show that, in this case, { } p λ c p δ p + δ = p δln ln p p p + δ p + δ { } p B p B p = Bln ln = Bln Bln 18, p B B p B B : = 1. R Remark 3. Since λ in 18 does not involve A, it follow that the exponentially small probability of bank failure, as given by 16, increases as A increases showing the effect of volatility. Also, as in Remark, if R increases then the probability of bank failure decreases, since the revenue grows given that p remains the same. The relation 18, however, refines this obvious fact. A numerical illustration. Case II. = 1000, T = 5, p = 0.9, R = 1. a A = 10 [ A = 100]. Then λ = 1 1. ln ln 0. = Q II T e = e = b A = 100 [ A = 10]. Then Q II T e =
6 The calculation in b for the approximate probability of ruin is better done using the central limit theorem, rather than large deviations. For in this case the ormal approximation to the probability is PZ > 1.58 = 0.057, where Z is a standard ormal random variable. In Case II, the probability of bank failure before or in period T is for = 0 Q I T = PBank failure occurs at the end of period 1 + PFirst failure occurs at the end of period + + PFirst failure occurs at the end of period T e λ A 1 + o1 + e λ A 1 + o1 + + e T λ A 1 + o1 = e λ A + e λ A + + e T λ A + oe λ A e λ A 19 On the other hand, obviously, Q I T PBank fails at the end of period 1 = e λ A 1 + o1. 0 It follows from 19 and 0 that Q I T = e λ A 1 + o1 1 We consider next the more realistic model in which the probability p depends on the state θ of nature. Given the state θ that obtains, the customers behave independently with regard to loan repayment, with a common probability p θ of repayment. The distribution of customers is thus exchangeable. It is also assumed that the sequence θ n : n 1 of values of θ. For simplicity, let θ have two possible values θ = a 1 e.g., normal rainfall and θ = a drought. Let πa i = Probθ = a i, i = 1,. Assume p a1 > 1 R, pa < 1 R. In one period i.e., T = 1, the probability of bank failure is Q1 = πa 1 P By the preceding see 6,10, and 16, 18, S 1 θ = a i. Q1 = πa 1 e λ a 1 /A 1 + o1 + πa e λ a T /A 1 + o1, 3 5
7 where, with B = 1 R as in 10, one has see 10 and 18. B pa1 λ a1 = Bln Bln p a1 B pa λ θ = Bln pa p a B ln B B For the case T =, the corresponding failure probability is Q = πa i πa j P S 1 + S i, j=1 = πa 1 e λ a 1 A + πa 1 πa P,. 4 θ 1 = a i,θ = a j 1 + o1 + πa [ e λ a A S 1 + S 1 + o1] θ 1 = a i,θ = a j. The last summand on the right side in 5 may be expressed as πa 1 πa A y=0 A y p y a 1 p a1 A y P S 5 m θ = a. 6 For asymptotics, one may use a number of approximations to 6 or the last term in 5. pa1 +p Consider two cases. First, suppose a > R 1. Then, by Bernstein s inequality, we can show that PS 1 + S θ 1 = a 1,θ = a is exponentially small, namely, Oexp c A for some positive constant c. In this case, Q = πa + 0e c A 7 for some constant c > 0 Thus Q is essentially πa. Secondly, suppose < R 1. Then, again by Bernstein s inequality, one can show that, pa1 +p a P S 1 + S θ 1 = a 1,θ = a = δ A, where δ A 0 exponentially fast with A. In this case, for same positive constant c. Q = πa + πa 1 πa + oe c A 8 6
8 In the general case of T periods T > 1, one may express the failure probability as T QT = πa T + π T 1 a πa 1 1 T m P S S T θ 1 = a 1,θ i = a for i T T + π T a π a 1 T m P S S T θ 1 = a 1,θ = a 1,θ i = a for 3 i T T r + + P S S T π T r a π r a 1 T m θ i = a 1, for 1 i r, θ i = a for r + 1 i T + + π T a 1 T m P S S T θ i = a 1, for 1 i T. 9 Assume, for simplicity, that rp a1 + T rp a does not equal T for any r. Again we consider several cases. Suppose r, 0 r T 1, is the largest integer such that, Then case r : rp a1 + T rp a < QT = r j=0 T r = 0,1,,T T π j a 1 π T j a + o1 for r = 0,1,,T j The error o1 is of the order exp c r A, where c r > 0 can be estimated using Bernstein s inequality. ote c r is increasing in r. 7
S 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 informationExam 3, Math Fall 2016 October 19, 2016
Exam 3, Math 500- Fall 06 October 9, 06 This is a 50-minute exam. You may use your textbook, as well as a calculator, but your work must be completely yours. The exam is made of 5 questions in 5 pages,
More information8 Laws of large numbers
8 Laws of large numbers 8.1 Introduction We first start with the idea of standardizing a random variable. Let X be a random variable with mean µ and variance σ 2. Then Z = (X µ)/σ will be a random variable
More informationProblems of ruin and survival in economics: applications of limit theorems in probability
Sankhyā : The Indian Journal of Statistics 2013, Volume 75-B, Part 2, pp. 145-180 c 2013, Indian Statistical Institute Problems of ruin and survival in economics: applications of limit theorems in probability
More informationA Probability Primer. A random walk down a probabilistic path leading to some stochastic thoughts on chance events and uncertain outcomes.
A Probability Primer A random walk down a probabilistic path leading to some stochastic thoughts on chance events and uncertain outcomes. Are you holding all the cards?? Random Events A random event, E,
More informationEECS 126 Probability and Random Processes University of California, Berkeley: Spring 2018 Kannan Ramchandran February 14, 2018.
EECS 6 Probability and Random Processes University of California, Berkeley: Spring 08 Kannan Ramchandran February 4, 08 Midterm Last Name First Name SID You have 0 minutes to read the exam and 90 minutes
More informationSTAT2201. Analysis of Engineering & Scientific Data. Unit 3
STAT2201 Analysis of Engineering & Scientific Data Unit 3 Slava Vaisman The University of Queensland School of Mathematics and Physics What we learned in Unit 2 (1) We defined a sample space of a random
More informationSTAT 200C: High-dimensional Statistics
STAT 200C: High-dimensional Statistics Arash A. Amini May 30, 2018 1 / 59 Classical case: n d. Asymptotic assumption: d is fixed and n. Basic tools: LLN and CLT. High-dimensional setting: n d, e.g. n/d
More information4 Expectation & the Lebesgue Theorems
STA 205: Probability & Measure Theory Robert L. Wolpert 4 Expectation & the Lebesgue Theorems Let X and {X n : n N} be random variables on a probability space (Ω,F,P). If X n (ω) X(ω) for each ω Ω, does
More informationRenewal theory and its applications
Renewal theory and its applications Stella Kapodistria and Jacques Resing September 11th, 212 ISP Definition of a Renewal process Renewal theory and its applications If we substitute the Exponentially
More informationLecture 2: Review of Basic Probability Theory
ECE 830 Fall 2010 Statistical Signal Processing instructor: R. Nowak, scribe: R. Nowak Lecture 2: Review of Basic Probability Theory Probabilistic models will be used throughout the course to represent
More informationCalculating credit risk capital charges with the one-factor model
Calculating credit risk capital charges with the one-factor model Susanne Emmer Dirk Tasche September 15, 2003 Abstract Even in the simple Vasicek one-factor credit portfolio model, the exact contributions
More informationDO NOT OPEN THIS QUESTION BOOKLET UNTIL YOU ARE TOLD TO DO SO
QUESTION BOOKLET EE 126 Spring 26 Midterm #2 Thursday, April 13, 11:1-12:3pm DO NOT OPEN THIS QUESTION BOOKLET UNTIL YOU ARE TOLD TO DO SO You have 8 minutes to complete the midterm. The midterm consists
More informationWe introduce methods that are useful in:
Instructor: Shengyu Zhang Content Derived Distributions Covariance and Correlation Conditional Expectation and Variance Revisited Transforms Sum of a Random Number of Independent Random Variables more
More informationMATH 151, FINAL EXAM Winter Quarter, 21 March, 2014
Time: 3 hours, 8:3-11:3 Instructions: MATH 151, FINAL EXAM Winter Quarter, 21 March, 214 (1) Write your name in blue-book provided and sign that you agree to abide by the honor code. (2) The exam consists
More informationLectures 16-17: Poisson Approximation. Using Lemma (2.4.3) with θ = 1 and then Lemma (2.4.4), which is valid when max m p n,m 1/2, we have
Lectures 16-17: Poisson Approximation 1. The Law of Rare Events Theorem 2.6.1: For each n 1, let X n,m, 1 m n be a collection of independent random variables with PX n,m = 1 = p n,m and PX n,m = = 1 p
More informationCME 106: Review Probability theory
: Probability theory Sven Schmit April 3, 2015 1 Overview In the first half of the course, we covered topics from probability theory. The difference between statistics and probability theory is the following:
More informationSTA 711: Probability & Measure Theory Robert L. Wolpert
STA 711: Probability & Measure Theory Robert L. Wolpert 6 Independence 6.1 Independent Events A collection of events {A i } F in a probability space (Ω,F,P) is called independent if P[ i I A i ] = P[A
More informationf X (x) = λe λx, , x 0, k 0, λ > 0 Γ (k) f X (u)f X (z u)du
11 COLLECTED PROBLEMS Do the following problems for coursework 1. Problems 11.4 and 11.5 constitute one exercise leading you through the basic ruin arguments. 2. Problems 11.1 through to 11.13 but excluding
More informationProblem Points S C O R E Total: 120
PSTAT 160 A Final Exam Solution December 10, 2015 Name Student ID # Problem Points S C O R E 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 10 11 10 12 10 Total: 120 1. (10 points) Take a Markov chain
More informationChapter 5. Continuous Probability Distributions
Chapter 5. Continuous Probability Distributions Sections 5.4, 5.5: Exponential and Gamma Distributions Jiaping Wang Department of Mathematical Science 03/25/2013, Monday Outline Exponential: PDF and CDF
More informationPoisson Cluster process as a model for teletraffic arrivals and its extremes
Poisson Cluster process as a model for teletraffic arrivals and its extremes Barbara González-Arévalo, University of Louisiana Thomas Mikosch, University of Copenhagen Gennady Samorodnitsky, Cornell University
More informationIntroduction to Probability
LECTURE NOTES Course 6.041-6.431 M.I.T. FALL 2000 Introduction to Probability Dimitri P. Bertsekas and John N. Tsitsiklis Professors of Electrical Engineering and Computer Science Massachusetts Institute
More informationFigure 10.1: Recording when the event E occurs
10 Poisson Processes Let T R be an interval. A family of random variables {X(t) ; t T} is called a continuous time stochastic process. We often consider T = [0, 1] and T = [0, ). As X(t) is a random variable
More information1 Functions, Graphs and Limits
1 Functions, Graphs and Limits 1.1 The Cartesian Plane In this course we will be dealing a lot with the Cartesian plane (also called the xy-plane), so this section should serve as a review of it and its
More informationUC Berkeley Department of Electrical Engineering and Computer Sciences. EECS 126: Probability and Random Processes
UC Berkeley Department of Electrical Engineering and Computer Sciences EECS 6: Probability and Random Processes Problem Set 3 Spring 9 Self-Graded Scores Due: February 8, 9 Submit your self-graded scores
More informationInference for Stochastic Processes
Inference for Stochastic Processes Robert L. Wolpert Revised: June 19, 005 Introduction A stochastic process is a family {X t } of real-valued random variables, all defined on the same probability space
More informationCS145: Probability & Computing
CS45: Probability & Computing Lecture 5: Concentration Inequalities, Law of Large Numbers, Central Limit Theorem Instructor: Eli Upfal Brown University Computer Science Figure credits: Bertsekas & Tsitsiklis,
More informationDO NOT OPEN THIS QUESTION BOOKLET UNTIL YOU ARE TOLD TO DO SO
QUESTION BOOKLET EE 126 Spring 26 Midterm #2 Thursday, April 13, 11:1-12:3pm DO NOT OPEN THIS QUESTION BOOKLET UNTIL YOU ARE TOLD TO DO SO You have 8 minutes to complete the midterm. The midterm consists
More informationProbability Models. 4. What is the definition of the expectation of a discrete random variable?
1 Probability Models The list of questions below is provided in order to help you to prepare for the test and exam. It reflects only the theoretical part of the course. You should expect the questions
More informationChapter 3 Common Families of Distributions
Lecture 9 on BST 631: Statistical Theory I Kui Zhang, 9/3/8 and 9/5/8 Review for the previous lecture Definition: Several commonly used discrete distributions, including discrete uniform, hypergeometric,
More informationConcentration inequalities and the entropy method
Concentration inequalities and the entropy method Gábor Lugosi ICREA and Pompeu Fabra University Barcelona what is concentration? We are interested in bounding random fluctuations of functions of many
More informationSampling Distributions
Sampling Distributions In statistics, a random sample is a collection of independent and identically distributed (iid) random variables, and a sampling distribution is the distribution of a function of
More informationSolutions to Problem Set 4
UC Berkeley, CS 174: Combinatorics and Discrete Probability (Fall 010 Solutions to Problem Set 4 1. (MU 5.4 In a lecture hall containing 100 people, you consider whether or not there are three people in
More information6.041/6.431 Fall 2010 Quiz 2 Solutions
6.04/6.43: Probabilistic Systems Analysis (Fall 200) 6.04/6.43 Fall 200 Quiz 2 Solutions Problem. (80 points) In this problem: (i) X is a (continuous) uniform random variable on [0, 4]. (ii) Y is an exponential
More informationBell-shaped curves, variance
November 7, 2017 Pop-in lunch on Wednesday Pop-in lunch tomorrow, November 8, at high noon. Please join our group at the Faculty Club for lunch. Means If X is a random variable with PDF equal to f (x),
More informationAPPM/MATH 4/5520 Solutions to Exam I Review Problems. f X 1,X 2. 2e x 1 x 2. = x 2
APPM/MATH 4/5520 Solutions to Exam I Review Problems. (a) f X (x ) f X,X 2 (x,x 2 )dx 2 x 2e x x 2 dx 2 2e 2x x was below x 2, but when marginalizing out x 2, we ran it over all values from 0 to and so
More informationSection Exponential Functions
121 Section 4.1 - Exponential Functions Exponential functions are extremely important in both economics and science. It allows us to discuss the growth of money in a money market account as well as the
More informationUC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Problem Set 4: Solutions Fall 2007
UC Berkeley Department of Electrical Engineering and Computer Science EE 6: Probablity and Random Processes Problem Set 4: Solutions Fall 007 Issued: Thursday, September 0, 007 Due: Friday, September 8,
More informationConditional Distributions
Conditional Distributions The goal is to provide a general definition of the conditional distribution of Y given X, when (X, Y ) are jointly distributed. Let F be a distribution function on R. Let G(,
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 informationProblem 1: (Chernoff Bounds via Negative Dependence - from MU Ex 5.15)
Problem 1: Chernoff Bounds via Negative Dependence - from MU Ex 5.15) While deriving lower bounds on the load of the maximum loaded bin when n balls are thrown in n bins, we saw the use of negative dependence.
More informationReview questions for Math 111 final. Please SHOW your WORK to receive full credit Final Test is based on 150 points
Please SHOW your WORK to receive full credit Final Test is based on 150 points 1. True or False questions (17 pts) a. Common Logarithmic functions cross the y axis at (0,1) b. A square matrix has as many
More informationStatistics 253/317 Introduction to Probability Models. Winter Midterm Exam Monday, Feb 10, 2014
Statistics 253/317 Introduction to Probability Models Winter 2014 - Midterm Exam Monday, Feb 10, 2014 Student Name (print): (a) Do not sit directly next to another student. (b) This is a closed-book, closed-note
More informationHomework 6: Solutions Sid Banerjee Problem 1: (The Flajolet-Martin Counter) ORIE 4520: Stochastics at Scale Fall 2015
Problem 1: (The Flajolet-Martin Counter) In class (and in the prelim!), we looked at an idealized algorithm for finding the number of distinct elements in a stream, where we sampled uniform random variables
More informationCHAPTER 10 RELIABILITY
CHAPTER 10 RELIABILITY Failure rates Reliability Constant failure rate and exponential distribution System Reliability Components in series Components in parallel Combination system 1 Failure Rate Curve
More informationIntroduction to Statistical Data Analysis Lecture 3: Probability Distributions
Introduction to Statistical Data Analysis Lecture 3: Probability Distributions James V. Lambers Department of Mathematics The University of Southern Mississippi James V. Lambers Statistical Data Analysis
More informationChapter 3, 4 Random Variables ENCS Probability and Stochastic Processes. Concordia University
Chapter 3, 4 Random Variables ENCS6161 - Probability and Stochastic Processes Concordia University ENCS6161 p.1/47 The Notion of a Random Variable A random variable X is a function that assigns a real
More informationLecture 7: Chapter 7. Sums of Random Variables and Long-Term Averages
Lecture 7: Chapter 7. Sums of Random Variables and Long-Term Averages ELEC206 Probability and Random Processes, Fall 2014 Gil-Jin Jang gjang@knu.ac.kr School of EE, KNU page 1 / 15 Chapter 7. Sums of Random
More informationSTA 260: Statistics and Probability II
Al Nosedal. University of Toronto. Winter 2017 1 Chapter 7. Sampling Distributions and the Central Limit Theorem If you can t explain it simply, you don t understand it well enough Albert Einstein. Theorem
More informationApril Adkins
Unit # 1 Title: Preliminary Concepts Part I April Adkins 2014-2015 Students will be able to add, subtract, multiply, and divide integers. Students will be able to identify examples of basic properties
More informationSTA 584 Supplementary Examples (not to be graded) Fall, 2003
Page 1 of 8 Central Michigan University Department of Mathematics STA 584 Supplementary Examples (not to be graded) Fall, 003 1. (a) If A and B are independent events, P(A) =.40 and P(B) =.70, find (i)
More informationMoments. Raw moment: February 25, 2014 Normalized / Standardized moment:
Moments Lecture 10: Central Limit Theorem and CDFs Sta230 / Mth 230 Colin Rundel Raw moment: Central moment: µ n = EX n ) µ n = E[X µ) 2 ] February 25, 2014 Normalized / Standardized moment: µ n σ n Sta230
More informationChapter 5. Chapter 5 sections
1 / 43 sections Discrete univariate distributions: 5.2 Bernoulli and Binomial distributions Just skim 5.3 Hypergeometric distributions 5.4 Poisson distributions Just skim 5.5 Negative Binomial distributions
More informationLecture 3. David Aldous. 31 August David Aldous Lecture 3
Lecture 3 David Aldous 31 August 2015 This size-bias effect occurs in other contexts, such as class size. If a small Department offers two courses, with enrollments 90 and 10, then average class (faculty
More informationMath 407: Probability Theory 5/10/ Final exam (11am - 1pm)
Math 407: Probability Theory 5/10/2013 - Final exam (11am - 1pm) Name: USC ID: Signature: 1. Write your name and ID number in the spaces above. 2. Show all your work and circle your final answer. Simplify
More informationLecture 4. David Aldous. 2 September David Aldous Lecture 4
Lecture 4 David Aldous 2 September 2015 The specific examples I m discussing are not so important; the point of these first lectures is to illustrate a few of the 100 ideas from STAT134. Ideas used in
More informationMATH 180A - INTRODUCTION TO PROBABILITY PRACTICE MIDTERM #2 FALL 2018
MATH 8A - INTRODUCTION TO PROBABILITY PRACTICE MIDTERM # FALL 8 Name (Last, First): Student ID: TA: SO AS TO NOT DISTURB OTHER STUDENTS, EVERY- ONE MUST STAY UNTIL THE EXAM IS COMPLETE. ANSWERS TO THE
More informationProbability and Distributions
Probability and Distributions What is a statistical model? A statistical model is a set of assumptions by which the hypothetical population distribution of data is inferred. It is typically postulated
More informationCalculating credit risk capital charges with the one-factor model
Calculating credit risk capital charges with the one-factor model arxiv:cond-mat/0302402v5 [cond-mat.other] 4 Jan 2005 Susanne Emmer Dirk Tasche Dr. Nagler & Company GmbH, Maximilianstraße 47, 80538 München,
More informationMAT 135B Midterm 1 Solutions
MAT 35B Midterm Solutions Last Name (PRINT): First Name (PRINT): Student ID #: Section: Instructions:. Do not open your test until you are told to begin. 2. Use a pen to print your name in the spaces above.
More informationMandelbrot s cascade in a Random Environment
Mandelbrot s cascade in a Random Environment A joint work with Chunmao Huang (Ecole Polytechnique) and Xingang Liang (Beijing Business and Technology Univ) Université de Bretagne-Sud (Univ South Brittany)
More informationMethod of Frobenius. General Considerations. L. Nielsen, Ph.D. Dierential Equations, Fall Department of Mathematics, Creighton University
Method of Frobenius General Considerations L. Nielsen, Ph.D. Department of Mathematics, Creighton University Dierential Equations, Fall 2008 Outline 1 The Dierential Equation and Assumptions 2 3 Main Theorem
More information3 Multiple Discrete Random Variables
3 Multiple Discrete Random Variables 3.1 Joint densities Suppose we have a probability space (Ω, F,P) and now we have two discrete random variables X and Y on it. They have probability mass functions f
More informationAsymptotic Statistics-III. Changliang Zou
Asymptotic Statistics-III Changliang Zou The multivariate central limit theorem Theorem (Multivariate CLT for iid case) Let X i be iid random p-vectors with mean µ and and covariance matrix Σ. Then n (
More informationQuantitative Modeling of Operational Risk: Between g-and-h and EVT
: Between g-and-h and EVT Paul Embrechts Matthias Degen Dominik Lambrigger ETH Zurich (www.math.ethz.ch/ embrechts) Outline Basel II LDA g-and-h Aggregation Conclusion and References What is Basel II?
More informationTom Salisbury
MATH 2030 3.00MW Elementary Probability Course Notes Part V: Independence of Random Variables, Law of Large Numbers, Central Limit Theorem, Poisson distribution Geometric & Exponential distributions Tom
More informationn! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2
Order statistics Ex. 4. (*. Let independent variables X,..., X n have U(0, distribution. Show that for every x (0,, we have P ( X ( < x and P ( X (n > x as n. Ex. 4.2 (**. By using induction or otherwise,
More information1. Use the properties of exponents to simplify the following expression, writing your answer with only positive exponents.
Math120 - Precalculus. Final Review. Fall, 2011 Prepared by Dr. P. Babaali 1 Algebra 1. Use the properties of exponents to simplify the following expression, writing your answer with only positive exponents.
More informationProblem Set 1. MAS 622J/1.126J: Pattern Recognition and Analysis. Due: 5:00 p.m. on September 20
Problem Set MAS 6J/.6J: Pattern Recognition and Analysis Due: 5:00 p.m. on September 0 [Note: All instructions to plot data or write a program should be carried out using Matlab. In order to maintain a
More informationMath 362, Problem set 1
Math 6, roblem set Due //. (4..8) Determine the mean variance of the mean X of a rom sample of size 9 from a distribution having pdf f(x) = 4x, < x
More informationExponential Distribution and Poisson Process
Exponential Distribution and Poisson Process Stochastic Processes - Lecture Notes Fatih Cavdur to accompany Introduction to Probability Models by Sheldon M. Ross Fall 215 Outline Introduction Exponential
More informationAssignment 4. u n+1 n(n + 1) i(i + 1) = n n (n + 1)(n + 2) n(n + 2) + 1 = (n + 1)(n + 2) 2 n + 1. u n (n + 1)(n + 2) n(n + 1) = n
Assignment 4 Arfken 5..2 We have the sum Note that the first 4 partial sums are n n(n + ) s 2, s 2 2 3, s 3 3 4, s 4 4 5 so we guess that s n n/(n + ). Proving this by induction, we see it is true for
More informationModern Discrete Probability Branching processes
Modern Discrete Probability IV - Branching processes Review Sébastien Roch UW Madison Mathematics November 15, 2014 1 Basic definitions 2 3 4 Galton-Watson branching processes I Definition A Galton-Watson
More informationLimiting Distributions
Limiting Distributions We introduce the mode of convergence for a sequence of random variables, and discuss the convergence in probability and in distribution. The concept of convergence leads us to the
More informationSecond Midterm Exam Economics 410 Thurs., April 2, 2009
Second Midterm Exam Economics 410 Thurs., April 2, 2009 Show All Work. Only partial credit will be given for correct answers if we can not figure out how they were derived. Note that we have not put equal
More information1. Find all relations which are functions. 2. Find all one to one functions.
1 PRACTICE PROBLEMS FOR FINAL (1) Function or not (vertical line test or y = x expression) 1. Find all relations which are functions. (A) x + y = (C) y = x (B) y = x 1 x+ (D) y = x 5 x () One to one function
More informationPart IA Probability. Definitions. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015
Part IA Probability Definitions Based on lectures by R. Weber Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after lectures.
More informationMAS113 Introduction to Probability and Statistics. Proofs of theorems
MAS113 Introduction to Probability and Statistics Proofs of theorems Theorem 1 De Morgan s Laws) See MAS110 Theorem 2 M1 By definition, B and A \ B are disjoint, and their union is A So, because m is a
More informationLecture 10. Failure Probabilities and Safety Indexes
Lecture 10. Failure Probabilities and Safety Indexes Igor Rychlik Chalmers Department of Mathematical Sciences Probability, Statistics and Risk, MVE300 Chalmers May 2013 Safety analysis - General setup:
More informationRelationship between probability set function and random variable - 2 -
2.0 Random Variables A rat is selected at random from a cage and its sex is determined. The set of possible outcomes is female and male. Thus outcome space is S = {female, male} = {F, M}. If we let X be
More information) ) = γ. and P ( X. B(a, b) = Γ(a)Γ(b) Γ(a + b) ; (x + y, ) I J}. Then, (rx) a 1 (ry) b 1 e (x+y)r r 2 dxdy Γ(a)Γ(b) D
3 Independent Random Variables II: Examples 3.1 Some functions of independent r.v. s. Let X 1, X 2,... be independent r.v. s with the known distributions. Then, one can compute the distribution of a r.v.
More informationVaR vs. Expected Shortfall
VaR vs. Expected Shortfall Risk Measures under Solvency II Dietmar Pfeifer (2004) Risk measures and premium principles a comparison VaR vs. Expected Shortfall Dependence and its implications for risk measures
More information[Chapter 6. Functions of Random Variables]
[Chapter 6. Functions of Random Variables] 6.1 Introduction 6.2 Finding the probability distribution of a function of random variables 6.3 The method of distribution functions 6.5 The method of Moment-generating
More informationMark Scheme (Results) Summer 2009
Mark (Results) Summer 009 GCE GCE Mathematics (6684/01) June 009 6684 Statistics S Mark Q1 [ X ~ B(0,0.15) ] P(X 6), = 0.8474 awrt 0.847 Y ~ B(60,0.15) Po(9) for using Po(9) P(Y < 1), = 0.8758 awrt 0.876
More informationMath Spring Practice for the final Exam.
Math 4 - Spring 8 - Practice for the final Exam.. Let X, Y, Z be three independnet random variables uniformly distributed on [, ]. Let W := X + Y. Compute P(W t) for t. Honors: Compute the CDF function
More informationSolution: By Markov inequality: P (X > 100) 0.8. By Chebyshev s inequality: P (X > 100) P ( X 80 > 20) 100/20 2 = The second estimate is better.
MA 485-1E, Probability (Dr Chernov) Final Exam Wed, Dec 12, 2001 Student s name Be sure to show all your work. Each problem is 4 points. Full credit will be given for 9 problems (36 points). You are welcome
More informationPROBABILITY DISTRIBUTION
PROBABILITY DISTRIBUTION DEFINITION: If S is a sample space with a probability measure and x is a real valued function defined over the elements of S, then x is called a random variable. Types of Random
More informationOptional Stopping Theorem Let X be a martingale and T be a stopping time such
Plan Counting, Renewal, and Point Processes 0. Finish FDR Example 1. The Basic Renewal Process 2. The Poisson Process Revisited 3. Variants and Extensions 4. Point Processes Reading: G&S: 7.1 7.3, 7.10
More informationLecture 4: September Reminder: convergence of sequences
36-705: Intermediate Statistics Fall 2017 Lecturer: Siva Balakrishnan Lecture 4: September 6 In this lecture we discuss the convergence of random variables. At a high-level, our first few lectures focused
More information0617aii. Algebra II Regents Exam ln 48 x = ln ) x = 0 4) x = ln4 3. ln 2
0617aii 1 The graph of the function p(x) is sketched below. Which equation could represent p(x)? 1) p(x) = (x 9)(x ) 3) p(x) = (x + 9)(x ) ) p(x) = x 3 x + 9x + 18 4) p(x) = x 3 + x 9x 18 What is the solution
More informationSTAT 430/510 Probability Lecture 16, 17: Compute by Conditioning
STAT 430/510 Probability Lecture 16, 17: Compute by Conditioning Pengyuan (Penelope) Wang Lecture 16-17 June 21, 2011 Computing Probability by Conditioning A is an arbitrary event If Y is a discrete random
More informationNotes on Mathematical Expectations and Classes of Distributions Introduction to Econometric Theory Econ. 770
Notes on Mathematical Expectations and Classes of Distributions Introduction to Econometric Theory Econ. 77 Jonathan B. Hill Dept. of Economics University of North Carolina - Chapel Hill October 4, 2 MATHEMATICAL
More informationChapter 2 Functions and Graphs
Chapter 2 Functions and Graphs Section 5 Exponential Functions Objectives for Section 2.5 Exponential Functions The student will be able to graph and identify the properties of exponential functions. The
More informationContinuous RVs. 1. Suppose a random variable X has the following probability density function: π, zero otherwise. f ( x ) = sin x, 0 < x < 2
STAT 4 Exam I Continuous RVs Fall 7 Practice. Suppose a random variable X has the following probability density function: f ( x ) = sin x, < x < π, zero otherwise. a) Find P ( X < 4 π ). b) Find µ = E
More information0617aii. Algebra II Regents Exam ln 2 3 2) x = 0. ln 48 x = ln ) x = ln4 3
067aii The graph of the function p(x) is sketched below. 4 The expression 6xi ( 4xi + ) is equivalent to ) x i ) 4x 0xi ) 4x + 0x i 4) 6x 4x i i Which equation could represent p(x)? ) p(x) = (x 9)(x )
More informationSTAT 479: Short Term Actuarial Models
STAT 479: Short Term Actuarial Models Jianxi Su, FSA, ACIA Purdue University, Department of Statistics Week 1. Some important things about this course you may want to know... The course covers a large
More informationThe Geometric Distribution
MATH 382 The Geometric Distribution Dr. Neal, WKU Suppose we have a fixed probability p of having a success on any single attempt, where p > 0. We continue to make independent attempts until we succeed.
More informationStat 100a, Introduction to Probability.
Stat 100a, Introduction to Probability. Outline for the day: 1. Geometric random variables. 2. Negative binomial random variables. 3. Moment generating functions. 4. Poisson random variables. 5. Continuous
More informationProbability and Measure
Probability and Measure Robert L. Wolpert Institute of Statistics and Decision Sciences Duke University, Durham, NC, USA Convergence of Random Variables 1. Convergence Concepts 1.1. Convergence of Real
More information