Lecture Notes on Risk Theory
|
|
- Jocelyn Lorena Cameron
- 6 years ago
- Views:
Transcription
1 Lecture Notes on Risk Theory February 2, 21
2 Contents 1 Introduction and basic definitions 1 2 Accumulated claims in a fixed time interval 3 3 Reinsurance 7 4 Risk processes in discrete time 1 5 The Adjustment Coefficient 15 6 Some risk processes in continuous time The Sparre Andersen model The compound Poisson model i
3 ii
4 Chapter 1 Introduction and basic definitions An insurance company needs to pay claims from time to time, while collecting premiums from its customers continuously over time. We assume that it starts with an initial (risk reserve u and the premium income is linear with some slope c >. At times T n, n N, a claim occurs. Thus we call T n the nth claim time. Naturally, we assume that T 1 > and T n+1 > T n for n N. The sequence of claim times forms a counting process N = (N t : t, defined by N t := max{n N : T n t}, where we define max :=. This process N is called the claim process. The nth claim size is denoted by U n, n N. Then the insurance company s risk reserve at any time t is given by is given by N t R t = u + c t U k (1.1 where the empty sum is defined as zero, i.e. U k =. Since N t and U k are random, (R t : t is a stochastic process. A typical path looks like figure 1. We see that at time T 4 something special happens: The risk reserve R T4 is negative, implying of course the ruin of the insurance company. Therefore, the stopping time τ(u := min{t : R t } is called the time of ruin. The following questions arise: 1. The only random term on the right hand side of equation 1.1 is the sum Nt U k representing the accumulated claims until time t. We shall study this in chapter 2. 1
5 2. An insurance company wants to insure itself against unusually high amounts of claims in any period. Some general results on this so called reinsurance will be presented in chapter An obvious criterion for the viability of an insurance policy is the ruin probability ψ(u := P(τ(u <. 2
6 Chapter 2 Accumulated claims in a fixed time interval Define X := N t U k for some time t > that shall be fixed throughout this chapter. We assume that the claim sizes U n, n N, are iid and further that N t and all U n are independent. Denote for k N and write p k := P(N t = k δ (x := { 1, x, x < for the distribution function of the Dirac measure on zero. Let Q denote the distribution function of U 1. Further denote the distribution function of the sum of a fixed number of claims by R k (x := P(U U k x for k N and x. In order to obtain R k in terms of Q, we define Q := δ, Q 1 := Q, and Q n+1 (x := x Q n (x ydq(y for n N. The distribution function Q n is called the nth convolutional power of Q. Lemma 2.1 R k = Q k for all k N. 3
7 Proof: For k = 1 the statement holds by definition. The induction step from k to k + 1 is straightforward: R k+1 (x = P(U U k+1 x = = x x P(U U k x ydq(y Q k (x ydq(y = Q k+1 (x by definition by induction hypothesis by conditioning on U k+1 = y Theorem 2.1 P(X x = k= p kq k (x Proof: P(X x = = P(X x, N t = k = k= p k Q k (x k= p k P(X x N t = k k= by definition of X = N t U k and lemma 2.1. With p := 1 p and p k Q := p Q k we can write P(X x = (1 pδ (x + p Q(x for x. The problem remains of course to determine a simple expression for Q(x. This is possible in the following Example 2.1 Assume that N t has a geometric distribution, i.e. p k = (1 pp k for all k N, and Q = Exp(µ. Then Q k = Erl k (µ, with density function f k (x = µ (µxk 1 (k 1! e µx 4
8 for x (proof as an exercise. Further, Q has the density function f(x = p k p µ(µxk 1 (k 1! e µx = = (1 pµe µx = (1 pµe (1 pµx (pµx k 1 (k 1! for all x. Hence Q = Exp((1 pµ and for x. (1 pp k 1 µ (µxk 1 (k 1! e µx = (1 pµe µx e pµx P(X x = (1 pδ (x + p(1 e (1 pµx = 1 pe (1 pµx Theorem 2.2 E(X = E(N t E(U 1 Proof: E(X = E ( Nt U k = p + = E(N t E(U 1 p k E(U U k = p k kµ Theorem 2.3 Var(X = E(N t Var(U 1 + Var(N t E(U 1 2 E(U 2 1 max(e(n t, Var(N t Proof: Var(X = E(X 2 E(X 2 = ( k 2 p k E U n E(N t 2 E(U 1 2 according to theorem 2.2. For the expectation in the first term, we obtain ( k 2 ( k k E U n = E U i U j = E(U i U j Un 2 + E(Un 2 + i j i j 5
9 Since all U n are iid, we arrive at ( k 2 E U n = k E(U1 2 + k(k 1E(U 1 2 Hence Var(X = p k k (E(U 1 2 E(U p k k 2 E(U 1 2 E(N t 2 E(U 1 2 = E(N t Var(U 1 + Var(N t E(U 1 2 The inequality follows from here via E(U 2 1 = Var(U 1 + E(U 1 2. Example 2.2 If N is a Poisson process, then E(N t = Var(N t and Var(X = E(N t E(U
10 Chapter 3 Reinsurance Let X denote the random variable of the accumulated claims after some fixed time t > (e.g. after one year. X is also called the risk at time t. Let F denote the distribution function of X. A reinsurance policy is a function R : R + R + such that R(x x for all x R +. In the event {X = x} the insurance company pays R(x of the claims and the resinsurer pays the rest, x R(x. We assume first that the reinsurance premium is the fair net premium P = P (R = E(X R(X without safety loading. A special reinsurance policy is the stop loss reinsurance at price P, defined as { R x, x M (x = M, x > M where M is the unique solution of M is called the deductible. P = M (x MdF (x Example 3.1 Assume that X F := (1 p δ + p Exp((1 pµ as in example 2.1. Set β := (1 pµ. Then df (x = p βe βx dx for x > and ( P = (x MdF (x = p xβe βx dx M βe βx dx M M 7 M
11 Integration by parts yields for the first integral [ ] x ( 1 e βx + e βx dx = M e βm + 1 M β e βm As the second integral equals e βm, we obtain M P = p 1 β e βm from which the deductible is determined as M = 1 ( β ln P β p Thus the deductible has a meaningful (i.e. positive value if and only if the condition P < p 1 β = E(X holds. This is reasonable, as for larger premiums P > E(X the insurance company would do better to cover the risk itself. Theorem 3.1 For a fixed fair net premium P the stop loss reinsurance yields the smallest variance Var(R(X of all reinsurance policies. Proof: Let R denote any reinsurance policy with fair net premium P. Define P 1 := E(X P = E(R(X and note that P 1 = E(R (X, too. Then Var(R(X + P 2 1 = = M R 2 (xdf (x (R(x M 2 df (x + 2MP 1 M 2 (R(x M 2 df (x + 2MP 1 M 2 Over the range < x < M we obtain for the integrand (R(x M 2 = (M R(x 2 (M x 2 = (M R (x 2 = (R (x M 2 As R (x = M for x > M, we further get Var(R(X+P 2 1 (R (x M 2 df (x+2mp 1 M 2 = Var(R (X+P 2 1 8
12 which implies the statement. Now assume that the reinsurance premium is of the form P (R = E(X R(X + f(var(x R(X where f is some positive increasing function. The term f(var(x R(X is called the safety loading. Theorem 3.2 Given a fixed value V > and the condition Var(R(X = V, the cheapest reinsurance policy R for the premium P is given by R V (x = Var(X x for all x. Remark 3.1 The term cheapest is to be understood in the following sense: After the time period [, t], the insurance company will have to pay the premium P (R to the reinsurer and R(X as its own contribution to cover the accumulated claims. Altogether, the expected amount of this is E(X R(X+f(Var(X R(X+E(R(X = E(X+f(Var(X R(X The goal is to minimise this expectation. Proof: By the above remark it suffices to minimise f(var(x R(X and hence Var(X R(X, as f is increasing. For this we can write Var(X R(X = Var(X + Var(R(X 2 Cov(X, R(X which shows that we need to maximise the covariance Cov(X, R(X. This is achieved by the form R(X = a X for a constant a. Now the condition Var(R(X = V yields V = a 2 V Var(X, i.e. a = Var(X which is the statement. 9
13 Chapter 4 Risk processes in discrete time Let X n denote the accumulated claims in the time interval ]n 1, n], n N (e.g. the nth year. We assume that the random variables X n, n N, are iid. As in chapter 1, the initial reserve and the rate of premium income are denoted by u and c >. The random variable n K n := u + c n is called the risk reserve at time n N. Then the survival probability until time m (with initial reserve u is defined as X k ψ(u, m := P(K n n m Remark 4.1 Let X 1 F. Conditioning on {X 1 = x} yields the recursive formula +c ψ(u, m + 1 = ψ(u + c x, mdf (x for all u > and m N. However, this is in general numerically intractable. The survival probability over infinite time is defined as ψ(u := lim ψ(u, m m Clearly, ψ(u, m is decreasing in m and bounded below by zero, such that the limit ψ(u does exist. If we define Y n := X n c as the net claim in ]n 1, n] and S n := n Y k for all n N, then the Y n are iid (because the X n are so and c is constant and 1
14 thus S := (S n : n N is a random walk. Y n is called the nth increment of the random walk. For technical reasons (needed in the third statement of 4.1, we exclude the trivial case by assuming that P(X n = c < 1, i.e. P(Y n = < 1, for all n N. Theorem 4.1 Let (S n : n N be a random walk with increments Y n. Then E(Y 1 > lim S n = n E(Y 1 < lim S n = n E(Y 1 = lim sup S n =, lim inf n = n n where the implications hold almost certainly, i.e. with probability one. Proof: The first two statements are immediate consequences of the strong law of large numbers. For a proof of the third statement, see Rolski et al. [3], p.234f. We say that the random walk has a positive (resp. negative drift if E(Y 1 > (resp. E(Y 1 <, and that it is oscillating if E(Y 1 =. For the remainder of this chapter we assume a negative drift, i.e. the net profit condition E(X 1 < c. Define M := sup{s n : n N } and note that theorem 4.1 states that M < almost certainly. The crucial connection to our risk process is now the observation ψ(u = P(M u Define the (first strong ascending ladder epoch by ν + := min{n N : S n > } with the understanding that min :=. The random variable ν + is a stopping time with respect to the sequence Y = (Y n : n N, i.e. P(ν + = n Y = P(ν + = n Y 1,..., Y n for all n N. This means we do not need any future information to determine the event {ν + = n}. 11
15 The corresponding random variable { L + S ν +, := ν + < otherwise is called the (first strong ascending ladder height. Denote the distribution function of L + by G + (x := P(L + x and note that may be strictly less than one. G + ( := lim x G + (x = P(L + < Theorem 4.2 If E(Y 1 <, then E(ν + =. Proof: Assume that E(ν + <. Then Wald s lemma (see lemma 4.1 below applies to ( ν + E(L + = E Y n = E(ν + E(Y 1 But E(L + >, while E(ν + > and E(Y 1 <, which leads to a contradiction. Hence E(ν + =. Lemma 4.1 Wald s Lemma Let Y = (Y n : n N be a sequence of iid random variables and assume that E( Y 1 <. Let S be a stopping time for the sequence Y with E(S <. Then ( S E Y n = E(S E(Y 1 Proof: For all n N define the random variables I n := 1 on the set {S n} and I n := else. Then ( S ( S ( E Y n E Y n = E I n Y n = E(I n Y n by monotone convergence, as I n Y n for all n N. Since S is a stopping time for Y, we obtain P(S 1 = 1 and further P(S n Y = 1 P(S n 1 Y = 1 P(S n 1 Y 1,..., Y n 1 12
16 for all n 2. Since the Y n are independent, the equality above implies that I n and Y n are independent, too. This yields E(I n Y n = E(I n E( Y n = P(S n E( Y 1 for all n N. Now the relation P(S n = E(S yields ( S E Y n P(S n E( Y 1 = E(S E( Y 1 < Now we can use dominated convergence to obtain ( S ( E Y n = E I n Y n = E(I n Y n = = E(I n E(Y n P(S n E(Y 1 = E(S E(Y 1 In the case ν + < of a finite ladder epoch, we can define a new random walk starting at (ν +, L + by S = ((S ν + +n L + : n N. As the increments are iid, S is independent from (S 1,..., S ν + and the random walks S and S have the same distribution. Doing this iteratively, we arrive at the following definitions: Let ν + := and ν n+1 + := min{k > ν n + : S k > S ν + n } for all n N, where min :=. The stopping time ν n + is called the nth (strong ascending ladder epoch. Correspondingly, we define the nth (strong ascending ladder height as { L + Sν + n n := S ν +, ν+ n 1 n < otherwise for n N. By construction the ladder heights are iid. Defining now N := max{n N : ν n + < } we obtain the representation M = N L + k Remark 4.2 The net profit condition E(Y 1 < implies that M < almost certainly, see theorem 4.1. Since the (L + k : k N are iid, this entails N < almost certainly. Hence we can conclude that G + ( < 1. 13
17 Theorem 4.3 If E(Y 1 <, then P(M u = (1 p with p := G + ( and (G + k (u = k= k= (1 p p k G k (u G (u := 1 p G+ (u = P(L + u ν + < for all u. Proof: By definition, p = P(ν + <. The construction of the ladder epochs yields P(N = k = P(ν + n < n k, ν + k+1 = = pk (1 p Hence ( N P(M u = P L + n u = ( k (1 p p k P L + n u k= ν+ k < by conditioning on {N = k}. The statement follows with the observation that ( k G k (u = P L + n u < ν+ k Likewise, the ruin probability is given as ψ(u = P(M > u and thus Corollary 4.1 If the net profit condition E(Y 1 < holds, then where ψ(u = G k (u = 1 G k (u. (1 p p k G k (u This corollary is known as Beekman s formula in risk theory and as the Pollaczek Khinchin formula in queueing theory. Exercise 4.1 Show that ψ( = p and lim u ψ(u =. 14
18 Chapter 5 The Adjustment Coefficient Let P denote a probability measure with E(P := xdp (x ], [. Assume that the moment generating function m P (α := e αx dp (x satisfies m P (α < for some α > and lim α s m P (α 1 for s := sup{α > : m P (α < }. Then the solution γ > of m P (γ = 1 is called the adjustment coefficient of P. Remark 5.1 The adjustment coefficient does exist under the given assumptions, because m P ( = 1, m P ( <, and m P (α is strictly convex as m P (α > for all α < s. The number γ is the only positive number such that e γx dp (x is a probability measure. Theorem 5.1 Lundberg inequality Let (Y n : n N denote a sequence of independent random variables with identical distribution P, and define ( { m } ψ(u := P sup Y i : m N > u for u. If E(Y 1 < and γ is the adjustment coefficient of P, then for all u. Proof: Define ψ n (u := i=1 ψ(u e γu { P (sup { m i=1 Y i : m n} > u, u 1, u < 15
19 for all n N. We will show that ψ n (u e γu for all u R by induction on n. Since ψ(u = lim n ψ n (u, this will yield the statement. For u and all n N, the bound holds by definition. Let n = 1 and u >. Then (see exercise below ψ 1 (u = P(Y 1 > u = P(γY 1 > γu e γu E(e γy 1 = e γu Independence of the Y n, n N, yields further ψ n+1 (u = 1 = 1 P (], u] + = 1 ψ n (u y dp (y ψ n (u y dp (y e γ(u y dp (y = e γu ψ n (u y dp (y where the third equality holds by definition of ψ n, the inequality by induction hypothesis, and the last equality by the fact that E(e γy 1 = 1. Exercise 5.1 Show that for any real valued random variable X, a real number a R, and a positive and increasing function f the inequality holds. P(X > a E(f(X f(a Remark 5.2 A distribution P is called heavy tailed if its moment generating function does not exist, i.e. if e αx dp (x does not converge for any α >. If P is heavy tailed, then it does not have an adjustment coefficient and Lundberg s inequality does not apply. 16
20 Chapter 6 Some risk processes in continuous time 6.1 The Sparre Andersen model Our basic assumptions for this chapter are: 1. The claim sizes U n, n N, are iid with common distribution function F. 2. The claim arrival process N is an ordinary renewal process, which means that the inter claim times W n := T n T n 1, n N, with T :=, are iid with common distribution function G. 3. Claim sizes and inter claim times are independent. As in chapter 1, we denote the rate of premium income by c >. Define n Y n := U n cw n and S n := for n N. Then the process S = (S n : n N is a random walk (cf. chapter 4. Since c >, ruin can occur only at claim epochs T n, whence we obtain for the ruin time τ(u = min{t > : R t < } = min{t n : R Tn = u S n < } This implies for the ruin probability ( ψ(u = P M := sup S n > u n N 17 Y k
21 meaning that all results from chapter 4 apply to the Sparre Andersen model. Further results using a random walk analysis can be found in [2]. In order to determine the drift of the random walk S, we observe that E(Y 1 = E(U 1 c E(W 1 < ρ := E(U 1 c E(W 1 < 1 η := 1 ρ 1 = 1 E(U 1 (c E(W 1 E(U 1 > The number η is called the relative safety loading, while ρ is called the system load, a name that originated in queueing theory. The inequality E(U 1 c E(W 1 < is called the net profit condition. Clearly, the random walk S has a negative drift if and only if the net profit condition holds. 6.2 The compound Poisson model This is a special case of the Sparre Andersen model with G(t := 1 e λt for t, where λ >. Thus the claim arrival process N is a Poisson process with intensity λ. Remark 6.1 It can be shown (see Doob [1] that N is necessarily a Poisson process if we postulate the following properties: 1. N = with probability one. 2. N has independent increments, i.e. N t N s and N v N u are independent for all s < t u < v. 3. N has stationary increments, i.e. N s+t N t and N t have the same distribution for all s >. 4. There are no double events. More exactly, we postulate that P(N h 2 = o(h, i.e. 1 h P(N h 2 as h 18
22 Now we derive a (defective renewal equation for the ruin probability ψ(u. Define the complementary distribution function F by F (x := 1 F (x for all x. Theorem 6.1 For any initial reserve u, ψ(u = λ c u F (x dx + λ c ψ(u x F (x dx Proof: We condition on the time T 1 = t of the first claim. As T 1 Exp(λ, we obtain for the survival probability ψ(u = 1 ψ(u ψ(u = = λ c u λe λt +ct e λ c (y u y ψ(u + ct sdf (sdt ψ(y sdf (sdy after the substitution y = u + ct which entails dy = c dt and t = y = u. This shows that the function ψ(x = λ y c e λ c x e λ c y ψ(y sdf (sdy (6.1 is differentiable on x ], [. Denote g(x := x Then the derivative ψ (x is given by ψ (x = d ( λ dx c e λ c x g(x = λ c As g (x = e λ c x x ψ(x sdf (s, we obtain further x e λ c y y ψ(y sdf (sdy. ( λ c e λ c x g(x + e λ c x g (x ψ (x = λ c = λ c ( λ y c e λ c x e λ c y ψ(y sdf (sdy x x e λ c x e λ c x ψ(x sdf (s ( x ψ(x ψ(x sdf (s 19
23 using the representation (6.1. We will determine ψ(u via its derivative as ψ(u ψ( = = λ c ψ (xdx ( The second integral transforms as x= x s= Thus we can write ψ(xdx ψ(x s df (s dx = ψ(u = ψ( + λ c = ψ( + λ c = = = x s= x=s s s= x= x x= x= s= ψ(x sdf (sdx ψ(x s dx df (s ψ(x dx df (s df (s ψ(x dx F (u x ψ(x dx (1 F (u x ψ(x dx ψ(u x F (x dx We can determine ψ( if we let u. Since ψ(u x and F (x as x, we obtain This leads to ψ( = 1 λ c ψ(u = 1 ψ(u = λ c = λ c = λ c completing the proof. u F (x dx λ c F (x dx + λ c F (x dx = 1 λ c E(U 1 F (x dx λ c 2 ψ(u x F (x dx (1 ψ(u x F (x dx ψ(u x F (x dx
24 Exercise 6.1 Show that lim u ψ(u x F (x dx = E(U 1 Remark 6.2 The proof shows further that the system load p = ψ( = λ c E(U 1 = ρ depends on U 1 only by its mean. This is called insensitivity with respect to the shape of F, the distribution of U 1. Remark 6.3 If c depends on λ by c = (1 + ηλe(u 1, then ψ(u is constant in λ. Remark 6.4 The equation in the above theorem 6.1 is called a (defective renewal equation for ψ(u. Theorem 6.2 The Laplace transform of ψ(u is given by L ψ (s := e su ψ(u du = 1 s c λe(u 1 cs λ(1 L F (s where L F (s = e su df (u is the Laplace transform of the claim size distribution. Proof: Using theorem 6.1, we obtain L ψ (s = λ ( e su F (x dx du + c = λ c = λ c F (x + λ c F (x 1 s Isolating L ψ (s yields L ψ (s = λ cs ( u x e su du dx e su e sx F (x e s(u x ψ(u x du dx x ( 1 e sx dx + λ c F (x dx ψ(u x F (x dx du e sx F (xlψ (s dx ( e sx F (x dx 1 λ c 21 e sx F (x dx 1
25 Integration by parts yields whence we obtain L ψ (s = λ cs e sx F (x dx = 1 s e sx F (x dx = 1 s + [ 1 s e sx F (x = 1 s (1 L F (s ] 1 s e sx df (x ( E(U 1 1 ( s (1 L F (s 1 λ 1 cs (1 L F (s = λe(u 1 λ s (1 L F (s cs λ(1 L F (s = 1 s c λe(u 1 cs λ(1 L F (s Example 6.1 If U 1 Exp(µ, then L F (s = µ (µ + s 1 and L ψ (s = λ λ(1 µ µ s µ+s cs λ(1 µ = µ+s λ λ µ µ+s cs λs µ+s = λs µ (s (cµ + cs λ 1 = λ µc = λ µc e su e (µ λ/cu du Now uniqueness of the Laplace transform yields λ(µ+s λ µ = cs(µ + s λs (µ λc 1 + s for u. ψ(u = λ µc e (µ λ/cu 22
26 Bibliography [1] J. Doob. Stochastic processes. New York: Wiley, [2] S. M. Pitts and K. Politis. The joint density of the surplus before and after ruin in the Sparre Andersen model. J. Appl. Prob., 44: , 27. [3] T. Rolski, H. Schmidli, V. Schmidt, and J. Teugels. Stochastic Processes for Insurance and Finance. Wiley, Chichester etc.,
A Note On The Erlang(λ, n) Risk Process
A Note On The Erlangλ, n) Risk Process Michael Bamberger and Mario V. Wüthrich Version from February 4, 2009 Abstract We consider the Erlangλ, n) risk process with i.i.d. exponentially distributed claims
More informationReinsurance and ruin problem: asymptotics in the case of heavy-tailed claims
Reinsurance and ruin problem: asymptotics in the case of heavy-tailed claims Serguei Foss Heriot-Watt University, Edinburgh Karlovasi, Samos 3 June, 2010 (Joint work with Tomasz Rolski and Stan Zachary
More informationUniversity Of Calgary Department of Mathematics and Statistics
University Of Calgary Department of Mathematics and Statistics Hawkes Seminar May 23, 2018 1 / 46 Some Problems in Insurance and Reinsurance Mohamed Badaoui Department of Electrical Engineering National
More informationPoisson Processes. Stochastic Processes. Feb UC3M
Poisson Processes Stochastic Processes UC3M Feb. 2012 Exponential random variables A random variable T has exponential distribution with rate λ > 0 if its probability density function can been written
More informationAnalysis of the ruin probability using Laplace transforms and Karamata Tauberian theorems
Analysis of the ruin probability using Laplace transforms and Karamata Tauberian theorems Corina Constantinescu and Enrique Thomann Abstract The classical result of Cramer-Lundberg states that if the rate
More informationPractical approaches to the estimation of the ruin probability in a risk model with additional funds
Modern Stochastics: Theory and Applications (204) 67 80 DOI: 05559/5-VMSTA8 Practical approaches to the estimation of the ruin probability in a risk model with additional funds Yuliya Mishura a Olena Ragulina
More informationUpper Bounds for the Ruin Probability in a Risk Model With Interest WhosePremiumsDependonthe Backward Recurrence Time Process
Λ4flΛ4» ν ff ff χ Vol.4, No.4 211 8fl ADVANCES IN MATHEMATICS Aug., 211 Upper Bounds for the Ruin Probability in a Risk Model With Interest WhosePremiumsDependonthe Backward Recurrence Time Process HE
More informationCharacterizations on Heavy-tailed Distributions by Means of Hazard Rate
Acta Mathematicae Applicatae Sinica, English Series Vol. 19, No. 1 (23) 135 142 Characterizations on Heavy-tailed Distributions by Means of Hazard Rate Chun Su 1, Qi-he Tang 2 1 Department of Statistics
More informationAsymptotics of random sums of heavy-tailed negatively dependent random variables with applications
Asymptotics of random sums of heavy-tailed negatively dependent random variables with applications Remigijus Leipus (with Yang Yang, Yuebao Wang, Jonas Šiaulys) CIRM, Luminy, April 26-30, 2010 1. Preliminaries
More informationMeasuring the effects of reinsurance by the adjustment coefficient in the Sparre Anderson model
Measuring the effects of reinsurance by the adjustment coefficient in the Sparre Anderson model Centeno, Maria de Lourdes CEMAPRE, ISEG, Technical University of Lisbon and Centre for Actuarial Studies,
More informationModelling the risk process
Modelling the risk process Krzysztof Burnecki Hugo Steinhaus Center Wroc law University of Technology www.im.pwr.wroc.pl/ hugo Modelling the risk process 1 Risk process If (Ω, F, P) is a probability space
More informationStability of the Defect Renewal Volterra Integral Equations
19th International Congress on Modelling and Simulation, Perth, Australia, 12 16 December 211 http://mssanz.org.au/modsim211 Stability of the Defect Renewal Volterra Integral Equations R. S. Anderssen,
More informationRare Events in Random Walks and Queueing Networks in the Presence of Heavy-Tailed Distributions
Rare Events in Random Walks and Queueing Networks in the Presence of Heavy-Tailed Distributions Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk The University of
More informationACM 116: Lectures 3 4
1 ACM 116: Lectures 3 4 Joint distributions The multivariate normal distribution Conditional distributions Independent random variables Conditional distributions and Monte Carlo: Rejection sampling Variance
More informationAsymptotics of the Finite-time Ruin Probability for the Sparre Andersen Risk. Model Perturbed by an Inflated Stationary Chi-process
Asymptotics of the Finite-time Ruin Probability for the Sparre Andersen Risk Model Perturbed by an Inflated Stationary Chi-process Enkelejd Hashorva and Lanpeng Ji Abstract: In this paper we consider the
More informationA polynomial expansion to approximate ruin probabilities
A polynomial expansion to approximate ruin probabilities P.O. Goffard 1 X. Guerrault 2 S. Loisel 3 D. Pommerêt 4 1 Axa France - Institut de mathématiques de Luminy Université de Aix-Marseille 2 Axa France
More informationFinite-time Ruin Probability of Renewal Model with Risky Investment and Subexponential Claims
Proceedings of the World Congress on Engineering 29 Vol II WCE 29, July 1-3, 29, London, U.K. Finite-time Ruin Probability of Renewal Model with Risky Investment and Subexponential Claims Tao Jiang Abstract
More informationDistribution of the first ladder height of a stationary risk process perturbed by α-stable Lévy motion
Insurance: Mathematics and Economics 28 (21) 13 2 Distribution of the first ladder height of a stationary risk process perturbed by α-stable Lévy motion Hanspeter Schmidli Laboratory of Actuarial Mathematics,
More information4 Sums of Independent Random Variables
4 Sums of Independent Random Variables Standing Assumptions: Assume throughout this section that (,F,P) is a fixed probability space and that X 1, X 2, X 3,... are independent real-valued random variables
More informationELEMENTS OF PROBABILITY THEORY
ELEMENTS OF PROBABILITY THEORY Elements of Probability Theory A collection of subsets of a set Ω is called a σ algebra if it contains Ω and is closed under the operations of taking complements and countable
More informationRenewal processes and Queues
Renewal processes and Queues Last updated by Serik Sagitov: May 6, 213 Abstract This Stochastic Processes course is based on the book Probabilities and Random Processes by Geoffrey Grimmett and David Stirzaker.
More informationOn Finite-Time Ruin Probabilities in a Risk Model Under Quota Share Reinsurance
Applied Mathematical Sciences, Vol. 11, 217, no. 53, 269-2629 HIKARI Ltd, www.m-hikari.com https://doi.org/1.12988/ams.217.7824 On Finite-Time Ruin Probabilities in a Risk Model Under Quota Share Reinsurance
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 informationPoint Process Control
Point Process Control The following note is based on Chapters I, II and VII in Brémaud s book Point Processes and Queues (1981). 1 Basic Definitions Consider some probability space (Ω, F, P). A real-valued
More informationIf g is also continuous and strictly increasing on J, we may apply the strictly increasing inverse function g 1 to this inequality to get
18:2 1/24/2 TOPIC. Inequalities; measures of spread. This lecture explores the implications of Jensen s inequality for g-means in general, and for harmonic, geometric, arithmetic, and related means in
More informationSolution for Problem 7.1. We argue by contradiction. If the limit were not infinite, then since τ M (ω) is nondecreasing we would have
362 Problem Hints and Solutions sup g n (ω, t) g(ω, t) sup g(ω, s) g(ω, t) µ n (ω). t T s,t: s t 1/n By the uniform continuity of t g(ω, t) on [, T], one has for each ω that µ n (ω) as n. Two applications
More informationResearch Reports on Mathematical and Computing Sciences
ISSN 1342-2804 Research Reports on Mathematical and Computing Sciences Long-tailed degree distribution of a random geometric graph constructed by the Boolean model with spherical grains Naoto Miyoshi,
More information1 Presessional Probability
1 Presessional Probability Probability theory is essential for the development of mathematical models in finance, because of the randomness nature of price fluctuations in the markets. This presessional
More informationChapter 2. Poisson Processes. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan
Chapter 2. Poisson Processes Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan Outline Introduction to Poisson Processes Definition of arrival process Definition
More informationWorst-Case-Optimal Dynamic Reinsurance for Large Claims
Worst-Case-Optimal Dynamic Reinsurance for Large Claims by Olaf Menkens School of Mathematical Sciences Dublin City University (joint work with Ralf Korn and Mogens Steffensen) LUH-Kolloquium Versicherungs-
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 information(A n + B n + 1) A n + B n
344 Problem Hints and Solutions Solution for Problem 2.10. To calculate E(M n+1 F n ), first note that M n+1 is equal to (A n +1)/(A n +B n +1) with probability M n = A n /(A n +B n ) and M n+1 equals
More informationMultivariate Risk Processes with Interacting Intensities
Multivariate Risk Processes with Interacting Intensities Nicole Bäuerle (joint work with Rudolf Grübel) Luminy, April 2010 Outline Multivariate pure birth processes Multivariate Risk Processes Fluid Limits
More informationRuin probabilities in multivariate risk models with periodic common shock
Ruin probabilities in multivariate risk models with periodic common shock January 31, 2014 3 rd Workshop on Insurance Mathematics Universite Laval, Quebec, January 31, 2014 Ruin probabilities in multivariate
More informationNon-Life Insurance: Mathematics and Statistics
ETH Zürich, D-MATH HS 08 Prof. Dr. Mario V. Wüthrich Coordinator Andrea Gabrielli Non-Life Insurance: Mathematics and Statistics Solution sheet 9 Solution 9. Utility Indifference Price (a) Suppose that
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 informationNonlife Actuarial Models. Chapter 5 Ruin Theory
Nonlife Actuarial Models Chapter 5 Ruin Theory Learning Objectives 1. Surplus function, premium rate and loss process 2. Probability of ultimate ruin 3. Probability of ruin before a finite time 4. Adjustment
More informationM/G/1 and Priority Queueing
M/G/1 and Priority Queueing Richard T. B. Ma School of Computing National University of Singapore CS 5229: Advanced Compute Networks Outline PASTA M/G/1 Workload and FIFO Delay Pollaczek Khinchine Formula
More informationRuin Probabilities of a Discrete-time Multi-risk Model
Ruin Probabilities of a Discrete-time Multi-risk Model Andrius Grigutis, Agneška Korvel, Jonas Šiaulys Faculty of Mathematics and Informatics, Vilnius University, Naugarduko 4, Vilnius LT-035, Lithuania
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 informationNEW FRONTIERS IN APPLIED PROBABILITY
J. Appl. Prob. Spec. Vol. 48A, 209 213 (2011) Applied Probability Trust 2011 NEW FRONTIERS IN APPLIED PROBABILITY A Festschrift for SØREN ASMUSSEN Edited by P. GLYNN, T. MIKOSCH and T. ROLSKI Part 4. Simulation
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 informationSOLUTION FOR HOMEWORK 11, ACTS 4306
SOLUTION FOR HOMEWORK, ACTS 36 Welcome to your th homework. This is a collection of transformation, Central Limit Theorem (CLT), and other topics.. Solution: By definition of Z, Var(Z) = Var(3X Y.5). We
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 informationThe finite-time Gerber-Shiu penalty function for two classes of risk processes
The finite-time Gerber-Shiu penalty function for two classes of risk processes July 10, 2014 49 th Actuarial Research Conference University of California, Santa Barbara, July 13 July 16, 2014 The finite
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 informationAn Analysis of the Preemptive Repeat Queueing Discipline
An Analysis of the Preemptive Repeat Queueing Discipline Tony Field August 3, 26 Abstract An analysis of two variants of preemptive repeat or preemptive repeat queueing discipline is presented: one in
More informationThe Distributions of Stopping Times For Ordinary And Compound Poisson Processes With Non-Linear Boundaries: Applications to Sequential Estimation.
The Distributions of Stopping Times For Ordinary And Compound Poisson Processes With Non-Linear Boundaries: Applications to Sequential Estimation. Binghamton University Department of Mathematical Sciences
More informationµ X (A) = P ( X 1 (A) )
1 STOCHASTIC PROCESSES This appendix provides a very basic introduction to the language of probability theory and stochastic processes. We assume the reader is familiar with the general measure and integration
More informationModèles de dépendance entre temps inter-sinistres et montants de sinistre en théorie de la ruine
Séminaire de Statistiques de l'irma Modèles de dépendance entre temps inter-sinistres et montants de sinistre en théorie de la ruine Romain Biard LMB, Université de Franche-Comté en collaboration avec
More information1 Poisson processes, and Compound (batch) Poisson processes
Copyright c 2007 by Karl Sigman 1 Poisson processes, and Compound (batch) Poisson processes 1.1 Point Processes Definition 1.1 A simple point process ψ = {t n : n 1} is a sequence of strictly increasing
More informationON THE MOMENTS OF ITERATED TAIL
ON THE MOMENTS OF ITERATED TAIL RADU PĂLTĂNEA and GHEORGHIŢĂ ZBĂGANU The classical distribution in ruins theory has the property that the sequence of the first moment of the iterated tails is convergent
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 informationABC methods for phase-type distributions with applications in insurance risk problems
ABC methods for phase-type with applications problems Concepcion Ausin, Department of Statistics, Universidad Carlos III de Madrid Joint work with: Pedro Galeano, Universidad Carlos III de Madrid Simon
More informationMAS223 Statistical Inference and Modelling Exercises
MAS223 Statistical Inference and Modelling Exercises The exercises are grouped into sections, corresponding to chapters of the lecture notes Within each section exercises are divided into warm-up questions,
More informationDefinition: Lévy Process. Lectures on Lévy Processes and Stochastic Calculus, Braunschweig, Lecture 2: Lévy Processes. Theorem
Definition: Lévy Process Lectures on Lévy Processes and Stochastic Calculus, Braunschweig, Lecture 2: Lévy Processes David Applebaum Probability and Statistics Department, University of Sheffield, UK July
More informationUniversal examples. Chapter The Bernoulli process
Chapter 1 Universal examples 1.1 The Bernoulli process First description: Bernoulli random variables Y i for i = 1, 2, 3,... independent with P [Y i = 1] = p and P [Y i = ] = 1 p. Second description: Binomial
More informationOther properties of M M 1
Other properties of M M 1 Přemysl Bejda premyslbejda@gmail.com 2012 Contents 1 Reflected Lévy Process 2 Time dependent properties of M M 1 3 Waiting times and queue disciplines in M M 1 Contents 1 Reflected
More information1. Stochastic Processes and filtrations
1. Stochastic Processes and 1. Stoch. pr., A stochastic process (X t ) t T is a collection of random variables on (Ω, F) with values in a measurable space (S, S), i.e., for all t, In our case X t : Ω S
More informationUpper and lower bounds for ruin probability
Upper and lower bounds for ruin probability E. Pancheva,Z.Volkovich and L.Morozensky 3 Institute of Mathematics and Informatics, the Bulgarian Academy of Sciences, 3 Sofia, Bulgaria pancheva@math.bas.bg
More informationClass 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis.
Service Engineering Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis. G/G/1 Queue: Virtual Waiting Time (Unfinished Work). GI/GI/1: Lindley s Equations
More informationQualifying Exam CS 661: System Simulation Summer 2013 Prof. Marvin K. Nakayama
Qualifying Exam CS 661: System Simulation Summer 2013 Prof. Marvin K. Nakayama Instructions This exam has 7 pages in total, numbered 1 to 7. Make sure your exam has all the pages. This exam will be 2 hours
More information1 IEOR 6712: Notes on Brownian Motion I
Copyright c 005 by Karl Sigman IEOR 67: Notes on Brownian Motion I We present an introduction to Brownian motion, an important continuous-time stochastic process that serves as a continuous-time analog
More informationIEOR 6711, HMWK 5, Professor Sigman
IEOR 6711, HMWK 5, Professor Sigman 1. Semi-Markov processes: Consider an irreducible positive recurrent discrete-time Markov chain {X n } with transition matrix P (P i,j ), i, j S, and finite state space.
More informationExtremes and ruin of Gaussian processes
International Conference on Mathematical and Statistical Modeling in Honor of Enrique Castillo. June 28-30, 2006 Extremes and ruin of Gaussian processes Jürg Hüsler Department of Math. Statistics, University
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 information2905 Queueing Theory and Simulation PART III: HIGHER DIMENSIONAL AND NON-MARKOVIAN QUEUES
295 Queueing Theory and Simulation PART III: HIGHER DIMENSIONAL AND NON-MARKOVIAN QUEUES 16 Queueing Systems with Two Types of Customers In this section, we discuss queueing systems with two types of customers.
More informationResearch Reports on Mathematical and Computing Sciences
ISSN 134-84 Research Reports on Mathematical and Computing Sciences Subexponential interval graphs generated by immigration-death processes Naoto Miyoshi, Mario Ogura, Taeya Shigezumi and Ryuhei Uehara
More informationLecture 10: Semi-Markov Type Processes
Lecture 1: Semi-Markov Type Processes 1. Semi-Markov processes (SMP) 1.1 Definition of SMP 1.2 Transition probabilities for SMP 1.3 Hitting times and semi-markov renewal equations 2. Processes with semi-markov
More informationSelected Exercises on Expectations and Some Probability Inequalities
Selected Exercises on Expectations and Some Probability Inequalities # If E(X 2 ) = and E X a > 0, then P( X λa) ( λ) 2 a 2 for 0 < λ
More informationOn lower limits and equivalences for distribution tails of randomly stopped sums 1
On lower limits and equivalences for distribution tails of randomly stopped sums 1 D. Denisov, 2 S. Foss, 3 and D. Korshunov 4 Eurandom, Heriot-Watt University and Sobolev Institute of Mathematics Abstract
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 Notes 3 Convergence (Chapter 5)
Lecture Notes 3 Convergence (Chapter 5) 1 Convergence of Random Variables Let X 1, X 2,... be a sequence of random variables and let X be another random variable. Let F n denote the cdf of X n and let
More informationFiltrations, Markov Processes and Martingales. Lectures on Lévy Processes and Stochastic Calculus, Braunschweig, Lecture 3: The Lévy-Itô Decomposition
Filtrations, Markov Processes and Martingales Lectures on Lévy Processes and Stochastic Calculus, Braunschweig, Lecture 3: The Lévy-Itô Decomposition David pplebaum Probability and Statistics Department,
More informationNecessary and sucient condition for the boundedness of the Gerber-Shiu function in dependent Sparre Andersen model
Miskolc Mathematical Notes HU e-issn 1787-2413 Vol. 15 (214), No 1, pp. 159-17 OI: 1.18514/MMN.214.757 Necessary and sucient condition for the boundedness of the Gerber-Shiu function in dependent Sparre
More informationFormulas for probability theory and linear models SF2941
Formulas for probability theory and linear models SF2941 These pages + Appendix 2 of Gut) are permitted as assistance at the exam. 11 maj 2008 Selected formulae of probability Bivariate probability Transforms
More information1 Generating functions
1 Generating functions Even quite straightforward counting problems can lead to laborious and lengthy calculations. These are greatly simplified by using generating functions. 2 Definition 1.1. Given a
More informationCDA5530: Performance Models of Computers and Networks. Chapter 3: Review of Practical
CDA5530: Performance Models of Computers and Networks Chapter 3: Review of Practical Stochastic Processes Definition Stochastic ti process X = {X(t), t T} is a collection of random variables (rvs); one
More informationOptimal Reinsurance Strategy with Bivariate Pareto Risks
University of Wisconsin Milwaukee UWM Digital Commons Theses and Dissertations May 2014 Optimal Reinsurance Strategy with Bivariate Pareto Risks Evelyn Susanne Gaus University of Wisconsin-Milwaukee Follow
More information1 Delayed Renewal Processes: Exploiting Laplace Transforms
IEOR 6711: Stochastic Models I Professor Whitt, Tuesday, October 22, 213 Renewal Theory: Proof of Blackwell s theorem 1 Delayed Renewal Processes: Exploiting Laplace Transforms The proof of Blackwell s
More informationPoisson random measure: motivation
: motivation The Lévy measure provides the expected number of jumps by time unit, i.e. in a time interval of the form: [t, t + 1], and of a certain size Example: ν([1, )) is the expected number of jumps
More informationIDLE PERIODS FOR THE FINITE G/M/1 QUEUE AND THE DEFICIT AT RUIN FOR A CASH RISK MODEL WITH CONSTANT DIVIDEND BARRIER
IDLE PERIODS FOR THE FINITE G/M/1 QUEUE AND THE DEFICIT AT RUIN FOR A CASH RISK MODEL WITH CONSTANT DIVIDEND BARRIER Andreas Löpker & David Perry December 17, 28 Abstract We consider a G/M/1 queue with
More informationMartingale Theory for Finance
Martingale Theory for Finance Tusheng Zhang October 27, 2015 1 Introduction 2 Probability spaces and σ-fields 3 Integration with respect to a probability measure. 4 Conditional expectation. 5 Martingales.
More informationCDA6530: Performance Models of Computers and Networks. Chapter 3: Review of Practical Stochastic Processes
CDA6530: Performance Models of Computers and Networks Chapter 3: Review of Practical Stochastic Processes Definition Stochastic process X = {X(t), t2 T} is a collection of random variables (rvs); one rv
More informationE[X n ]= dn dt n M X(t). ). What is the mgf? Solution. Found this the other day in the Kernel matching exercise: 1 M X (t) =
Chapter 7 Generating functions Definition 7.. Let X be a random variable. The moment generating function is given by M X (t) =E[e tx ], provided that the expectation exists for t in some neighborhood of
More information3 Conditional Expectation
3 Conditional Expectation 3.1 The Discrete case Recall that for any two events E and F, the conditional probability of E given F is defined, whenever P (F ) > 0, by P (E F ) P (E)P (F ). P (F ) Example.
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.1 (*. Let independent variables X 1,..., X n have U(0, 1 distribution. Show that for every x (0, 1, we have P ( X (1 < x 1 and P ( X (n > x 1 as n. Ex. 4.2 (**. By using induction
More informationP (A G) dp G P (A G)
First homework assignment. Due at 12:15 on 22 September 2016. Homework 1. We roll two dices. X is the result of one of them and Z the sum of the results. Find E [X Z. Homework 2. Let X be a r.v.. Assume
More informationQuantile-quantile plots and the method of peaksover-threshold
Problems in SF2980 2009-11-09 12 6 4 2 0 2 4 6 0.15 0.10 0.05 0.00 0.05 0.10 0.15 Figure 2: qqplot of log-returns (x-axis) against quantiles of a standard t-distribution with 4 degrees of freedom (y-axis).
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 information3. Poisson Processes (12/09/12, see Adult and Baby Ross)
3. Poisson Processes (12/09/12, see Adult and Baby Ross) Exponential Distribution Poisson Processes Poisson and Exponential Relationship Generalizations 1 Exponential Distribution Definition: The continuous
More informationRare event simulation for the ruin problem with investments via importance sampling and duality
Rare event simulation for the ruin problem with investments via importance sampling and duality Jerey Collamore University of Copenhagen Joint work with Anand Vidyashankar (GMU) and Guoqing Diao (GMU).
More informationX n D X lim n F n (x) = F (x) for all x C F. lim n F n(u) = F (u) for all u C F. (2)
14:17 11/16/2 TOPIC. Convergence in distribution and related notions. This section studies the notion of the so-called convergence in distribution of real random variables. This is the kind of convergence
More informationTHE VARIANCE CONSTANT FOR THE ACTUAL WAITING TIME OF THE PH/PH/1 QUEUE. By Mogens Bladt National University of Mexico
The Annals of Applied Probability 1996, Vol. 6, No. 3, 766 777 THE VARIANCE CONSTANT FOR THE ACTUAL WAITING TIME OF THE PH/PH/1 QUEUE By Mogens Bladt National University of Mexico In this paper we consider
More informationRare-Event Simulation
Rare-Event Simulation Background: Read Chapter 6 of text. 1 Why is Rare-Event Simulation Challenging? Consider the problem of computing α = P(A) when P(A) is small (i.e. rare ). The crude Monte Carlo estimator
More informationWe will briefly look at the definition of a probability space, probability measures, conditional probability and independence of probability events.
1 Probability 1.1 Probability spaces We will briefly look at the definition of a probability space, probability measures, conditional probability and independence of probability events. Definition 1.1.
More informationStat410 Probability and Statistics II (F16)
Stat4 Probability and Statistics II (F6 Exponential, Poisson and Gamma Suppose on average every /λ hours, a Stochastic train arrives at the Random station. Further we assume the waiting time between two
More informationarxiv: v1 [math.pr] 7 Aug 2014
A Correction Term for the Covariance of Renewal-Reward Processes with Multivariate Rewards Brendan Patch, Yoni Nazarathy, and Thomas Taimre. August 18, 218 arxiv:148.153v1 [math.pr] 7 Aug 214 Abstract
More informationA Dynamic Contagion Process with Applications to Finance & Insurance
A Dynamic Contagion Process with Applications to Finance & Insurance Angelos Dassios Department of Statistics London School of Economics Angelos Dassios, Hongbiao Zhao (LSE) A Dynamic Contagion Process
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 information