Introduction A recursive approach A Gerber Shiu function at claim instants Numerical illustrations Conclusions.

Slides:



Advertisements
Similar presentations
Some additional Topics. Distributions of functions of Random Variables Gamma distribution,  2 distribution, Exponential distribution.
Advertisements

Exponential and Poisson Chapter 5 Material. 2 Poisson Distribution [Discrete] Poisson distribution describes many random processes quite well and is mathematically.
Sequences and Mathematical Induction
Xiutao Feng Institute of Software Chinese Academy of Sciences A Byte-Based Guess and Determine Attack on SOSEMANUK.
N.D.GagunashviliUniversity of Akureyri, Iceland Pearson´s χ 2 Test Modifications for Comparison of Unweighted and Weighted Histograms and Two Weighted.
ECE 8443 – Pattern Recognition ECE 8527 – Introduction to Machine Learning and Pattern Recognition Objectives: Jensen’s Inequality (Special Case) EM Theorem.
Error Measurement and Iterative Methods
Visual Recognition Tutorial
Probability By Zhichun Li.
15. Poisson Processes In Lecture 4, we introduced Poisson arrivals as the limiting behavior of Binomial random variables. (Refer to Poisson approximation.
Probability theory 2011 Outline of lecture 7 The Poisson process  Definitions  Restarted Poisson processes  Conditioning in Poisson processes  Thinning.
C4: DISCRETE RANDOM VARIABLES CIS 2033 based on Dekking et al. A Modern Introduction to Probability and Statistics Longin Jan Latecki.
Chapter 4: Joint and Conditional Distributions
Michael Duquette & Whitney Sherman
11/5/2003Probability and Statistics for Teachers, Math 507, Lecture 10 1 UNIFORM AND EXPONENTIAL RANDOM VARIABLES Sections
Exponential Distribution & Poisson Process
1 Exponential Distribution & Poisson Process Memorylessness & other exponential distribution properties; Poisson process and compound P.P.’s.
Discrete Distributions
Lecture 35 Numerical Analysis. Chapter 7 Ordinary Differential Equations.
Fixed Parameter Complexity Algorithms and Networks.
Short Resume of Statistical Terms Fall 2013 By Yaohang Li, Ph.D.
Functions of Random Variables. Methods for determining the distribution of functions of Random Variables 1.Distribution function method 2.Moment generating.
1 As we have seen in section 4 conditional probability density functions are useful to update the information about an event based on the knowledge about.
CPSC 531: Probability Review1 CPSC 531:Distributions Instructor: Anirban Mahanti Office: ICT Class Location: TRB 101.
Generalized Semi-Markov Processes (GSMP)
Model Inference and Averaging
Chap. 4 Continuous Distributions
Functions of Random Variables. Methods for determining the distribution of functions of Random Variables 1.Distribution function method 2.Moment generating.
Return probabilities for stochastic fluid flows and their use in collective risk theory Andrei Badescu Department of Statistics University of Toronto.
Stochastic Models Lecture 2 Poisson Processes
CIS 2033 based on Dekking et al. A Modern Introduction to Probability and Statistics Michael Baron. Probability and Statistics for Computer Scientists,
1 Queuing Models Dr. Mahmoud Alrefaei 2 Introduction Each one of us has spent a great deal of time waiting in lines. One example in the Cafeteria. Other.
Multiple Random Variables Two Discrete Random Variables –Joint pmf –Marginal pmf Two Continuous Random Variables –Joint Distribution (PDF) –Joint Density.
1 Two Functions of Two Random Variables In the spirit of the previous lecture, let us look at an immediate generalization: Suppose X and Y are two random.
Generalized Semi- Markov Processes (GSMP). Summary Some Definitions The Poisson Process Properties of the Poisson Process  Interarrival times  Memoryless.
DIFFERENTIAL EQUATIONS 10. DIFFERENTIAL EQUATIONS Unfortunately, it’s impossible to solve most differential equations in the sense of obtaining an explicit.
PROBABILITY AND STATISTICS FOR ENGINEERING Hossein Sameti Department of Computer Engineering Sharif University of Technology Two Random Variables.
Bivariate Poisson regression models for automobile insurance pricing Lluís Bermúdez i Morata Universitat de Barcelona IME 2007 Piraeus, July.
PROBABILITY AND STATISTICS FOR ENGINEERING Hossein Sameti Department of Computer Engineering Sharif University of Technology Mean, Variance, Moments and.
SemiBoost : Boosting for Semi-supervised Learning Pavan Kumar Mallapragada, Student Member, IEEE, Rong Jin, Member, IEEE, Anil K. Jain, Fellow, IEEE, and.
Data Modeling Patrice Koehl Department of Biological Sciences National University of Singapore
School of Information Technologies Poisson-1 The Poisson Process Poisson process, rate parameter e.g. packets/second Three equivalent viewpoints of the.
ECE 8443 – Pattern Recognition Objectives: Jensen’s Inequality (Special Case) EM Theorem Proof EM Example – Missing Data Intro to Hidden Markov Models.
Dynamic Programming. A Simple Example Capital as a State Variable.
1 Example 1 Syrup from a 500 liter container of 10% sugar syrup flows into a candy making machine at 2 liters per minute. The vat is kept full by adding.
C4: DISCRETE RANDOM VARIABLES CIS 2033 based on Dekking et al. A Modern Introduction to Probability and Statistics Longin Jan Latecki.
1 6. Mean, Variance, Moments and Characteristic Functions For a r.v X, its p.d.f represents complete information about it, and for any Borel set B on the.
Quiz 5 May , 5.2 Discrete Probability. Quiz 4: May-04 ’ pm In the following experiment we roll a fair die 5 times. a) What is the.
Chapter 2: Probability. Section 2.1: Basic Ideas Definition: An experiment is a process that results in an outcome that cannot be predicted in advance.
CHAPTER- 3.2 ERROR ANALYSIS. 3.3 SPECIFIC ERROR FORMULAS  The expressions of Equations (3.13) and (3.14) were derived for the general relationship of.
ECE 8443 – Pattern Recognition ECE 8527 – Introduction to Machine Learning and Pattern Recognition Objectives: Jensen’s Inequality (Special Case) EM Theorem.
CIS 2033 based on Dekking et al. A Modern Introduction to Probability and Statistics B: Michael Baron. Probability and Statistics for Computer Scientists,
Theory of Computational Complexity M1 Takao Inoshita Iwama & Ito Lab Graduate School of Informatics, Kyoto University.
Mathematics.
Exponential Distribution & Poisson Process
C4: DISCRETE RANDOM VARIABLES
Applied Discrete Mathematics Week 11: Relations
Cumulative distribution functions and expected values
Pertemuan ke-7 s/d ke-10 (minggu ke-4 dan ke-5)
Model Inference and Averaging
LECTURE 10: EXPECTATION MAXIMIZATION (EM)
Use mathematical induction to prove that the formula is true for all natural numbers m. {image} Choose the first step of the proof from the following:
Numerical Analysis Lecture13.
Numerical Analysis Lecture 2.
Cumulative Distribution Function
11. Conditional Density Functions and Conditional Expected Values
11. Conditional Density Functions and Conditional Expected Values
9. Two Functions of Two Random Variables
Introduction to Probability: Solutions for Quizzes 4 and 5
Numerical Methods for solutions of equations
Presentation transcript:

Introduction A recursive approach A Gerber Shiu function at claim instants Numerical illustrations Conclusions

Chan et al. (2003), Dang et al. (2009) - the initial capital of the i-th class of business; - the premium rate of the i-th class of business; - the k-th claim amount in the i-th risk process, with common cdf and pdf ; - the counting process for the i-th risk process. are common shock correlated Poisson processes occurring at rates respectively. where are independent Poisson processes with rates ;

Chan et al. (2003) Cai and Li (2005) Yuen et al. (2006) Li et al. (2007) Dang et al. (2009)

Chan et al. (2003) for Dang et al. (2009)

Let follow independent PH distributions with parameters (α, T) and (β, Q).

is a penalty function that depends on the surplus levels at time T or in both processes. Here are few choices of the penalty functions

Where correspond to the cases {τ 1 <τ 2 }, {τ 2 <τ 1 } and {τ 1 =τ 2 } respectively.

Considering the first case when ruin occurs at the first claim instant in {U 1 (t)} only and using a conditional argument gives By similar method, one immediately has. Hence by adding, we obtain the starting point of recursion. If, and, the three integrals reduce to

The idea that we use to find a computational tractable solution of (16) is based on mathematical induction. Therefore, the expected discounted deficit when ruin happens at the instant of the first claim is given by

Using equation (4) for n=0 and λ 11 =λ 22 =0 along with the trivial condition, we obtain

We denote the survival probability associated to the time of ruin T and, by.

u 1 =2,u 2 =10, c 1 =3.2, c 2 =30, 1/µ 1 =1 and 1/µ 2 =10. Case 1: Independent model — λ 11 =λ 22 =2; λ 12 =0. Case 2: Three-states common shock model — λ 11 =λ 22 =1.5; λ 12 =0.5. Case 3: Three-states common shock model — λ 11 =λ 22 =0.5; λ 12 =1.5. Case 4: One-state common shock model — λ 11 = λ 22 = 0; λ 12 = 2. Note that λ 1 = λ 2 = 2, and θ 1 = 0.6 and θ 2 = 0.5.

In Case 1, after 100 iterations we obtain a ruin probability of that is very close to the exact value of

Cai and Li (2005, 2007) provided simple bounds for Ψ and (u 1, u 2 ) given by

δ = 0.05

This quantity is achieved by letting w 1 (y, z) = y+z and w 2 (.,. ) = w 12 (.,.) =0

This quantity is achieved by letting w 2 (y, z) = y+z and w 1 (.,. ) = w 12 (.,.) =0

Several extensions: 1.Correlated claims 2.Correlated inter-arrival times and the resulting claims 3.Renewal type risk models