1. Introduction
Di Crescenzo et al. [
1] introduced and studied a fractional counting process that performs
k kinds of jumps of amplitude
with positive rates
, respectively. We call it the generalized fractional counting process (GFCP) and denote it by
,
. It is defined as a counting process whose state probabilities
satisfy the following system of fractional differential equations:
with initial condition
Here,
is the Caputo fractional derivative defined as (see [
2])
and its Laplace transform is given by (see [
2], Equation (5.3.3))
For
, the GFCP reduces to the generalized counting process (GCP)
(see [
1]). For
, 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
be the inverse stable subordinator; that is, the first passage time of a stable subordinator
. A stable subordinator
is a one-dimensional Lévy process with non-decreasing sample paths. It is known that (see [
1])
where
denotes equality in the distribution and
is independent of
.
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
, let
be a Poisson process with intensity
. Jánossy et al. [
8] considered a composed process
with
. The probability mass function (pmf) of
where
is given by (see [
8], Equation (2.18))
Its equivalent version is given by (see [
8], Equation (2.22))
where
Let
be a sequence of independent and identically distributed random variables such that
for all
. Consider a compound Poisson process
where
is a Poisson process with intensity
that is independent of
.
For a suitable choice of
and
’s, the compound Poisson process
is equal in distribution to a counting process introduced and studied by Freud and Rodriguez [
9], namely, the Bell–Touchard process (BTP)
. For
and
,
where
,
they have shown that
For
,
, the process
is equal in distribution to BTP (see [
9]); that is,
. Therefore, the pmf
of BTP is given by
where
is given in (
5).
For
,
where
, the compound Poisson process
reduces to a counting process introduced and studied by Sendova and Minkova [
10], namely, the Poisson-logarithmic process (PLP). We denote it by
. It is defined as
As an application, they considered a risk process in which the PLP is used to model the claim numbers.
For
,
where
,
, the compound Poisson process
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
. It is defined as
If
, 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].
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 is said to be a BTP with parameters , if
(a) ;
(b) it has independent and stationary increments;
(c) for and small enough such that as , its state transition probabilities are given by It follows that the state probabilities
,
of BTP satisfy the following system of differential equations:
with initial conditions
and
,
.
Remark 1. On taking , for all and letting , 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 of BTP satisfy It is known that the GCP is equal in distribution to the following weighted sum of
k independent Poisson processes (see [
6]):
where
’s are independent Poisson processes with intensity
’s. On taking
for all
and letting
, we get
which agrees with the result obtained by Freud and Rodriguez [
9]. As
,
almost surely, we have
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 is a martingale with respect to a natural filtration .
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
respectively. The BTP exhibits the overdispersion property as
for
.
The characteristic function of BTP can be obtained by taking
for all
and letting
in Equation (
12) of Kataria and Khandakar [
6]. It is given by
Therefore, its Lévy measure is given by where ’s are Dirac measures.
Remark 2. For fixed s and large t, the correlation function of BTP has the following asymptotic behaviour: 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
,
whose state probabilities
satisfy the following system of fractional differential equations:
with initial conditions
and
,
.
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 for all and letting , 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
,
of FBTP satisfies
with
. On taking the Laplace transform in the above equation and using (
3), we get
where
denotes the Laplace transform of
. Thus,
On taking the inverse Laplace transform and using (
12), we get
Remark 4. On taking in (27), we get the pgf of BTP. Further, from (27), we can verify that the pmf sums up to one; that is, . The next result gives a time-changed relationship between the BTP and its fractional variant, FBTP.
Theorem 1. Let , , be an inverse stable subordinator independent of the BTP . Then Proof. Let
be the density of
. Then,
which agrees with (
27). This completes the proof. □
Remark 5. Let be a random process whose distribution is given by the folded solution of the following Cauchy problem (see [17]):with for and for . It is known that the density functions of and coincide (see [18]). Hence,where is independent of the BTP. The random process becomes a reflecting Brownian motion for as Equation (29) reduces to the following heat equation: Therefore, is equal in distribution to BTP at a Brownian time; that is, , .
In view of (
8) and (
28), it follows that the FBTP is equal in distribution to the following compound fractional Poisson process:
where
is a TFPP with intensity
independent of the sequence of independent and identically distributed random variables
. 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
of (
29) is given by (see [
3]):
where
is the Wright function defined as follows:
Let
be the folded solution to (
29).
Theorem 2. The pmf of FBTP is given bywhere and is given in (5). Proof. From (
30) and (
33), we have
We use (
9) and (
32) in the above equation to obtain
On using the following result (see [
20], Equation (2.13)):
the proof follows. □
Remark 7. An equivalent form of the pmf of BTP can be obtained from (6). It is given bywhere 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: The pmf of TFPP with intensity
is given by (see [
20], Equation (2.5))
We recall that
’s are independent of
in (
31). Thus, for
, we have
where
is the total number of claims of
j units and
Again, as
’s are independent and identically distributed, we have
where we have used (
8). On substituting (
40) into (
37), we get an equivalent expression for the pmf of FBTP in the following form:
The pmf (
38) can be written in the following equivalent form by using Lemma 2.4 of Kataria and Vellaisamy [
21]:
where
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:
The FBTP exhibits overdispersion as for all .
Theorem 3. The FBTP exhibits the LRD property.
Proof. From (
44) and (
45), we get
On using (
14)–(
16) for fixed
s and large
t, we get
where
As , it follows that the FBTP has the LRD property. □
Remark 8. For a fixed , the increment process of FBTP is defined as It can be shown that the increment process 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
for all
and letting
in Proposition 4 of Kataria and Khandakar [
6].
Proposition 3. Let , be the rth factorial moment of FBTP. Then, The proof of the next result follows on using (23), the self-similarity property of
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 be the first waiting time of FBTP. Then, the distribution of is given bywhich coincides with the first waiting time of TFPP with intensity (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
,
for all
and letting
, 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 , of PLP satisfy The pgf (
18) can be rewritten as
It follows that the PLP is equal in distribution to a weighted sum of independent Poisson processes; that is,
where
is a Poisson process with intensity
. Thus,
where we have used
,
almost surely.
In view of (
4) and (
46), the pmf of PLP is given by
where
and
is given in (
5).
Using (
6), the pmf of PLP can alternatively be written as
where
is given in (
7).
The next result gives a martingale characterisation for the PLP.
Proposition 6. The process is a martingale with respect to a natural filtration .
Let
and
. From (
10), it follows that the PLP is a Lévy process. Its Lévy measure can be obtained by taking
for all
and letting
in Equation (
13) of Kataria and Khandakar [
6]. It is given by
where
’s are Dirac measures. Its mean, variance and covariance are given by
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
,
, whose state probabilities
satisfy the following system of differential equations:
with initial conditions
and
,
.
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 for all and letting , the System (1) reduces to System (50). Thus, the FPLP is a limiting case of the GFCP. Further, on taking , 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
,
of FPLP satisfies
with
. On taking the Laplace transform in the above equation and using (
3), we get
On taking inverse Laplace transform and using (
12), we get
Remark 11. On taking in (51), we get the pgf of PLP given in (18). Further, from (51) we can verify that the pmf sums up to one; that is, . The following time-changed relationship between the PLP and FPLP holds, whose proof follows similar lines to that of Theorem 1:
where the PLP is independent of the inverse stable subordinator
,
. In view of Remark 5, we have
where
is independent of
.
Remark 12. In view of (10) and (52), we note that the FPLP is equal in distribution to the following compound fractional Poisson process:where is a TFPP with intensity λ independent of the sequence of independent and identically distributed random variables . 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 of FPLP is given bywhere and 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:where is given in (7). For
, we get
where
is given in (
39).
As
’s are independent and identically distributed, we have
where we have used (
10). Substituting (
58) in (
56), we get an equivalent expression for the pmf of the FPLP in the following form:
The pmf (
57) can be written in the following equivalent form by using Lemma 2.4 of Kataria and Vellaisamy [
21]:
where
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 of FPLP is given by 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:
The FPLP exhibits overdispersion as for all .
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
,
for all
and letting
, 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 , of GPAP satisfy The pgf (
20) can be expressed as
It follows that the GPAP is equal in distribution to a weighted sum of independent Poisson processes; that is,
where
is a Poisson process with intensity
. Thus,
where we have used
,
almost surely. On substituting
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
where
and
is given in (
5).
Using (
6), the pmf of GPAP can alternatively be written as
where
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
for all
and letting
in Equation (
13) of Kataria and Khandakar [
6]. It is given by
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
,
, whose state probabilities
satisfy the following system of differential equations:
with initial conditions
and
,
.
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 for all and letting , System (1) reduces to System (65). Thus, the FGPAP is a limiting case of the GFCP. Further, on taking , 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
,
of FGPAP satisfies
with
. On taking the Laplace transform in the above equation and using (
3), we get
On taking the inverse Laplace transform and using (
12), we get
Remark 17. On taking in (66), we get the pgf of GPAP given in (20). Further, from (66) we can verify that the pmf sums up to one; that is, . The following time-changed relationship holds between the GPAP and FGPAP:
where the GPAP is independent of
,
. Further,
where
is independent of
.
Remark 18. In view of (11) and (67), we note that the FGPAP is equal in distribution to the following compound fractional Poisson process:where is a TFPP with intensity λ independent of . 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 of FGPAP is given by 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: Again, if we use (64) in the proof of Theorem 5, then we can obtain the following: For
, we get
where
is given in (
39).
As
’s are independent and identically distributed, we have
where we have used (
11). Substituting (
74) into (
72), we get an equivalent expression for the pmf of FGPAP in the following form:
The pmf (
73) can be written in the following equivalent form by using Lemma 2.4 of Kataria and Vellaisamy [
21]:
where
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
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 of FGPAP is given by 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:
The FGPAP exhibits overdispersion as for all .
Remark 21. The FGPAP has the LRD property, and the increment process of FGPAP exhibits the SRD property.