• No results found

Polya-Aeppli Noncentral Chi-Square Process and its Applications in Risk Analysis

N/A
N/A
Protected

Academic year: 2021

Share "Polya-Aeppli Noncentral Chi-Square Process and its Applications in Risk Analysis"

Copied!
9
0
0

Loading.... (view fulltext now)

Full text

(1)

1903 K.K. Jose

1

, IJMCR Volume 06 Issue 08 August 2018

International Journal of Mathematics and Computer Science

ISSN: 2320-7167

Volume 06 Issue 08 August-2018, Page no. - 1903-1911 Index Copernicus ICV: 57.55

DOI: 10.31142/ijmcr/v6i8.01

Polya-Aeppli Noncentral Chi-Square Process and its Applications in Risk Analysis

K.K. Jose

1

, Shalitha Jacob

2

1,2

Department of Statistics, St. Thomas College, Pala, Arunapuram, Mahatma Gandhi University, Kottayam, Kerala,India-686574

ARTICLE INFO ABSTRACT Published Online:

18 August 2018

Corresponding Author:

K.K. Jose

In this paper we introduce Polya-Aeppli non-central chi-square process as a mixed Polya-Aeppli process with mixing random variable having non-central chi-square distribution. We derive expression for PMF and discuss several properties. We consider a risk model with Polya-Aeppli non-central chi- square process as the counting process. The joint distribution of the time to ruin and deficit at the time of ruin is derived. The differential equation of the ruin probability is given. As example, we consider the case of exponentially distributed claims.

KEYWORDS: Polya-Aeppli noncentral chi-square process, Ruin probability.

1 Introduction

Polya-Aeppli process was introduced by Minkova(2004) as a compound Poisson process with geometric compounding distribution. It is a generalization of homogeneous Poisson process and is used to model over-dispersed count data. In order to allow a for lack of homogeneity, some random variation is introduced in the parameter  (see Minkova(2013))of Polya-Aeppli process. This leads to the notion of a mixed Polya-Aeppli process. It is a modification of Polya-Aeppli process. One reason of the interest on these mixed Polya-Aeppli process lies on the fact that they are over-dispersed relative to Polya-Aeppli process and offer more flexibility than Polya-Aeppli process.

Recently, many researchers used mixed Polya- Aeppli process as a claim counting process in risk modeling.

I-Polya process was introduced by Minkova (2011) as a mixed Polya-Aeppli process with gamma mixing

distribution. It is a generalization of the classical Polya process. Lazarova and Minkova(2015) studied Polya-Aeppli process with shifted gamma mixing distribution and called it I-Delaporate process. If  = 0 , I-Delaporate process reduces to Delaporate process.

In this study we, introduce a new mixed Polya-Aeppli distribution which is called the Polya-Aeppli non-central chi-square distribution. It is a mixture of Polya-Aeppli distribution by mixing the Polya-Aeppli distribution and non-central chi-square distribution. Then we define a counting process with Polya-Aeppli non-central chi-square distribution and consider the risk model with Polya-Aeppli non-central chi-square counting process . The motivation behind to make a choice of non-central chi-square distribution as the mixing distribution is that it can view as a Poisson mixture of certain gamma distribution and it has various financial applications.

2. Preliminary Results

The Polya-Aeppli distribution with parameters  and  is specified by the PMF:

 1,2,

=

! , )]

(1 [ 1

= 1

0

= ,

= )

= (

1

=

i m i

e m m e m N P

i m m i

i

 

 

 

The PGF of Polya-Aeppli distribution is given by

The factorial moment of order k of Polya-Aeppli distribution is given by

) (1

) (1

1

( ) =

s

s

e

s

(2)

1904 K.K. Jose

1

, IJMCR Volume 06 Issue 08 August 2018

! . ) 1 (

! 1

) (1

= 1

1

= )

(

j

j

k k

j k j

k

j k k



 

 (1) For a thorough discussion of Polya-Aeppli distribution, see Johnson et al.(2005) and Minkova (2002).

The non-central chi-square distribution with r degrees of freedom and non-centrality parameter  is denoted with PDF:

0

>

,

! 2 ) ( 2 2

2 ) (

= ) (

2 2

2 1 2 2

) (

0

=

x k k

r x e

x

f

r k

k r k x

k

 

The Laplace transform of non-central chi-square distribution(see Johnson and Kotz (2010)) given by

 

1 . )

2 (1

= )

~ (

2 2 (1 2 ) 1

s

r

e t s

f

(2) This is the convolution of a gamma and a compound Poisson distribution.

Throughout this study, we will use the Confluent Hypergeometric function defined by,

! ,

= ) , ,

(

( )

) (

0

=

b n

z z a

b a

M

n

n n

n

where a

(n)

= a ( a  1)  ( an  1).

3. Polya-Aeppli Non-central Chi-square Distribution

Definition 3.1. 1 A random variable N has a Polya-Aeppli non-central chi-square (  ,  , r ) distribution when the following conditions satisfy:

), , ( and

) , (

|

r chisquare Noncentral

Aeppli Polya

N

~

~ 

We denote unconditional distribution of N by PANC (  ,  , r ) and its PMF is given by

. 1,2,

= , 2 )

, (

6 ) 2 , 2 , 3 (

) 2(1

3

=

0

= , 3

= )

= (

1 2 = 2

3 2

r n

j

j r M r j

n

n e

n e

n N P

i

n

j r

n r

 

 

 

 

 

The PGF of N is given by

1 , 1

= ~

) ,

; (

= )

(

(1 )

) (1

0

 

 

s f s

d r f

e

s

s

s

N

where ~ ( ) s

f is the Laplace transform of non-central chi-square (  , r ) distribution, given by (2).

Hence it follows that

 

 

  

 

 

 





1

1 ) 1 2(1

= ) (

1 1

) 1 2(1

2 2 s

r s

N

e

s

s s

 (3)

(3)

1905 K.K. Jose

1

, IJMCR Volume 06 Issue 08 August 2018

Theorem 3.1. 2 If N ~ PANC (  ,  , r ) ,then the k

th

factorial moment of N is given by

2 ) , (

2 ) 2 , 2 , ( (2)

) (1

e )

= ( ) (

1

= 2 )

(

r

j

j r M r j

k N k

j k j k

j k k

 

 

  

 

 (4)

Proof: The k

th

factorial moment of PANC (  ,  , r ) can be obtained as

 

, ) ,

; ( )

| (

=

)

| (

= ) (

) 0 (

) ( )

(

d r f

N N E

N

k k k

where 

(k)

( N |  ) is the k

th

factorial moment of Polya-Aeppli distribution and is given by (1).

By substituting (1) in (5),we get (4).

Proposition 3.1: 3The PMF of the PANC (  ,  , r ) satisfies the following recursions:

 2,3,

= 9 ,

3) ( 2) (

9

2) 2)(

2)(7 (

) 2 )(

(1 9

1) )(

5 3(4 ) )(3

= (1

9 , ) )(3

= (1

3 2

2

1 0

1

i i P

P i

i

i r

P r i

i P r

r P P

i i

i i

 

 

  

 

 

       

 

 

     



(6)

and P

1

= 0 .

Proof: On differentiating (3) with respect to s, we have

 3 (2 )  ( ) = (1 )  (3 )(1 ) 2 (1 )  ( ),

)

(1   s    s

2



N

s   r     sr   s

N

s (7)

where

. 1) (

= ) (

,

= ) (

1 0

= 0

=

i i i

N

i i i N

s P i s

and

s P s



Equating the co-efficient of s

i

on both sides of (7), we obtain (6).

Proposition 3.2: 4Recurrence relation for the factorial moments

( k)

of PANC (  ,  , r ) is the following for k = 1,2,  with

1

(0)

=

. 2) 1)(

( 2) (

2)]

2)(3 1)(

( ) ( )[2 (1 4)]

(3 ) [(

) (1

= )

(1

2) ( 2

1) (

) ( 2

1) ( 3

k k

k k

k k k

k r

r k

k r

(8)

Proof: The factorial MGF of PANC (  ,  , r ) is

 

 

  

 

 

 





1

) (1 1 1 2

=

) (1

= ) (

1 ) (1 1 1 2

2 2 t

r t

t e t t t

(9)

On differentiating (9) with respect to t, we get

(4)

1906 K.K. Jose

1

, IJMCR Volume 06 Issue 08 August 2018 ),

( ] )) ( (2 ) )(1 )[(

(1

= ) ( ] ) (2 ) ][(1 )

[(1     t      t

2

  t   r      rr   tt (10)

where

! .

= ) (

1)!

= ( ) (

) ( 0

=

1 ) ( 1

=

k t t

and

k t t

k k k

k k k

 

Equating the co-efficient of

! k t

k

on both sides of (10), we obtain (8).

3.1 Polya-Aeppli Non-central Chi-square Process

Let N (t ) denotes the number of the events up to time t.Then { N ( t ), t  0} is a Polya-Aeppli non-central chi-square process if

), , ( and

) , (

| ) (

r chisquare Noncentral

t Aeppli Polya

t N

~

~ 

We use the notation N ( t ) ~ PANCP (  ,  , r ) and its PMF is given by

 1,2,

= , 2 )

, (

) ) 2 , 2(1 , 2 ( 2 )

2 (1

) (1 2

) 2 (1

=

0

= , )

2 (1

= )

= ) ( (

1 2 = 2

) 2 2 (1

r n j

t j r

M r t

t j n

t n

e

n e

t n

t N P

i

n

j r n

t r t

 

 

 

 

 

(11)

The mean and variance of PANCP (  ,  , r ) are given by

) (1

)

= ( )

( 

t t r

EN

and

) . (1

) 2 2(

) )(

= (1 )) (

(

2

2

r t r t

t N V

The Fisher index of dispersion is given by

1.

) >

)(

(1

) 2 2(

) (1 1 2

=

) (

)) ( (

= var )) ( (

 

 

r t r t

EN t t N

N FI

Therefore PANCP (  ,  , r ) is overdispersed, related to Polya-Aeppli process.

4. PANCP as a pure birth process

In this section we define PANCP as a pure birth process.

Definition 4.1. 5A counting process { N ( t ), t  0} is said to be a PANCP with parameters  ,  and r if (1) N (0) = 0 ;

(2) the state transition probabilities are defined as follows

(5)

1907 K.K. Jose

1

, IJMCR Volume 06 Issue 08 August 2018

 

 

 

 



 

 

 

 

 

 

 

 

 

 

 

 

  

 

 

 

 

 

 

1,2, 

= ,

= ), ) (

(2

) 1)(1 1 (

2 1

2

2 1 2 ) 2 (1

) (1

,

= ),

) ( (2

) 1)(1 1 (

2 1

2

2 1 2 )

2 (1

) 1 (1

=

= ) ( /

= )

(

1

2

1

1

= 2

i i m n h o t h

t i

r t

t t t

m n h

o t h

t k

r t

t t t

m t N n h t N

P

i

k

k

 

 

(12)

for every m = 0,1,  , where o ( h )  0 as h  0 .

Let P

n

( t ) = P ( N ( t ) = n ), n = 0,1,2,  .

Then the above postulates yield the following Kolmogorov forward equations:

  , 1 )

(2

) 1)(1 1 (

2 1

2

2 1 2 ) 2 (1

) ) (1

) ( 2 (1

) 2

= (1 ) (

), ) (

2 (1

) 2

= (1 ) (

1

1

= 2 2

2 0 0

 

 

  

 

 

 

 

 

 

 

 

 

 

 

 

n t t P

t k

r t

t t t t

t P c

t t r

P

t t P

t t r

P

k n n k

k n

n

 

with initial conditions

 1,2,

= 0,

= (0) and 1

=

0

(0) P n

P

n

As the solutions of above Kolmogorov forward equations, the marginal distributions of the process are obtained , given by (11).

Therefore two definitions of the Process are equivalent.

5 Properties of PANCP (  ,  , r )

In this section, we discuss some properties of PANCP (  ,  , r ) .

Theorem 5.1. 6 Let N ( t ) ~ PAPNCP (  , r ,  ) . Then:

1. The time interval T

1

to the first arrival is a non-central chi-square mixture of exponential(NCME) pdf's and inter-arrival times T

2

,T

3

are non-central chi-square mixture of exponential(NCME) with mass at zero equal to . 2. The distribution of the waiting time until the n

th

event is

1) 2 , (

) ) 2 , 2(1 1, 2 ( 2

2 1

) (1 1 2

) 2 (1

e

= 2 ) (

1 1

0 1 = 2 2

 

 

 

 

 

 

r i

t i r

M r t

t i n

t t

f

i n i

n

i n r

S

 

(13)

Proof: Let { T

k

}

k2

are the inter-arrival times and

n i

n i

T

S = 

=1

be the waiting time until the n

th

event.

For any t  0 and n  0 , the following relation holds.

. 0,1,

= ), (

) (

= )

= ) (

( N t n P S t P S

1

t n

P

n

 

n

 (14)

(1). The conditional C.D.F of T

1

given  (See Minkova(2004)) is

(6)

1908 K.K. Jose

1

, IJMCR Volume 06 Issue 08 August 2018 0.

>

0,

>

1

= )

|

( T

1

te

t

P  

t

Then the unconditional C.D.F of T

1

is

. )

2 (1 1

= )

(

2 1 2

1

t t r

T

t t e

F  

Hence the density function of T

1

is

(1 2 )(1 2 ) , 0.

= )

(

2 2 12

1

t rt   t

e

t

f

t

t r

T

(15)

i.e, It is a non-central chi-square mixture of exponential(NCME) pdf's and is denoted by  ( r ,  ; t ).

Proceeding similar way we get unconditional distribution of T

2

as

 (1 2 )  (1 2 ) , 0.

) (1 (0)

= )

(

2 2 1 2

2

t   rt   t

e

t

f

t

t r

T



which is the pdf of non-central chi-square mixture of exponential(NCME) with mass at zero equal to  . (2). We will prove the result by using mathematical induction.

From (15), it follows that

. 2 ,1)

(

) ) 2 , 2(1 1, 2 ( 2 )

2 (1

e

= 2 ) (

2 1 2

1

r

t r

M r

t t

f

S r

 

For n = 1 , (14) becomes

 0,1,

= ), (

) (

= 1)

= ) (

( N t P S

1

t P S

2

t n

P    (16)

Applying (11) for m = 1 and then differentiating (16), we get

 

 

 

 

 

 

2 ,2) (

) ) 2 , 2(1 2, 2 ( 2 ) 2 (1

) (1 2

2 ,1) (

) ) 2 , 2(1 1, 2 ( 2 )

2 (1

e

= 2 ) (

2 1 2

2

r

t r

M r t t

r

t r

M r

t t

f

S r

 

Now, suppose that for n  1 , the distribution of waiting time given by (13) is true. Applying (11) for m = n and then differentiating (14) and substituting (13), we get

. 1)

2 , (

) ) 2 , 2(1 1, 2 ( 2

2 1

) (1 2

) 2 (1

e

= 2 ) (

0 1 = 2 2

1

 

 

 

 

 

r i

t i r

M r t

t i n

t t

f

i n i

n

i n r

S

 

6. Application to Risk Theory

We consider here the standard risk model { X ( t ), t  0} , defined on the probability space (  , F , P )

. 0

= ,

= ) (

0

1 ) (

1

=

 

 

 

N t k

 

k

Y ct t X

where c is the rate of insurer's premium income and the claim sizes { Y

i

, iN } independent of the counting process

0}

), (

{ N t t  , are i.i.d positive random variables with common distribution function F (x ) such that F (0) = 0 . In this model we assume that { N ( t ), t  0} is a PANCP (  ,  , r ) .

The relative safety loading  > 0 satisfies the equation , 1

) ( )

= (1

r

c where  = E ( X

i

) .

The time to ruin is denoted by T and is defined by

(7)

1909 K.K. Jose

1

, IJMCR Volume 06 Issue 08 August 2018

 

0.

>

0 ) (

0}

<

) ( : {

= inf

t all for t

X u if

t X u T t

The probability of ultimate ruin from initial capital u is denoted by  (u ) and is given by

).

<

(

= )

( 

u P T

The non ruin probability is defined by  ( u ) = 1   ( u ) .

Let W ( u , z ) denote the joint CDF of the time to ruin T and deficit at the time of ruin D =| uX ( T ) | is given by

0, ),

,

<

(

= ) ,

( u z P TDz zW

It is clear that

).

(

= ) ,

lim W ( u z u

z

(17)

Using the postulates (12), we get

), ( ) ( ) (

) ( ) , (

) (2

) 1)(1 1 (

2 1

2 2

1 2 ) 2 (1

) (1

) , ) (

2 (1

) 2 1 (1

= ) , (

*

*

* 0

1

1

= 2

2

h o ch u F z ch u F x dF z x ch u W

t h

t k

r t t t t

z ch u W t h

t z r

u W

k k

ch k u

k

k

 

 

       

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

where F

*k

( x ), k = 1,2,  is the k -fold convolution of claim amount distribution.

or,equivalently

).

( ) ( ) (

) ( ) , (

) (2

) 1)(1 1 (

2 1

2 2

1 2 )

2 (1

) (1

) , ) (

2 (1

) 2

= (1 ) , ( ) , (

*

*

* 0

1

1

= 2

2

h o ch u F z ch u F x dF z x ch u W

t

t k

r t t t t

c

z ch u t W

c t r ch

z u W z ch u W

k ch k

u

k

k

 

 

       

 

 

 

 

 

 

 

 

 

 

 

 

Taking the limit h  0 , leads to the following differential equation:

 

      

 

 

( , ) = (1 (1 2 2 ) )

2

W ( u , y )

0

W ( u x , z ) dG ( x ) ( G ( u y ) G ( u )) t

c t z r

u u W

u

(18)

where ( ),

) (2

) 1)(1 1 (

2 1

2 2

1 2 )

) 2 (1 (

)

= (1 )

(

*

1

1

=

F x

t

t k

r t t t t

x r

G

k

k

k

 

 

 

 

 

 

 

 is a non defective

distribution function of the claims with G (0) = 0, G (  ) = 1 .

The above equation can be expressed in terms of the safety loading as follows:

. )) ( ) ( ( ) ( ) , ( )

, ) (

2 )(1 )(

(1

) ) 2 (1 )(

= (1 ) ,

(

2 0

 

      

u W u z r r t t W u z

u

W u x z d G x G u z G u

Using (17) and (18) we obtain the following integro- differential equation for the ruin probability.

0.

, )) ( (1 ) ( ) ( )

) ( 2 (1

) 2

= (1 )

(

2 0

  

       

 

 

 

u u r c t t u

u

u x dG x G u u (19)

(8)

1910 K.K. Jose

1

, IJMCR Volume 06 Issue 08 August 2018

Theorem 6.1. 7The probability of ruin with zero initial capital satisfies

) . (1

)

= (

(0) 

 

c

r (20)

Proof: If we integrate (18) from u = 0 to u = with W (  , z ) = 0 , we get the following equation.

. )) ( ) ( (

) ( ) , ( )

, ) (

2 (1

) 2

= (1 ) (0,

0

0 0 2 0

 

   

 

 

 

du u G z u G

du x dG z x u W du

z u t W

c t z r

W

u

Changing the order of integration in the II

nd

integral and then making use of some transformation, we get

. )) ( ) ( ) (

2 (1

) 2

= (1 )

(0,

2 0

G u z G u du

t c

t z r

W  

Hence

. )) ( ) (1

2 (1

) 2

= (1 )

(0,

2 0

G u du

t c

t z r

W

z

(21)

Using (17) and (21) we can write,

).

) ( 2 (1

) 2

= (1

)) ( ) (1

2 (1

) 2

= (1 (0)

2 2 0

X t E

c t r

du u t G

c t r

 

  

where EX is the mean of the random variable X with distribution function G (x ) and is given by

) . ) 2 (1 )(

(1

) 2 )(1

= (

) (2

) 1)(1 1 (

2 1

2 2

1 2 )

) 2 (1 (

)

= (1 ) (

2

1

1

=

 

 

 

  

 

 

 

 

 

t r

t r

t

t k

r t t k t t

X r E

k

k

Hence the result.

Exponential claims

Consider exponential claim sizes with p.d.f

x

e x

f

1

= )

( , x  0 ,  > 0 . The survival function G (x ) is given by

0.

>

) , ) 2 (1 )(

2 (1

) (1 1 2

= )

(

(12)

) (1

t x r t e t

x

G

t

x

 

 

 

In this case we obtain W (0, z ) from (21) and is given by

) . 2 (1 1 2

)

= ( )

(0,

(1 2)

) (1

2 )

2 (1

) (1

t z t

z

t ze c

e t c

z r

W

 

 

 

 

Differentiating (19) w.r.to u twice we get the following differential equation for the ruin probability, in the case of exponentially distributed claims.

 (1 ) ( )  ( ) = 0.

) 2 (1

) ) (1

) ( 2 )(1 (1

) ) 2 (1 2 (

) 2 (1

) ) (1

(

2

2 2

2 3

3

u u r

t c u u

t c

t r u t

u

 

 

 

 

 

 

 

 

 

   

Conclusions

In this study we introduced PANCP as a mixed Polya-Aeppli process with mixing random variable having non-central

chi-square distribution. We found that this model is more

suitable for handling over-dispersed count data. We have

defined the risk model with PANCP as a counting process

and have studied probability of ruin for this model.

(9)

1911 K.K. Jose

1

, IJMCR Volume 06 Issue 08 August 2018 Acknowledgments

The authors acknowledge the financial support from UGC, Government of India and KSCSTE, Government of Kerala towards this research.

References

1. Chukova S. and Minkova L.D. (2013):

Characterization of Polya - Aeppli process, Stochastic Analysis and Applications, 31, 590-599.2 2. Johnson N.L, Kemp A.W. and Kotz S. (2005):

Univariate Discrete Distributions, John Wiley and Sons, Hoboken, New Jersey, third edition.

3. Johnson N.L. and Kotz S. (2010): Distribution in Statistics: Continuous Univariate Distributions 2.

John Wiley : New York.

4. Lazarova M.D. and Minkova L.D.(2015):

I-Delaporate Process and Applications, Mathematics and Computers in Simulation (preprint).

5. Minkova L.D. (2002): A generalization of the classical discrete distributions, Communication Statistics Theory and Methods, 31,871-888.

6. Minkova L.D. (2004): The Polya - Aeppli process and ruin problems, J. Appi. Math. Stoch. Analysis,3, 221 - 234.1,2.1,3.

7. Minkova L.D. (2011): I-Polya Process and

Applications, Communication Statistics Theory and

Methods, 40,2847-2855.

References

Related documents

mayor con una mayor con una relación relación cintura/cadera cintura/cadera elevada elevada Mecanismos Posibles Mecanismos Posibles % % Pacientes Pacientes 0 0 10 10 20 20 30 30 40

The BTEC Level 3 Subsidiary Diploma in Engineering will give you an understanding of the practical skills and knowledge needed to begin professional work in the

“From Effectuation to Market Driven: Solidifying Value Propositions for Emergent and Sustainable Technologies.” Poster presented at 2011 University of Oregon Graduate

In this paper, we investigate the relationship between commercial bank lending terms, financial literacy and access to formal credit by Small and Medium Enterprises (SMEs).. In

Software Design Solutions provides consulting services in embedded systems software development, workstation application development, user interface design, and

Online autotuning is a control function which enables the Servoamp to check changes in the load inertia during operation in order to maintain the target value for speed loop gain

Documents on attendance, free and reduced lunch rates, special education reporting, academic performance, and financial history were taken from the Pennsylvania Department of

Although papillary-type PDTC can show concurrent cancer types, many cancers exist as majority PTCs with foci of high grade changes, such as necrosis, focal loss of