Next Article in Journal
New Analytical Solutions for Time-Fractional Stochastic (3+1)-Dimensional Equations for Fluids with Gas Bubbles and Hydrodynamics
Previous Article in Journal
Constructing Analytical Solutions of the Fractional Riccati Differential Equations Using Laplace Residual Power Series Method
Previous Article in Special Issue
Tychonoff Solutions of the Time-Fractional Heat Equation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Some Compound Fractional Poisson Processes

by
Mostafizar Khandakar
1,* and
Kuldeep Kumar Kataria
2
1
Department of Mathematics, Indian Institute of Technology Bombay, Powai, Mumbai 400076, India
2
Department of Mathematics, Indian Institute of Technology Bhilai, Raipur 492015, India
*
Author to whom correspondence should be addressed.
Fractal Fract. 2023, 7(1), 15; https://doi.org/10.3390/fractalfract7010015
Submission received: 31 October 2022 / Revised: 27 November 2022 / Accepted: 9 December 2022 / Published: 25 December 2022

Abstract

:
In this paper, we introduce and study fractional versions of the Bell–Touchard process, the Poisson-logarithmic process and the generalized Pólya–Aeppli process. The state probabilities of these compound fractional Poisson processes solve a system of fractional differential equations that involves the Caputo fractional derivative of order 0 < β < 1 . It is shown that these processes are limiting cases of a recently introduced process, namely, the generalized counting process. We obtain the mean, variance, covariance, long-range dependence property, etc., for these processes. Further, we obtain several equivalent forms of the one-dimensional distribution of fractional versions of these processes.

1. Introduction

Di Crescenzo et al. [1] introduced and studied a fractional counting process that performs k kinds of jumps of amplitude 1 , 2 , , k with positive rates λ 1 , λ 2 , , λ k , respectively. We call it the generalized fractional counting process (GFCP) and denote it by { M β ( t ) } t 0 , 0 < β 1 . It is defined as a counting process whose state probabilities p β ( n , t ) = Pr { M β ( t ) = n } satisfy the following system of fractional differential equations:
d β d t β p β ( n , t ) = ( λ 1 + λ 2 + + λ k ) p β ( n , t ) + j = 1 min { n , k } λ j p β ( n j , t ) , n 0 ,
with initial condition
p β ( n , 0 ) = 1 , n = 0 , 0 , n 1 .
Here, d β d t β is the Caputo fractional derivative defined as (see [2])
d β d t β f ( t ) : = 1 Γ ( 1 β ) 0 t ( t s ) β f ( s ) d s , 0 < β < 1 , f ( t ) , β = 1 ,
and its Laplace transform is given by (see [2], Equation (5.3.3))
L d β d t β f ( t ) ; s = s β f ˜ ( s ) s β 1 f ( 0 ) , s > 0 .
For β = 1 , the GFCP reduces to the generalized counting process (GCP) { M ( t ) } t 0 (see [1]). For k = 1 , the GFCP and the GCP reduce to the time fractional Poisson process (TFPP) (see [3]) and the Poisson process, respectively. For other recently introduced fractional stochastic processes, we refer the reader to Khalaf et al. [4,5].
Let { Y β ( t ) } t 0 be the inverse stable subordinator; that is, the first passage time of a stable subordinator { D β ( t ) } t 0 . A stable subordinator { D β ( t ) } t 0 is a one-dimensional Lévy process with non-decreasing sample paths. It is known that (see [1])
M β ( t ) = d M Y β ( t ) , t 0 ,
where = d denotes equality in the distribution and { M ( t ) } t 0 is independent of { Y β ( t ) } t 0 .
Kataria and Khandakar [6] showed that several recently introduced counting processes, such as the Poisson process of order k, Pólya–Aeppli process of order k, Pólya–Aeppli process, negative binomial process, etc., are particular cases of the GCP. In Kataria and Khandakar [7], the authors studied a limiting case of the GFCP, namely, the convoluted fractional Poisson process.
For j 1 , let { N j ( t ) } t 0 be a Poisson process with intensity λ j . Jánossy et al. [8] considered a composed process j = 1 j N j ( t ) t 0 with j = 1 λ j < . The probability mass function (pmf) of { ξ ( t ) } t 0 where ξ ( t ) = j = 1 j N j ( t ) is given by (see [8], Equation (2.18))
Pr { ξ ( t ) = n } = Ω n j = 1 n ( t λ j ) x j x j ! e j = 1 t λ j .
Here,
Ω n = ( x 1 , x 2 , , x n ) : j = 1 n j x j = n , x j N { 0 } .
Its equivalent version is given by (see [8], Equation (2.22))
Pr { ξ ( t ) = n } = Ω k n j = 1 k λ x j t k k ! e j = 1 t λ j ,
where
Ω k n = ( x 1 , x 2 , , x k ) : i = 1 k x i = n , k n , x i 1 .
Let { X i } i 1 be a sequence of independent and identically distributed random variables such that Pr { X 1 = j } = c j for all j 1 . Consider a compound Poisson process
Y ( t ) = i = 1 N ( t ) X i , t 0 ,
where { N ( t ) } t 0 is a Poisson process with intensity λ > 0 that is independent of { X i } i 1 .
For a suitable choice of λ and c j ’s, the compound Poisson process { Y ( t ) } t 0 is equal in distribution to a counting process introduced and studied by Freud and Rodriguez [9], namely, the Bell–Touchard process (BTP) { M ( t ) } t 0 . For λ = α ( e θ 1 ) and c j = θ j / j ! ( e θ 1 ) , j 1 where α > 0 , θ > 0 they have shown that
M ( t ) = d Y ( t ) .
For λ j = α θ j / j ! , j 1 , the process { ξ ( t ) } t 0 is equal in distribution to BTP (see [9]); that is, ξ ( t ) = d M ( t ) . Therefore, the pmf q ( n , t ) = Pr { M ( t ) = n } of BTP is given by
q ( n , t ) = Ω n j = 1 n ( α t θ j / j ! ) x j x j ! e α t e θ 1 ,
where Ω n is given in (5).
For c j = ( 1 p ) j / j ln p , j 1 where p ( 0 , 1 ) , the compound Poisson process { Y ( t ) } t 0 reduces to a counting process introduced and studied by Sendova and Minkova [10], namely, the Poisson-logarithmic process (PLP). We denote it by { M ^ ( t ) } t 0 . It is defined as
M ^ ( t ) = Y ( t ) .
As an application, they considered a risk process in which the PLP is used to model the claim numbers.
For c j = r + j 1 j ρ j ( 1 ρ ) r / ( 1 ( 1 ρ ) r ) , j 1 where r > 0 , 0 < ρ < 1 , the compound Poisson process { Y ( t ) } t 0 reduces to a counting process introduced and studied by Jacob and Jose [11], namely, the generalized Pólya–Aeppli process (GPAP). We denote it by { M ¯ ( t ) } t 0 . It is defined as
M ¯ ( t ) = Y ( t ) .
If r = 1 , then the GPAP reduces to the Pólya–Aeppli process (see [12]).
In this paper, we study, in detail, the fractional versions of BTP, PLP and GPAP. We obtain their Lévy measures. It is shown that these processes are the limiting cases of GCP. We obtain the probability generating function (pgf), mean, variance, covariance, etc., for their fractional variants and establish their long-range dependence (LRD) property. It is known that the process that exhibits an LRD property has applications in several areas, such as finance, econometrics, hydrology, internet data traffic modelling, etc. Several equivalent forms of the pmf of fractional versions of these processes are obtained. We have shown that the fractional variants of these processes are overdispersed and non-renewal. It is observed that the one-dimensional distributions of their fractional variants are not infinitely divisible, and their increments have the short-range dependence (SRD) property. It is shown that these fractional processes are equal in distribution to some particular cases of the compound fractional Poisson process studied by Beghin and Macci [13].

2. Preliminaries

In this section, we present some known results and definitions that will be used later.

2.1. Mittag–Leffler Function

The three-parameter Mittag–Leffler function is defined as (see [2], p. 45)
E α , β γ ( x ) 1 Γ ( γ ) j = 0 Γ ( j + γ ) x j j ! Γ ( j α + β ) , x R ,
where α > 0 , β > 0 and γ > 0 .
It reduces to the two-parameter Mittag–Leffler function for γ = 1 , and for γ = β = 1 it reduces to the Mittag–Leffler function.
For any real x, the Laplace transform of the function t β 1 E α , β γ x t α is given by (see [2], Equation (1.9.13)):
L t β 1 E α , β γ x t α ; s = s α γ β ( s α x ) γ , s > | x | 1 / α .

2.2. Inverse Stable Subordinator

The following result holds for the inverse stable subordinator { Y β ( t ) } t 0 (see [14]):
E e s Y β ( t ) = E β , 1 s t β , s > 0 .
The mean and variance of { Y β ( t ) } t 0 are given by (see [14])
E Y β ( t ) = t β Γ ( β + 1 ) ,
Var Y β ( t ) = 2 Γ ( 2 β + 1 ) 1 Γ 2 ( β + 1 ) t 2 β .
For fixed s and large t, the following asymptotic result holds (see [15]):
Cov Y β ( s ) , Y β ( t ) 1 Γ 2 ( β + 1 ) β s 2 β B ( β , β + 1 ) β 2 s β + 1 ( β + 1 ) t 1 β ,
where B ( β , β + 1 ) denotes the beta function.

2.3. Poisson-Logarithmic Process

The state probabilities q ^ ( n , t ) = Pr { M ^ ( t ) = n } of PLP satisfy the following (see [10]):
d d t q ^ ( 0 , t ) = λ q ^ ( 0 , t ) , d d t q ^ ( n , t ) = λ q ^ ( n , t ) λ ln p j = 1 n ( 1 p ) j j q ^ ( n j , t ) , n 1 ,
with initial conditions q ^ ( 0 , 0 ) = 1 and q ^ ( n , 0 ) = 0 , n 1 . Its pgf G ^ ( u , t ) = E u M ^ ( t ) is given by
G ^ ( u , t ) = exp λ t 1 ln ( 1 ( 1 p ) u ) ln p .

2.4. Generalized Pólya–Aeppli Process

The state probabilities q ¯ ( n , t ) = Pr { M ¯ ( t ) = n } of GPAP satisfy the following (see [11]):
d d t q ¯ ( 0 , t ) = λ q ¯ ( 0 , t ) , d d t q ¯ ( n , t ) = λ q ¯ ( n , t ) + λ ( 1 ρ ) r 1 j = 1 n r + j 1 j ρ j q ¯ ( n j , t ) , n 1 ,
with initial conditions q ¯ ( 0 , 0 ) = 1 and q ¯ ( n , 0 ) = 0 , n 1 . Its pgf G ¯ ( u , t ) = E u M ¯ ( t ) is given by
G ¯ ( u , t ) = exp λ t 1 ( 1 ρ u ) r 1 ( 1 ρ ) r 1 .
Let r ¯ 1 = r ρ λ / ( 1 ρ ) ( 1 ( 1 ρ ) r ) and r ¯ 2 = r ( 1 + r ρ ) ρ λ / ( 1 ρ ) 2 ( 1 ( 1 ρ ) r ) . Its mean and variance are given by
E M ¯ ( t ) = r ¯ 1 t , Var M ¯ ( t ) = r ¯ 2 t .

2.5. LRD and SRD Properties

The LRD and SRD properties for a non-stationary stochastic process { X ( t ) } t 0 are defined as follows (see [15,16]):
Definition 1. 
Let s > 0 be fixed. The process { X ( t ) } t 0 is said to exhibit the LRD property if its correlation function has the following asymptotic behaviour:
Corr ( X ( s ) , X ( t ) ) c ( s ) t θ , as t ,
for some c ( s ) > 0 and θ ( 0 , 1 ) . If θ ( 1 , 2 ) , then it is said to possess the SRD property.

3. Bell–Touchard Process and Its Fractional Version

Here, we introduce a fractional version of a recently introduced counting process, namely, the Bell–Touchard process (BTP) (see [9]).
First, we study some additional properties of BTP, the BTP is defined as follows:
Definition 2. 
A counting process { M ( t ) } t 0 is said to be a BTP with parameters α > 0 , θ > 0 if
(a) M ( 0 ) = 0 ;
(b) it has independent and stationary increments;
(c) for m = 0 , 1 , and h > 0 small enough such that o ( h ) 0 as h 0 , its state transition probabilities are given by
Pr { M ( t + h ) = n | M ( t ) = m } = 1 α e θ 1 h + o ( h ) , n = m , α θ j h / j ! + o ( h ) , n = m + j , j = 1 , 2 , .
It follows that the state probabilities q ( n , t ) = Pr { M ( t ) = n } , n 0 of BTP satisfy the following system of differential equations:
d d t q ( 0 , t ) = α e θ 1 q ( 0 , t ) , d d t q ( n , t ) = α e θ 1 q ( n , t ) + α j = 1 n θ j j ! q ( n j , t ) , n 1 ,
with initial conditions q ( 0 , 0 ) = 1 and q ( n , 0 ) = 0 , n 1 .
Remark 1. 
On taking β = 1 , λ j = α θ j / j ! for all j 1 and letting k , System (1) reduces to System (22). Thus, the BTP is a limiting case of the GCP.
In view of Remark 1, we note that several results for BTP can be obtained from the corresponding results for GCP. Next, we present a few of them.
The next result gives a recurrence relation for the pmf of BTP. It follows from Proposition 1 of Kataria and Khandakar [6].
Proposition 1. 
The state probabilities q ( n , t ) of BTP satisfy
q ( n , t ) = α t n j = 1 n θ j ( j 1 ) ! q ( n j , t ) , n 1 .
It is known that the GCP is equal in distribution to the following weighted sum of k independent Poisson processes (see [6]):
M ( t ) = d j = 1 k j N j ( t ) ,
where { N j ( t ) } t 0 ’s are independent Poisson processes with intensity λ j ’s. On taking λ j = α θ j / j ! for all j 1 and letting k , we get
M ( t ) = d j = 1 j N j ( t ) ,
which agrees with the result obtained by Freud and Rodriguez [9]. As lim t N j ( t ) / t = α θ j / j ! , j 1 almost surely, we have
lim t M ( t ) t = d j = 1 j lim t N j ( t ) t
                                                            = α θ e θ , in probability .
The next result gives a martingale characterisation for the BTP, whose proof follows from Proposition 2 of Kataria and Khandakar [6].
Proposition 2. 
The process M ( t ) α θ e θ t t 0 is a martingale with respect to a natural filtration F t = σ M ( s ) , s t .
From (8), it follows that the BTP is a Lévy process as it is equal in distribution to a compound Poisson process. Therefore, its mean, variance and covariance are given by
E ( M ( t ) ) = α θ e θ t ,
Var ( M ( t ) ) = α θ ( θ + 1 ) e θ t ,
Cov ( M ( s ) , M ( t ) ) = α θ ( θ + 1 ) e θ min { s , t } ,
respectively. The BTP exhibits the overdispersion property as Var ( M ( t ) ) E ( M ( t ) ) = α θ 2 e θ t > 0 for t > 0 .
The characteristic function of BTP can be obtained by taking λ j = α θ j / j ! for all j 1 and letting k in Equation (12) of Kataria and Khandakar [6]. It is given by
E e ω ξ M ( t ) = exp α t e θ e θ e ω ξ , ω = 1 , ξ R .
Therefore, its Lévy measure is given by μ ( d x ) = α j = 1 θ j j ! δ j d x , where δ j ’s are Dirac measures.
Remark 2. 
For fixed s and large t, the correlation function of BTP has the following asymptotic behaviour:
Corr ( M ( s ) , M ( t ) ) s t 1 / 2 .
Thus, it exhibits the LRD property.

Fractional Bell–Touchard Process

Here, we introduce a fractional version of the BTP, namely, the fractional Bell–Touchard process (FBTP). We define it as the stochastic process { M β ( t ) } t 0 , 0 < β 1 whose state probabilities q β ( n , t ) = Pr { M β ( t ) = n } satisfy the following system of fractional differential equations:
d β d t β q β ( 0 , t ) = α e θ 1 q β ( 0 , t ) , d β d t β q β ( n , t ) = α e θ 1 q β ( n , t ) + α j = 1 n θ j j ! q β ( n j , t ) , n 1 ,
with initial conditions q β ( 0 , 0 ) = 1 and q β ( n , 0 ) = 0 , n 1 .
Note that the system of Equation (26) is obtained by replacing the integer order derivative in (22) with the Caputo fractional derivative defined in (2).
Remark 3. 
On taking λ j = α θ j / j ! for all j 1 and letting k , System (1) reduces to System (26). Thus, the FBTP is a limiting case of the GFCP.
Using (26), it can be shown that the pgf G β ( u , t ) = E u M β ( t ) , | u | 1 of FBTP satisfies
d β d t β G β ( u , t ) = α e θ e θ u G β ( u , t ) ,
with G β ( u , 0 ) = 1 . On taking the Laplace transform in the above equation and using (3), we get
s β G ˜ β ( u , s ) s β 1 G β ( u , 0 ) = α e θ e θ u G ˜ β ( u , s ) , s > 0 ,
where G ˜ β ( u , s ) denotes the Laplace transform of G β ( u , t ) . Thus,
G ˜ β ( u , s ) = s β 1 s β + α e θ e θ u .
On taking the inverse Laplace transform and using (12), we get
G β ( u , t ) = E β , 1 α e θ e θ u t β .
Remark 4. 
On taking β = 1 in (27), we get the pgf G ( u , t ) = exp α e θ e θ u t of BTP. Further, from (27), we can verify that the pmf q β ( n , t ) sums up to one; that is, n = 0 q β ( n , t ) = G β ( u , t ) | u = 1 = E β , 1 ( 0 ) = 1 .
The next result gives a time-changed relationship between the BTP and its fractional variant, FBTP.
Theorem 1. 
Let { Y β ( t ) } t 0 , 0 < β < 1 , be an inverse stable subordinator independent of the BTP { M ( t ) } t 0 . Then
M β ( t ) = d M ( Y β ( t ) ) , t 0 .
Proof. 
Let h β ( x , t ) be the density of { Y β ( t ) } t 0 . Then,
E u M ( Y β ( t ) ) = 0 G ( u , x ) h β ( x , t ) d x = 0 exp α e θ e θ u x h β ( x , t ) d x , ( using Remark 4 ) = E β , 1 α e θ e θ u t β ( using ( 13 ) ) ,
which agrees with (27). This completes the proof. □
Remark 5. 
Let { T 2 β ( t ) } t > 0 be a random process whose distribution is given by the folded solution of the following Cauchy problem (see [17]):
d 2 β d t 2 β u ( x , t ) = 2 x 2 u ( x , t ) , x R , t > 0 ,
with u ( x , 0 ) = δ ( x ) for 0 < β 1 and t u ( x , 0 ) = 0 for 1 / 2 < β 1 . It is known that the density functions of Y β ( t ) and T 2 β ( t ) coincide (see [18]). Hence,
M β ( t ) = d M ( T 2 β ( t ) ) , t > 0 ,
where { T 2 β ( t ) } t > 0 is independent of the BTP.
The random process { T 2 β ( t ) } t > 0 becomes a reflecting Brownian motion { | B ( t ) | } t > 0 for β = 1 / 2 as Equation (29) reduces to the following heat equation:
{ t u ( x , t ) = 2 x 2 u ( x , t ) , x R , t > 0 , u ( x , 0 ) = δ ( x ) .
Therefore, M 1 / 2 ( t ) is equal in distribution to BTP at a Brownian time; that is, M ( | B ( t ) | ) , t > 0 .
In view of (8) and (28), it follows that the FBTP is equal in distribution to the following compound fractional Poisson process:
M β ( t ) = d i = 1 N ( Y β ( t ) ) X i = d i = 1 N β ( t ) X i , t 0 ,
where { N β ( t ) } t 0 is a TFPP with intensity α e θ 1 independent of the sequence of independent and identically distributed random variables { X i } i 1 . Thus, it is neither Markovian nor a Lévy process (see [19]).
Remark 6. 
The system of differential equations that governs the state probabilities of the compound fractional Poisson process was obtained by Beghin and Macci [13]. In view of (31), System (26) can alternatively be obtained using Proposition 1 of Beghin and Macci [13].
Next, we obtain the pmf of FBTP and some of its equivalent versions.
The solution u 2 β ( x , t ) of (29) is given by (see [3]):
u 2 β ( x , t ) = 1 2 t β W β , 1 β | x | t β , t > 0 , x R ,
where W ν , γ ( · ) is the Wright function defined as follows:
W ν , γ ( x ) = k = 0 x k k ! Γ ( k ν + γ ) , ν > 1 , γ > 0 , x R .
Let
u ¯ 2 β ( x , t ) = { 2 u 2 β ( x , t ) , x > 0 , 0 , x < 0 ,
be the folded solution to (29).
Theorem 2. 
The pmf q β ( n , t ) = Pr { M β ( t ) = n } of FBTP is given by
q β ( n , t ) = E β , 1 α ( e θ 1 ) t β , n = 0 , Ω n j = 1 n α θ j / j ! x j x j ! z n ! t z n β E β , z n β + 1 z n + 1 α ( e θ 1 ) t β , n 1 ,
where z n = x 1 + x 2 + + x n and Ω n is given in (5).
Proof. 
From (30) and (33), we have
q β ( n , t ) = 0 q ( n , x ) u ¯ 2 β ( x , t ) d x .
We use (9) and (32) in the above equation to obtain
q β ( n , t ) = Ω n j = 1 n α θ j / j ! x j x j ! t β 0 e α x ( e θ 1 ) x z n W β , 1 β x t β d x = Ω n j = 1 n α θ j / j ! x j x j ! t β α ( e θ 1 ) z n + 1 0 e y y z n W β , 1 β y α ( e θ 1 ) t β d y .
On using the following result (see [20], Equation (2.13)):
E β , z n β + 1 z n + 1 α ( e θ 1 ) t β = t β ( z n + 1 ) z n ! α ( e θ 1 ) z n + 1 0 e y y z n W β , 1 β y α ( e θ 1 ) t β d y ,
the proof follows. □
Remark 7. 
An equivalent form of the pmf of BTP can be obtained from (6). It is given by
q ( n , t ) = Ω k n j = 1 k θ x j x j ! ( α t ) k k ! e α t e θ 1 , n 0 ,
where Ω k n is given in (7). If we use (35) in the proof of Theorem 2, then we can obtain the following alternate form of the pmf of FBTP:
q β ( n , t ) = Ω k n j = 1 k θ x j x j ! α t β k E β , k β + 1 k + 1 α ( e θ 1 ) t β .
The pmf of TFPP with intensity α e θ 1 is given by (see [20], Equation (2.5))
Pr { N β ( t ) = n } = α ( e θ 1 ) t β n E β , n β + 1 n + 1 α ( e θ 1 ) t β , n 0 .
From (31), we have
q β ( 0 , t ) = Pr { N β ( t ) = 0 } = E β , 1 α ( e θ 1 ) t β .
We recall that X i ’s are independent of N β ( t ) in (31). Thus, for n 1 , we have
q β ( n , t ) = k = 1 n Pr { X 1 + X 2 + + X k = n } Pr { N β ( t ) = k }
= k = 1 n Θ n k k ! j = 1 n ( θ j / j ! ) x j x j ! α t β k E β , k β + 1 k + 1 α ( e θ 1 ) t β ,
where x j is the total number of claims of j units and
Θ n k = ( x 1 , x 2 , , x n ) : j = 1 n x j = k , j = 1 n j x j = n , x j N { 0 } .
Again, as X i ’s are independent and identically distributed, we have
Pr { X 1 + X 2 + + X k = n } = m 1 + m 2 + + m k = n m j N Pr { X 1 = m 1 , X 2 = m 2 , , X k = m k } = m 1 + m 2 + + m k = n m j N j = 1 k Pr { X j = m j } = m 1 + m 2 + + m k = n m j N 1 ( e θ 1 ) k j = 1 k θ m j m j ! ,
where we have used (8). On substituting (40) into (37), we get an equivalent expression for the pmf of FBTP in the following form:
q β ( n , t ) = k = 1 n m 1 + m 2 + + m k = n m j N j = 1 k θ m j m j ! α t β k E β , k β + 1 k + 1 α ( e θ 1 ) t β .
The pmf (38) can be written in the following equivalent form by using Lemma 2.4 of Kataria and Vellaisamy [21]:
q β ( n , t ) = k = 1 n Λ n k k ! j = 1 n k + 1 ( θ j / j ! ) x j x j ! α t β k E β , k β + 1 k + 1 α ( e θ 1 ) t β .
where
Λ n k = ( x 1 , x 2 , , x n k + 1 ) : j = 1 n k + 1 x j = k , j = 1 n k + 1 j x j = n , x j N { 0 } .
Thus, we have obtained the five alternate forms of the pmf of FBTP given in (34), (36), (38), (41) and (42).
By using (24), (25) and Theorem 2.1 of Leonenko et al. [14], the mean, variance and covariance of FBTP can be obtained in the following forms:
E M β ( t ) = α θ e θ E Y β ( t ) ,
Var M β ( t ) = α θ ( θ + 1 ) e θ E Y β ( t ) + α θ e θ 2 Var Y β ( t ) ,
Cov M β ( s ) , M β ( t ) = α θ ( θ + 1 ) e θ E Y β ( min { s , t } ) + α θ e θ 2 Cov Y β ( s ) , Y β ( t ) .
The FBTP exhibits overdispersion as Var M β ( t ) E M β ( t ) > 0 for all t > 0 .
Theorem 3. 
The FBTP exhibits the LRD property.
Proof. 
From (44) and (45), we get
Corr M β ( s ) , M β ( t ) = α θ ( θ + 1 ) e θ E Y β ( min { s , t } ) + ( α θ e θ ) 2 Cov Y β ( s ) , Y β ( t ) Var M β ( s ) α θ ( θ + 1 ) e θ E Y β ( t ) + ( α θ e θ ) 2 Var Y β ( t ) .
On using (14)–(16) for fixed s and large t, we get
Corr ( M β ( s ) , M β ( t ) ) α θ ( θ + 1 ) e θ Γ 2 ( β + 1 ) E Y β ( s ) + ( α θ e θ ) 2 β s 2 β B ( β , β + 1 ) β 2 s β + 1 ( β + 1 ) t 1 β Γ 2 ( β + 1 ) Var M β ( s ) α θ ( θ + 1 ) e θ t β Γ ( β + 1 ) + 2 ( α θ e θ ) 2 t 2 β Γ ( 2 β + 1 ) ( α θ e θ ) 2 t 2 β Γ 2 ( β + 1 ) c 0 ( s ) t β ,
where
c 0 ( s ) = ( θ + 1 ) Γ 2 ( β + 1 ) E Y β ( s ) + α θ e θ β s 2 β B ( β , β + 1 ) Γ 2 ( β + 1 ) Var M β ( s ) 2 Γ ( 2 β + 1 ) 1 Γ 2 ( β + 1 ) .
As 0 < β < 1 , it follows that the FBTP has the LRD property. □
Remark 8. 
For a fixed h > 0 , the increment process of FBTP is defined as
Z β h ( t ) : = M β ( t + h ) M β ( t ) , t 0 .
It can be shown that the increment process { Z β h ( t ) } t 0 exhibits the SRD property. The proof follows similar lines to that of Theorem 1 of Maheshwari and Vellaisamy [15].
The factorial moments of the FBTP can be obtained by taking λ j = α θ j / j ! for all j 1 and letting k in Proposition 4 of Kataria and Khandakar [6].
Proposition 3. 
Let ψ β ( r , t ) = E ( M β ( t ) ( M β ( t ) 1 ) ( M β ( t ) r + 1 ) ) , r 1 be the rth factorial moment of FBTP. Then,
ψ β ( r , t ) = r ! n = 1 r α e θ t β n Γ ( n β + 1 ) i = 1 n m i = r m i N = 1 n θ m m ! .
The proof of the next result follows on using (23), the self-similarity property of { Y β ( t ) } t 0 in (28) and the arguments used in Proposition 3 of Kataria and Khandakar [6].
Proposition 4. 
The one-dimensional distributions of FBTP are not infinitely divisible.
Remark 9. 
Let the random variable W 1 be the first waiting time of FBTP. Then, the distribution of W 1 is given by
Pr { W 1 > t } = Pr { M β ( t ) = 0 } = E β , 1 α ( e θ 1 ) t β ,
which coincides with the first waiting time of TFPP with intensity α ( e θ 1 ) (see [22], Remark 3.3). However, the one-dimensional distributions of TFPP and FBTP differ. Thus, the fact that the TFPP is a renewal process (see [18]) implies that the FBTP is not a renewal process.

4. Poisson-Logarithmic Process and Its Fractional Version

Here, we introduce a fractional version of the PLP. First, we give some additional properties of it.
On taking β = 1 , λ j = λ ( 1 p ) j / j ln p for all j 1 and letting k , the governing system of differential Equation (1) for GCP reduces to the governing system of differential Equation (17) of PLP. Thus, the PLP is a limiting case of the GCP. Thus, we note that several results for PLP can be obtained from the corresponding results for GCP.
The next result gives a recurrence relation for the pmf of PLP that follows from Proposition 1 of Kataria and Khandakar [6].
Proposition 5. 
The state probabilities q ^ ( n , t ) = Pr { M ^ ( t ) = n } , n 1 of PLP satisfy
q ^ ( n , t ) = λ t n ln p j = 1 n ( 1 p ) j q ^ ( n j , t ) .
The pgf (18) can be rewritten as
G ^ ( u , t ) = j = 1 exp λ t ln p ( 1 p ) j j ( u j 1 ) .
It follows that the PLP is equal in distribution to a weighted sum of independent Poisson processes; that is,
M ^ ( t ) = d j = 1 j N j ( t ) ,
where { N j ( t ) } t 0 is a Poisson process with intensity λ j = λ ( 1 p ) j / j ln p . Thus,
lim t M ^ ( t ) t = d j = 1 j lim t N j ( t ) t = λ ( p 1 ) p ln p , in probability ,
where we have used lim t N j ( t ) / t = λ ( 1 p ) j / j ln p , j 1 almost surely.
In view of (4) and (46), the pmf of PLP is given by
q ^ ( n , t ) = Ω n j = 1 n ( 1 p ) j / j x j x j ! λ t ln p z n e λ t ,
where z n = x 1 + x 2 + + x n and Ω n is given in (5).
Using (6), the pmf of PLP can alternatively be written as
q ^ ( n , t ) = Ω k n j = 1 k ( 1 p ) x j x j k ! λ t ln p k e λ t ,
where Ω k n is given in (7).
The next result gives a martingale characterisation for the PLP.
Proposition 6. 
The process M ^ ( t ) λ ( p 1 ) p ln p t t 0 is a martingale with respect to a natural filtration F t = σ ( M ^ ( s ) , s t ) .
Let r ^ 1 = λ ( p 1 ) / p ln p and r ^ 2 = λ ( p 1 ) / p 2 ln p . From (10), it follows that the PLP is a Lévy process. Its Lévy measure can be obtained by taking λ j = λ ( 1 p ) j / j ln p for all j 1 and letting k in Equation (13) of Kataria and Khandakar [6]. It is given by
μ ^ ( d x ) = λ ln p j = 1 ( 1 p ) j j δ j d x ,
where δ j ’s are Dirac measures. Its mean, variance and covariance are given by
E ( M ^ ( t ) ) = r ^ 1 t , Var ( M ^ ( t ) ) = r ^ 2 t , Cov ( M ^ ( s ) , M ^ ( t ) ) = r ^ 2 min { s , t } .

Fractional Poisson-Logarithmic Process

Here, we introduce a fractional version of the PLP, namely, the fractional Poisson-logarithmic process (FPLP). We define it as the stochastic process { M ^ β ( t ) } t 0 , 0 < β 1 , whose state probabilities q ^ β ( n , t ) = Pr { M ^ β ( t ) = n } satisfy the following system of differential equations:
d β d t β q ^ β ( 0 , t ) = λ q ^ β ( 0 , t ) , d β d t β q ^ β ( n , t ) = λ q ^ β ( n , t ) λ ln p j = 1 n ( 1 p ) j j q ^ β ( n j , t ) , n 1 ,
with initial conditions q ^ β ( 0 , 0 ) = 1 and q ^ β ( n , 0 ) = 0 , n 1 .
Note that the system of Equation (50) is obtained by replacing the integer order derivative in (17) with a Caputo fractional derivative.
Remark 10. 
On taking λ j = λ ( 1 p ) j / j ln p for all j 1 and letting k , the System (1) reduces to System (50). Thus, the FPLP is a limiting case of the GFCP.
Further, on taking λ = ln p , System (50) reduces to the system of differential equations that governs the state probabilities of fractional negative binomial process (see [23], Equation (66)).
Using (50), it can be shown that the pgf G ^ β ( u , t ) = E u M ^ β ( t ) , | u | 1 of FPLP satisfies
d β d t β G ^ β ( u , t ) = λ 1 ln ( 1 ( 1 p ) u ) ln p G ^ β ( u , t ) ,
with G ^ β ( u , 0 ) = 1 . On taking the Laplace transform in the above equation and using (3), we get
s β G ^ ˜ β ( u , s ) s β 1 G ^ β ( u , 0 ) = λ 1 ln ( 1 ( 1 p ) u ) ln p G ^ ˜ β ( u , s ) , s > 0 .
Thus,
G ^ ˜ β ( u , s ) = s β 1 s β + λ 1 ln ( 1 ( 1 p ) u ) ln p .
On taking inverse Laplace transform and using (12), we get
G ^ β ( u , t ) = E β , 1 λ 1 ln ( 1 ( 1 p ) u ) ln p t β .
Remark 11. 
On taking β = 1 in (51), we get the pgf of PLP given in (18). Further, from (51) we can verify that the pmf q ^ β ( n , t ) sums up to one; that is, n = 0 q ^ β ( n , t ) = G ^ β ( u , t ) | u = 1 = E β , 1 ( 0 ) = 1 .
The following time-changed relationship between the PLP and FPLP holds, whose proof follows similar lines to that of Theorem 1:
M ^ β ( t ) = d M ^ ( Y β ( t ) ) , t 0 ,
where the PLP is independent of the inverse stable subordinator { Y β ( t ) } t 0 , 0 < β < 1 . In view of Remark 5, we have
M ^ β ( t ) = d M ^ ( T 2 β ( t ) ) , t > 0 ,
where { T 2 β ( t ) } t > 0 is independent of { M ^ ( t ) } t > 0 .
Remark 12. 
In view of (10) and (52), we note that the FPLP is equal in distribution to the following compound fractional Poisson process:
M ^ β ( t ) = d i = 1 N β ( t ) X i , t 0 ,
where { N β ( t ) } t 0 is a TFPP with intensity λ independent of the sequence of independent and identically distributed random variables { X i } i 1 . Therefore, it is neither Markovian nor a Lévy process. In view of (53), System (50) can alternatively be obtained using Proposition 1 of Beghin and Macci [13].
The proof of the next result follows similar lines to that of Theorem 2.
Theorem 4. 
The pmf q ^ β ( n , t ) = Pr { M ^ β ( t ) = n } of FPLP is given by
q ^ β ( n , t ) = E β , 1 λ t β , n = 0 , Ω n j = 1 n ( 1 p ) j / j x j x j ! z n ! λ t β ln p z n E β , z n β + 1 z n + 1 λ t β , n 1 ,
where z n = x 1 + x 2 + + x n and Ω n is given in (5).
Remark 13. 
If we use (48) in the proof of Theorem 4, then we can obtain the following alternate form of the pmf of FPLP:
q ^ β ( n , t ) = Ω k n j = 1 k ( 1 p ) x j x j λ t β ln p k E β , k β + 1 k + 1 λ t β ,
where Ω k n is given in (7).
From (53), we have
q ^ β ( 0 , t ) = Pr { N β ( t ) = 0 } = E β , 1 ( λ t β ) .
For n 1 , we get
q ^ β ( n , t ) = k = 1 n Pr { X 1 + X 2 + + X k = n } Pr { N β ( t ) = k }
= k = 1 n Θ n k k ! j = 1 n ( ( 1 p ) j / j ) x j x j ! λ t β ln p k E β , k β + 1 k + 1 ( λ t β ) ,
where Θ n k is given in (39).
As X i ’s are independent and identically distributed, we have
Pr { X 1 + X 2 + + X k = n } = m 1 + m 2 + + m k = n m j N j = 1 k Pr { X j = m j } = m 1 + m 2 + + m k = n m j N 1 ln p k j = 1 k ( 1 p ) m j m j ,
where we have used (10). Substituting (58) in (56), we get an equivalent expression for the pmf of the FPLP in the following form:
q ^ β ( n , t ) = k = 1 n m 1 + m 2 + + m k = n m j N j = 1 k ( 1 p ) m j m j ! λ t β ln p k E β , k β + 1 k + 1 ( λ t β ) .
The pmf (57) can be written in the following equivalent form by using Lemma 2.4 of Kataria and Vellaisamy [21]:
q ^ β ( n , t ) = k = 1 n Λ n k k ! j = 1 n k + 1 ( ( 1 p ) j / j ) x j x j ! λ t β ln p k E β , k β + 1 k + 1 ( λ t β ) ,
where Λ n k is given in (43).
Thus, we have obtained the five alternate forms of the pmf of FPLP given in (54), (55), (57), (59) and (60). Note that the one-dimensional distributions of FPLP are not infinitely divisible, whose proof follows on similar lines to that of Proposition 4.
Remark 14. 
The distribution of the first waiting time W ^ 1 of FPLP is given by
Pr { W ^ 1 > t } = Pr { M ^ β ( t ) = 0 } = E β , 1 λ t β .
By using the same arguments as used in Remark 9, we conclude that the FPLP is not a renewal process.
By using (49) and Theorem 2.1 of Leonenko et al. [14], we obtain the mean, variance and covariance of FPLP as follows:
E M ^ β ( t ) = r ^ 1 E Y β ( t ) , Var M ^ β ( t ) = r ^ 2 E Y β ( t ) + r ^ 1 2 Var Y β ( t ) , Cov M ^ β ( s ) , M ^ β ( t ) = r ^ 2 E Y β ( min { s , t } ) + r ^ 1 2 Cov Y β ( s ) , Y β ( t ) .
The FPLP exhibits overdispersion as Var M ^ β ( t ) E M ^ β ( t ) > 0 for all t > 0 .
Remark 15. 
The FPLP exhibits the LRD property and, as in Remark 8, the increment process of FPLP exhibits the SRD property.

5. Generalized Pólya–Aeppli Process and Its Fractional Version

Here, we introduce a fractional version of the GPAP. First, we give some additional properties of it.
On taking β = 1 , λ j = λ r + j 1 j ρ j ( 1 ρ ) r / ( 1 ( 1 ρ ) r ) for all j 1 and letting k , the governing system of differential Equation (1) for GCP reduces to the governing system of differential Equation (19) of GPAP. Thus, the GPAP is a limiting case of the GCP.
The next result gives a recurrence relation for the pmf of GPAP, whose proof follows from Proposition 1 of Kataria and Khandakar [6].
Proposition 7. 
The state probabilities q ¯ ( n , t ) = Pr { M ¯ ( t ) = n } , n 1 of GPAP satisfy
q ¯ ( n , t ) = λ t ( 1 ρ ) r n ( 1 ( 1 ρ ) r ) j = 1 n j ρ j r + j 1 j q ¯ ( n j , t ) .
The pgf (20) can be expressed as
G ¯ ( u , t ) = j = 1 exp λ t ρ j ( 1 ρ ) r 1 ( 1 ρ ) r r + j 1 j ( u j 1 ) .
It follows that the GPAP is equal in distribution to a weighted sum of independent Poisson processes; that is,
M ¯ ( t ) = d j = 1 j N j ( t ) ,
where { N j ( t ) } t 0 is a Poisson process with intensity λ j = λ r + j 1 j ρ j ( 1 ρ ) r / ( 1 ( 1 ρ ) r ) . Thus,
lim t M ¯ ( t ) t = d j = 1 j lim t N j ( t ) t = λ r ρ ( 1 ρ ) ( 1 ( 1 ρ ) r ) , in probability ,
where we have used lim t N j ( t ) / t = λ r + j 1 j ρ j ( 1 ρ ) r / ( 1 ( 1 ρ ) r ) , j 1 almost surely. On substituting r = 1 in (62), we get the corresponding limiting result for the Pólya–Aeppli process (see [6], Section 4.3).
In view of (61), the pmf of GPAP can be obtained from (4), and it is given by
q ¯ ( n , t ) = Ω n j = 1 n ρ j r + j 1 j x j x j ! λ t ( 1 ρ ) r 1 ( 1 ρ ) r z n e λ t ,
where z n = x 1 + x 2 + + x n and Ω n is given in (5).
Using (6), the pmf of GPAP can alternatively be written as
q ¯ ( n , t ) = Ω k n j = 1 k ρ x j r + x j 1 x j λ t ( 1 ρ ) r 1 ( 1 ρ ) r k e λ t k ! ,
where Ω k n is given in (7).
From (11), it follows that the GPAP is a Lévy process. Its Lévy measure can be obtained by taking λ j = λ r + j 1 j ρ j ( 1 ρ ) r / ( 1 ( 1 ρ ) r ) for all j 1 and letting k in Equation (13) of Kataria and Khandakar [6]. It is given by
μ ¯ ( d x ) = λ ( 1 ρ ) r 1 ( 1 ρ ) r j = 1 r + j 1 j ρ j δ j d x .

Fractional Generalized Pólya–Aeppli Process

Here, we introduce a fractional version of the GPAP, namely, the fractional generalized Pólya–Aeppli process (FGPAP). We define it as the stochastic process { M ¯ β ( t ) } t 0 , 0 < β 1 , whose state probabilities q ¯ β ( n , t ) = Pr { M ¯ β ( t ) = n } satisfy the following system of differential equations:
d β d t β q ¯ β ( 0 , t ) = λ q ¯ β ( 0 , t ) , d β d t β q ¯ β ( n , t ) = λ q ¯ β ( n , t ) + λ ( 1 ρ ) r 1 j = 1 n r + j 1 j ρ j q ¯ β ( n j , t ) , n 1 ,
with initial conditions q ¯ β ( 0 , 0 ) = 1 and q ¯ β ( n , 0 ) = 0 , n 1 .
Note that the system of Equation (65) is obtained by replacing the integer order derivative in (19) by Caputo fractional derivative.
Remark 16. 
On taking λ j = λ r + j 1 j ρ j ( 1 ρ ) r / ( 1 ( 1 ρ ) r ) for all j 1 and letting k , System (1) reduces to System (65). Thus, the FGPAP is a limiting case of the GFCP.
Further, on taking r = 1 , System (65) reduces to the system of differential equations that governs the state probabilities of the fractional Pólya–Aeppli process (see [13], Equation (19)).
Using (65), it can be shown that the pgf G ¯ β ( u , t ) = E u M ¯ β ( t ) , | u | 1 of FGPAP satisfies
d β d t β G ¯ β ( u , t ) = λ 1 ( 1 ρ u ) r 1 ( 1 ρ ) r 1 G ¯ β ( u , t ) ,
with G ¯ β ( u , 0 ) = 1 . On taking the Laplace transform in the above equation and using (3), we get
s β G ¯ ˜ β ( u , s ) s β 1 G ¯ β ( u , 0 ) = λ 1 ( 1 ρ u ) r 1 ( 1 ρ ) r 1 G ¯ ˜ β ( u , s ) , s > 0 .
Thus,
G ¯ ˜ β ( u , s ) = s β 1 s β + λ 1 ( 1 ρ u ) r 1 ( 1 ρ ) r 1 .
On taking the inverse Laplace transform and using (12), we get
G ¯ β ( u , t ) = E β , 1 λ 1 ( 1 ρ u ) r 1 ( 1 ρ ) r 1 t β .
Remark 17. 
On taking β = 1 in (66), we get the pgf of GPAP given in (20). Further, from (66) we can verify that the pmf q ¯ β ( n , t ) sums up to one; that is, n = 0 q ¯ β ( n , t ) = G ¯ β ( u , t ) | u = 1 = E β , 1 ( 0 ) = 1 .
The following time-changed relationship holds between the GPAP and FGPAP:
M ¯ β ( t ) = d M ¯ ( Y β ( t ) ) , t 0 ,
where the GPAP is independent of { Y β ( t ) } t 0 , 0 < β < 1 . Further,
M ¯ β ( t ) = d M ¯ ( T 2 β ( t ) ) , t > 0 ,
where { T 2 β ( t ) } t > 0 is independent of { M ¯ ( t ) } t > 0 .
Remark 18. 
In view of (11) and (67), we note that the FGPAP is equal in distribution to the following compound fractional Poisson process:
M ¯ β ( t ) = d i = 1 N β ( t ) X i , t 0 ,
where { N β ( t ) } t 0 is a TFPP with intensity λ independent of { X i } i 1 . Therefore, it is neither Markovian nor a Lévy process. In view of (68), System (65) can alternatively be obtained using Proposition 1 of Beghin and Macci [13].
On using the pmf of GPAP (see [11], Equation (3)), we get the following pmf of FGPAP.
Theorem 5. 
The pmf q ¯ β ( n , t ) = Pr { M ¯ β ( t ) = n } of FGPAP is given by
q ¯ β ( n , t ) = E β , 1 λ t β , n = 0 , ρ n j = 1 n m = 1 j ( 1 ) m j m λ t β ( 1 ρ ) r 1 j r m + n 1 n E β , j β + 1 j + 1 λ t β , n 1 .
Remark 19. 
If we use (63) in the proof of Theorem 5, then we can obtain the following alternate form of the pmf of FGPAP:
q ¯ β ( n , t ) = E β , 1 λ t β , n = 0 , Ω n j = 1 n ρ j r + j 1 j x j x j ! z n ! λ t β ( 1 ρ ) r 1 ( 1 ρ ) r z n E β , z n β + 1 z n + 1 λ t β , n 1 .
Again, if we use (64) in the proof of Theorem 5, then we can obtain the following:
q ¯ β ( n , t ) = Ω k n j = 1 k ρ x j r + x j 1 x j λ t β ( 1 ρ ) r 1 ( 1 ρ ) r k E β , k β + 1 k + 1 λ t β .
From (68), we have
q ¯ β ( 0 , t ) = Pr { N β ( t ) = 0 } = E β , 1 ( λ t β ) .
For n 1 , we get
q ¯ β ( n , t ) = k = 1 n Pr { X 1 + X 2 + + X k = n } Pr { N β ( t ) = k }
= k = 1 n Θ n k k ! j = 1 n ρ j r + j 1 j x j x j ! λ t β ( 1 ρ ) r 1 ( 1 ρ ) r k E β , k β + 1 k + 1 ( λ t β ) ,
where Θ n k is given in (39).
As X i ’s are independent and identically distributed, we have
Pr { X 1 + X 2 + + X k = n } = m 1 + m 2 + + m k = n m j N j = 1 k Pr { X j = m j } = m 1 + m 2 + + m k = n m j N ( 1 ρ ) r 1 ( 1 ρ ) r k j = 1 k ρ m j r + m j 1 m j ,
where we have used (11). Substituting (74) into (72), we get an equivalent expression for the pmf of FGPAP in the following form:
q ¯ β ( n , t ) = k = 1 n m 1 + m 2 + + m k = n m j N λ t β ( 1 ρ ) r 1 ( 1 ρ ) r k j = 1 k ρ m j r + m j 1 m j E β , k β + 1 k + 1 ( λ t β ) .
The pmf (73) can be written in the following equivalent form by using Lemma 2.4 of Kataria and Vellaisamy [21]:
q ¯ β ( n , t ) = k = 1 n Λ n k k ! j = 1 n k + 1 ρ j r + j 1 j x j x j ! λ t β ( 1 ρ ) r 1 ( 1 ρ ) r k E β , k β + 1 k + 1 ( λ t β ) ,
where Λ n k is given in (43).
Thus, we have obtained the six alternate forms of the pmf of FGPAP given in (69)–(71), (73), (75) and (76). On substituting r = 1 in these pmfs, we get the equivalent versions of the pmf of fractional Pólya–Aeppli process. Note that the one-dimensional distributions of FGPAP are not infinitely divisible.
Remark 20. 
The distribution of the first waiting time W ¯ 1 of FGPAP is given by
Pr { W ¯ 1 > t } = Pr { M ¯ β ( t ) = 0 } = E β , 1 λ t β .
By using the same arguments as used in Remark 9, we conclude that the FGPAP is not a renewal process.
By using (21) and Theorem 2.1 of Leonenko et al. [14], we obtain the mean, variance and covariance of FGPAP as follows:
E M ¯ β ( t ) = r ¯ 1 E Y β ( t ) , Var M ¯ β ( t ) = r ¯ 2 E Y β ( t ) + r ¯ 1 2 Var Y β ( t ) , Cov M ¯ β ( s ) , M ¯ β ( t ) = r ¯ 2 E Y β ( min { s , t } ) + r ¯ 1 2 Cov Y β ( s ) , Y β ( t ) .
The FGPAP exhibits overdispersion as Var M ¯ β ( t ) E M ¯ β ( t ) > 0 for all t > 0 .
Remark 21. 
The FGPAP has the LRD property, and the increment process of FGPAP exhibits the SRD property.

6. Concluding Remarks

In this paper, we obtain some additional results for three recently introduced counting processes: BTP, PLP and GPAP. We study their fractional versions and observe that they are equal in distribution to some particular cases of the compound fractional Poisson process. We obtain several distributional properties for their fractional variants and establish their LRD property. Therefore, these processes have potential applications in modelling high-frequency financial data. Several equivalent forms of the pmf of FBTP, FPLP and FGPAP are obtained. We have shown that these fractional processes are overdispersed and non-renewal. It is observed that their one-dimensional distributions are not infinitely divisible, and their increment process has an SRD property. As an application in risk theory, FBTP, FPLP and FGPAP can be used to model the number of claims received by an insurance company.

Author Contributions

Conceptualization, M.K. and K.K.K.; Methodology, M.K. and K.K.K.; Validation, M.K. and K.K.K.; Formal analysis, M.K. and K.K.K.; Investigation, M.K. and K.K.K.; Writing—original draft, M.K. and K.K.K.; Writing—review & editing, M.K. and K.K.K.; Visualization, M.K. and K.K.K.; Supervision, K.K.K. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Di Crescenzo, A.; Martinucci, B.; Meoli, A. A fractional counting process and its connection with the Poisson process. ALEA Lat. Am. J. Probab. Math. Stat. 2016, 13, 291–307. [Google Scholar] [CrossRef]
  2. Kilbas, A.A.; Srivastava, H.M.; Trujillo, J.J. Theory and Applications of Fractional Differential Equations; Elsevier Science B.V.: Amsterdam, The Netherlands, 2006. [Google Scholar]
  3. Beghin, L.; Orsingher, E. Fractional Poisson processes and related planar random motions. Electron. J. Probab. 2009, 14, 1790–1827. [Google Scholar] [CrossRef] [Green Version]
  4. Khalaf, A.D.; Zeb, A.; Saeed, T.; Abouagwa, M.; Djilali, S.; Alshehri, H.M. A special study of the mixed weighted fractional Brownian motion. Fractal Fract. 2021, 5, 192. [Google Scholar] [CrossRef]
  5. Khalaf, A.D.; Saeed, T.; Abu-Shanab, R.; Almutiry, W.; Abouagwa, M. Estimating drift parameters in a sub-fractional Vasicek-type process. Entropy 2022, 24, 594. [Google Scholar] [CrossRef]
  6. Kataria, K.K.; Khandakar, M. Generalized fractional counting process. J. Theor. Probab. 2022, 35, 2784–2805. [Google Scholar] [CrossRef]
  7. Kataria, K.K.; Khandakar, M. Convoluted fractional Poisson process. ALEA Lat. Am. J. Probab. Math. Stat. 2021, 18, 1241–1265. [Google Scholar]
  8. Jánossy, L.; Rényi, A.; Aczél, J. On composed Poisson distributions. I. Acta Math. Acad. Sci. Hung. 1950, 1, 209–224. [Google Scholar]
  9. Freud, T.; Rodriguez, P.M. The Bell-Touchard counting process. arXiv 2022, arXiv:2203.16737v3. [Google Scholar]
  10. Sendova, K.P.; Minkova, L.D. Poisson-logarithmic risk process and applications. C. R. Acad. Bulg. Sci. 2018, 71, 1020–1028. [Google Scholar]
  11. Jacob, S.; Jose, K.K. Generalized Pólya-Aeppli Process and its applications in risk modelling and analysis. Iosr J. Bus. Manag. 2018, 20, 24–35. [Google Scholar]
  12. Chukova, S.; Minkova, L.D. Characterization of the Pólya-Aeppli process. Stoch. Anal. Appl. 2013, 31, 590–599. [Google Scholar] [CrossRef]
  13. Beghin, L.; Macci, C. Fractional discrete processes: Compound and mixed Poisson representations. J. Appl. Probab. 2014, 51, 19–36. [Google Scholar] [CrossRef]
  14. Leonenko, N.N.; Meerschaert, M.M.; Schilling, R.L.; Sikorskii, A. Correlation structure of time-changed Lévy processes. Commun. Appl. Ind. Math. 2014, 6, e-483. [Google Scholar] [CrossRef]
  15. Maheshwari, A.; Vellaisamy, P. On the long-range dependence of fractional Poisson and negative binomial processes. J. Appl. Probab. 2016, 53, 989–1000. [Google Scholar] [CrossRef] [Green Version]
  16. D’Ovidio, M.; Nane, E. Time dependent random fields on spherical non-homogeneous surfaces. Stoch. Process. Appl. 2014, 124, 2098–2131. [Google Scholar] [CrossRef]
  17. Orsingher, E.; Beghin, L. Time-fractional telegraph equations and telegraph processes with Brownian time. Probab. Theory Relat. Fields 2004, 128, 141–160. [Google Scholar] [CrossRef]
  18. Meerschaert, M.M.; Nane, E.; Vellaisamy, P. The fractional Poisson process and the inverse stable subordinator. Electron. J. Probab. 2011, 16, 1600–1620. [Google Scholar] [CrossRef]
  19. Scalas, E. A Class of CTRWs: Compound Fractional Poisson Processes. In Fractional Dynamics; World Scientific Publishing: Hackensack, NJ, USA, 2012; pp. 353–374. [Google Scholar]
  20. Beghin, L.; Orsingher, E. Poisson-type processes governed by fractional and higher-order recursive differential equations. Electron. J. Probab. 2010, 15, 684–709. [Google Scholar] [CrossRef]
  21. Kataria, K.K.; Vellaisamy, P. Correlation between Adomian and partial exponential Bell polynomials. C. R. Math. Acad. Sci. Paris 2017, 355, 929–936. [Google Scholar] [CrossRef]
  22. Kataria, K.K.; Vellaisamy, P. Saigo space-time fractional Poisson process via Adomian decomposition method. Stat. Probab. Lett. 2017, 129, 69–80. [Google Scholar] [CrossRef] [Green Version]
  23. Beghin, L. Fractional gamma and gamma-subordinated processes. Stoch. Anal. Appl. 2015, 33, 903–926. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Khandakar, M.; Kataria, K.K. Some Compound Fractional Poisson Processes. Fractal Fract. 2023, 7, 15. https://doi.org/10.3390/fractalfract7010015

AMA Style

Khandakar M, Kataria KK. Some Compound Fractional Poisson Processes. Fractal and Fractional. 2023; 7(1):15. https://doi.org/10.3390/fractalfract7010015

Chicago/Turabian Style

Khandakar, Mostafizar, and Kuldeep Kumar Kataria. 2023. "Some Compound Fractional Poisson Processes" Fractal and Fractional 7, no. 1: 15. https://doi.org/10.3390/fractalfract7010015

Article Metrics

Back to TopTop