## Abstract

This paper is devoted to the study of the number of customers in infinite-server systems driven by Hawkes processes. In these systems, the self-exciting arrival process is assumed to be represented by a Hawkes process and the self-exciting service process by a state-dependent Hawkes process (sdHawkes process). Under some suitable conditions, for the \(\mathrm{Hawkes/sdHawkes/\infty }\) system, the Markov property of the system is derived. The joint time-dependent distribution of the number of customers in the system, the arrival intensity and the server intensity is characterized by a system of differential equations. Then, the time-dependent results are also deduced for the \(\mathrm{M/sdHawkes/\infty }\) system.

## Introduction

In fields like probability, operations research, management science and industrial engineering, there are phenomena that are well described by infinite-server systems. Many authors, in literature, assume that in most queueing systems the arrival process of customers is a Poisson process and the service times have an exponential distribution. This implies that the future evolution of the system only depends on the present situation.

However, in real-word problems, the future evolution of the arrival process and/or the service process is often influenced by the past events. This is essentially observed, during periods of suffering, for instance, earthquakes, crime and riots and social media trend (Daw and Pender [8] and Rizoiu et al. [20]) and in the financial market, incorporating some kind of contagion effect (Aït-Sahalia et al. [1]). Recently, the same phenomenon is observed to describe the temporal growth and migration of COVID-19 (see Chiang et al. [6], Escobar [12], Garetto et al. [13]). The work by Eick et al. [9], and recent works by Daw and Pender [8] and Koops et al. [16], motivated us to consider the service process as a state-dependent Hawkes (sdHawkes) process.

This article studies an infinite-server system wherein the dynamics of the arrival process and the service process are governed by Hawkes processes. The self-exciting property of Hawkes process is well known for its efficiency in reproducing jump clusters due to the dependence of the conditional event arrival rate, or intensity, on the counting process itself. It can be considered that this type of infinite-server system has the potential to represent, for instance, the evolution of the number of people visiting a shopping centre or the number of clients visiting a website. In both these cases, the intensity function for the arrival process cannot be considered as a constant, and the rate of new arrival events increases with the occurrence of each event. Similarly, it is observed that the intensity function for the service process may be state-dependent and every new service completion excites further service process.

Errais et al. [11] derived the Markov property for the two-dimensional process consisting of a Hawkes process and its intensity having exponential kernel. We generalize their approach investigating the Markov property for the three-dimensional process consisting of the number of customers in the system, the arrival intensity and the service intensity.

To achieve this, we have a problem that must be solved. On a filtered probability space, \((\varOmega , {\mathscr {F}},\{{{\mathscr {F}}}_t\}_{t \ge 0},P)\), we consider the filtrations generated by the arrival process, \(\{{{\mathscr {F}}}^M_t\}_{t \ge 0}\), the filtrations generated by the service process \(\{{{\mathscr {F}}}^S_t\}_{t \ge 0}\), and the filtrations generated by the number of the customers in the system \(\{{{\mathscr {F}}}^N_t\}_{t \ge 0}\). Then, we note that \({{\mathscr {F}}}^N_t \subseteq {{\mathscr {F}}}^M_t \vee {{\mathscr {F}}}^S_t\), which implies that every \({{\mathscr {F}}}^M_t \vee {{\mathscr {F}}}^S_t\)-martingale is a \({{\mathscr {F}}}^N_t\)-martingale. But, the vice versa is not always true, namely, a \({{\mathscr {F}}}^N_t\)-martingale is not always a \({{\mathscr {F}}}^M_t \vee {{\mathscr {F}}}^S_t\)-martingale, in general. This is the classical problem of the enlargement of filtrations. An assumption in this framework is the Immersion property, which allows us to get that any \({{\mathscr {F}}}^N_t\)-martingale is also a \({{\mathscr {F}}}^M_t \vee {{\mathscr {F}}}^S_t\)-martingale (see Bielecki et al. [4], Jeanblanc et al. [15], and Tardelli [21]). Consequently, following the existing literature, the Immersion property is assumed in the present paper.

Generalizing some results of Daw and Pender [8] and Koops et al. [16], we derive the transient or time-dependent behaviour of the infinite-server system with Hawkes arrivals and sdHawkes services. This is the main contribution of the present paper.

The paper is organized as follows. In Sect. 2, we introduce Hawkes processes and their properties. In Sect. 3, we describe an infinite-server system with Hawkes arrivals and sdHawkes services. We discuss the moments of the arrival process and its intensity. We derive the Markov property of the process describing the number of customers in the system using the Immersion property. In Sect. 4, we obtain the joint transient or time-dependent distribution of the system size, the arrival and the service intensity processes for the Hawkes/sdHawkes/\(\infty \) system. Afterwards, we deduce the above time-dependent results for a M/sdHawkes/\(\infty \) system. Finally, in Sect. 5, we present concluding remarks.

## Hawkes processes

Hawkes processes constitute a particular class of multivariate point processes having numerous applications throughout science and engineering. These are processes characterized by a particular form of stochastic intensity vector, that is, the intensity depends on the sample path of the point process.

Let \((\varOmega , {\mathscr {F}},\{{{\mathscr {F}}}_t\}_{t \ge 0},P)\) be a filtered probability space, where \(\{{{\mathscr {F}}}_t\}_{t \ge 0}\) is a given filtration satisfying the usual conditions. On this space, a counting process \(M = \{M_t, t \ge 0 \}\) is defined, and \(\{{{\mathscr {F}}}^M_t\}_{t \ge 0}\), where \({\mathscr {F}}^M_t = \sigma \{M_u, u \le t\}\), is its associated filtration, and stands for the information available up to time *t*.

### Definition 1

The conditional law of *M* is defined, for \(\Delta t \rightarrow 0\), as

For a Hawkes process, the intensity \(\lambda _t\) is a function of the past jumps of the process itself, and, in general, assumes the representation

The function \(\varphi (\cdot )\), called *excitation function*, is such that \(\varphi (t) \ge 0\), for \(t \ge 0\). It represents the size of the impact of jumps and belongs to the space of \(L^1\)-integrable functions.

When \(\varphi (t)=0\), *M* is a counting process with constant intensity. This means that a Poisson process is obtained as a special case of a Hawkes process.

Following the existing literature (see Daw and Pender [8]), we restrict our attention to a function \(\varphi (\cdot )\) defined by an exponential decay kernel. To this end, let the arrival intensity be governed by the dynamics

where \(\lambda ^*\) represents an underlying stationary arrival rate, called baseline intensity. The constant \(r > 0\) describes the decay of the intensity as time passes after an arrival, and \(B_t\), for each \(t \ge 0\), is a positive random variable representing the size of the jump in the intensity upon an arrival. The solution to Eq. (2), given \(\lambda _0\), which is the initial value of \(\lambda _t\), is obtained as

Taking \(\{t_i\}_{i >0}\) as the sequence of the jump times of *M*, and if the self-exciting term is such that \(\varphi (t - t_i) \equiv B_{t_i} e^{-r(t-t_i)} \), then Eq. (1) coincides with Eq. (3).

### Remark 1

Note that, the Hawkes process *M* itself does not have the Markov property. However, assuming that the excitation function \(\varphi (\cdot )\) has an exponential decay kernel, it is possible to prove that the bi-dimensional process \((\lambda , M)\) is a Markov process (Errais et al. [11]). Furthermore, the explosion is avoided by ensuring the condition given by \({\mathbb {E}}[B_t] < r\), (Daw and Pender [8]).

## The model: Hawkes/sdHawkes/\(\infty \) system

The arrival process of the system is the Hawkes process *M* acting as an input process to an infinite-server system, having arrival intensity given by Eq. (3), and \(\{t_i\}_{i \ge 0}\) as the sequence of the arrival times.

For the service requirement, we consider \(S = \{S_t, t \ge 0\}\), another Hawkes process having serving intensity \(\mu _t\), with initial intensity \(\mu _0 > 0\), baseline intensity \(\mu ^*\) and, exponential excitation function. Taking \(N_t\) as the number of customers in the system at *t*, for a constant \(s > 0\), and for \(t > 0\),

For \(i>0\), \(\tau _i\) denotes the time epoch of *i*th customer departure after the service completion, and \(C_{\tau _i}\) is a positive random variable representing the size of that jump. The number of customers in the system whose service is completed on, or before, time *t* is given by \(S_t\) and \(N_t = M_t - S_t\).

This form of the serving intensity \(\mu _t\) allows us to take into account the crowding of the system, which is the number of customers in the system at time *t*, and about the experience gained by the server process, which is given by the Hawkes structure. This is called as a *state-dependent Hawkes process*, sdHawkes process (Li and Cui [17] and Morario-Patrichi and Pakkanen [18]).

To the best of our knowledge, this is the first time in literature that Hawkes processes are introduced to model the experience in arrivals and services of an infinite-server system. Furthermore, we note that, at time *t*, the sdHawkes process for service will start as new, whenever the number of customers in the system become one, i.e. \(N_t =1\). Therefore, we call this queueing model as Hawkes/sdHawkes/\(\infty \) in Kendall’s notation.

Since the service process is state-dependent, for the stability of the infinite-server system (Daw and Pender [8]), only the stability for the arrival process is needed, which means that \({\mathbb {E}}[B_t] < r\), for all *t*.

### Moments of \(M_t\) and \(\lambda _t\)

This subsection is devoted to derive the results regarding the moments of the process *M* and its intensity \(\lambda \). These results can be proved taking into account the results of Dassios and Zhao [7] and generalizing those obtained in Daw and Pender [8], Section 2.

### Proposition 1

Given a Hawkes process \((M_t, \lambda _t)\), with dynamics given by Eq. (3) and \({\mathbb {E}}[B_t] < r\), for all \(t \ge 0\),

### Remark 2

In general, for the moments of \(M_t\) and for the moments of \(\lambda _t\) of order *n*, we have to recursively solve the following system of differential equations

for positive integer values of *n* and *k* and with \({{{\mathscr {S}}}} := \{(i, j): i = 0, \ldots , n, j = 0, \ldots , k, (i,j) \ne (n,k)\}\).

### Corollary 1

If \({\mathbb {E}}[B_t] = r\), the differential equations given in Daw and Pender [8] imply that

Note that by taking the limit as \({\mathbb {E}}[B_t] \rightarrow r\) in Eqs. (5), (6), (7) and (8), the same results of Corollary 1 are achieved.

### Proposition 2

Assuming that \({\mathbb {E}}[B_t] < r\), and taking \(\displaystyle \lim _{t \rightarrow \infty } {\mathbb {E}}[B_t] = {\hat{B}}_1\) and \(\displaystyle \lim _{t \rightarrow \infty } ({\mathbb {E}}[B_t] )^2 = {\hat{B}}_2\), we have

and \({\mathbb {E}}[M_t] \rightarrow \infty \) as \(t \rightarrow \infty \).

### Markov property of the Hawkes/sdHawkes/\(\infty \) system

Recall that, if the excitation function of a Hawkes process is exponential, then the process jointly with its intensity is a Markov process. In order to characterize \({{{\mathscr {L}}}}\left( N_t, \lambda _t, \mu _t \right) \), the law of \(N_t\), the Hawkes arrival intensity \(\lambda _t\) and the state dependent Hawkes server intensity \(\mu _t\), we have to prove the Markov property of the Hawkes/sdHawkes/\(\infty \) system. To this end, we need some preliminaries. Let the processes *M*, *S* and *N* be defined on the same filtered probability space \((\varOmega , {\mathscr {F}},\{{{\mathscr {F}}}_t\}_{t \ge 0},P)\). Given the sub \(\sigma \)-algebras of \({\mathscr {F}}_t\)

we observe that \({{{\mathscr {F}}}}^{M, S}_t\) contains, also, all the information related to the process \(N = \{N_t, t \ge 0\}\) until time *t*.

Note that, \({\mathscr {F}}^M_t \subseteq {\mathscr {F}}^{M,S}_t\) and that \({\mathscr {F}}^S_t \subseteq {\mathscr {F}}^{M,S}_t\). Consequently, every \({\mathscr {F}}^{M,S}_t\)-martingale is a \({\mathscr {F}}^M_t\)-martingale and, at the same time, every \({\mathscr {F}}^{M,S}_t\)-martingale is a \({\mathscr {F}}^S_t\)-martingale. But, in general, it is not true that a \({\mathscr {F}}^M_t\)-martingale is a \({\mathscr {F}}^{M,S}_t\)-martingale and that a \({\mathscr {F}}^S_t\)-martingale is a \({\mathscr {F}}^{M,S}_t\)-martingale. This is a classical topic in this context, the so-called problem of the enlargement of filtrations. An exciting example is Azema’s martingale, see Subsection 4.3.8 in Jeanblanc et al. [15]. Hence, to overcome this difficulty, we assume a property for the class of martingales, that is the Immersion property as given below.

### Definition 2

When the filtration \({\mathscr {F}}^M := \{{{\mathscr {F}}}^M_t\}_{t \ge 0}\) is immersed in the filtration \({\mathscr {F}}^{M, S} := \{{{\mathscr {F}}}^{M, S}_t\}_{t \ge 0}\), it means that any \({\mathscr {F}}^M_t\)-martingale is a \({\mathscr {F}}^{M,S}_t\)-martingale. In this case, we say that \({\mathscr {F}}^M\) satisfies the __Immersion property__ with respect to the filtration \({\mathscr {F}}^{M, S}\). Also, let the filtration \({\mathscr {F}}^S := \{{{\mathscr {F}}}^S_t\}_{t \ge 0}\) satisfy the Immersion property with respect to \({\mathscr {F}}^{M, S}\).

### Remark 3

Given the arrival process *M* and the service process *S*, we have that the sub \(\sigma \)-algebras \({\mathscr {F}}^M_t\) and \({\mathscr {F}}^S_t\) generated by these processes, respectively, are such that \({\mathscr {F}}^M_t \subseteq {\mathscr {F}}^{M,S}_t\) and \({\mathscr {F}}^S_t \subseteq {\mathscr {F}}^{M, S}_t\).

By Eq. (4), we are able to deduce that the service process *S* can be represented in terms of a function of *M* driven by another Hawkes process *R*, which is independent of *M*. Since the processes *M* and *R* are independent, any \({\mathscr {F}}^M_t\)-martingale is a \({\mathscr {F}}^M_t \vee {\mathscr {F}}^R_t\)-martingale and any \({\mathscr {F}}^S_t\)-martingale is a \({\mathscr {F}}^M_t \vee {\mathscr {F}}^R_t\)-martingale. Taking into account that \({\mathscr {F}}^{M, S}_t \subseteq {\mathscr {F}}^M_t \vee {\mathscr {F}}^R_t\), we get that

which implies that any \({\mathscr {F}}^M_t \vee {\mathscr {F}}^R_t\)-martingale is a \({\mathscr {F}}^{M, S}_t\)-martingales. As a conclusion, all the \({\mathscr {F}}^M_t\)-martingales and all the \({\mathscr {F}}^S_t\)-martingales are \({\mathscr {F}}^{M, S}_t\)-martingales. Greater details on this topic can be found in Aksamit and Jeanblanc [2], Jeanblanc et al. [15] and, more recently, in Calzolari and Torti [5].

### Lemma 1

By Eq. (3), for any positive value of \(\Delta t\), we get that

By Eq. (4), if \(N_t\) remains constant between *t* and \(t + \Delta t\), we have that

Moreover, for a negligible value of \(\Delta t\) and between *t* and \(t+\Delta t\), if there are no new arrivals and there are no service completions, we get that

Recalling that the self-exciting terms of the intensities \(\lambda _t\) and \(\mu _t\) are defined by exponential decay kernels, even though the processes *M* and *S* does not have the Markov property themselves, we are able to show that \((M, S, \lambda , \mu )\) is a Markov process (Errais et al. [11]). To get the Markov property of \((M, S, \lambda , \mu )\), we derive its Dynkin formula, in the next Proposition, taking into account that this formula is a direct consequence of the strong Markov property and, hence, it builds a bridge between differential equations and Markov processes, (see, for instance, Øksendal [19], Sect. 7.4).

### Proposition 3

Let \({\mathscr {A}}\) be an operator acting on a suitable function *f*, with continuous partial derivatives with respect to \(\lambda \) and \(\mu \), such that

where

and *B* and *C* are random variables such that \(P(B > 0) = 1\) and \(P(C > 0) = 1\). If, for \(t \le T\),

the following Dynkin formula holds

### Proof

For the sake of completeness, we prove this result along similar line as in Errais et al. [11]. For a fixed time *t*, \((M_t, S_t, \lambda _t, \mu _t)\) has right-continuous paths of finite variation. Hence,

Note that \(m^\lambda _t = M_t - \int _0^t \lambda _v \mathrm{d}v\) is a \({\mathscr {F}}^M_t\)-martingale, and by the Immersion property, \(m^\lambda _t\) is also a \({\mathscr {F}}^{M, S}_t\)-martingale, and, moreover, \(m^\mu _t = S_t - \int _0^t \mu _v \mathrm{d}v\) is a \({\mathscr {F}}^{M, S}_t\)-martingale. Hence, we are able to rewrite the summation in Eq. (11) as

The integrability condition on the predictable integrand guarantees that

is a martingale (Theorem 8, Chapter II of Bremaud [3]). As a conclusion, we get that \(f(M, S, \lambda , \mu )\) is a semi-martingale having a unique decomposition given by a sum of a predictable process with finite variation and a martingale, and we are able to write that

Since the right-hand side is a martingale, so is the process defined by the left-hand side, which results to the formula given by Eq. (10). \(\square \)

Under all the assumptions made so far, the infinitesimal generator of the process \((M, S, \lambda , \mu )\) acting on a function \(f(M, S, \lambda , \mu )\) is given by Eq. (9).

### Remark 4

Since \((M, S, \lambda , \mu )\) is a Markov process, and taking into account that the process \(N = M - S\), we are able to deduce that \((N, \lambda , \mu )\) is also a Markov process.

## Characterization of the law of the infinite-server systems

The joint transient distribution of \(\left( N, \lambda , \mu \right) \) is uniquely defined by the transformation

where \(t \ge 0\), \(0 \le z \le 1\), \(u \ge 0\) and \(v \ge 0\). In this section, we characterize \(\zeta \) in terms of the solution of a system of ordinary differential equations (ODEs).

### Theorem 1

Let the arrival process be a Hawkes process and let the service process be a sdHawkes process. Given the random variables *B* and *C* as defined in Proposition 3, let \(\beta (u) := {\mathbb {E}} [e^{- u B}]\) and let \(\gamma (v) := {\mathbb {E}} [e^{- v C}]\).

If \((N_t, \lambda _t, \mu _t)|_{t=0} = (0, \lambda _0, 0)\), then the couple \(\left( u(\cdot ), v(\cdot ) \right) \) solves the system of ODEs

with boundary conditions \(u(0) = u\) and \(v(0) = v\). Furthermore,

where \(\zeta \) depends on *v* through the coupling with *u* given by system of ODEs (13).

In order to prove Theorem 1, we make use of Propositions 4 and 5 given below, whose proofs are in “Appendix”.

### Proposition 4

The joint distribution of \(\left( N, \lambda , \mu \right) \), for \(t > 0\),

is such that

### Proposition 5

Taking

we have that

### Proof of Theorem 1

Recalling the definition of \(\zeta \) given in Eq. (12), which in turn implies that

and taking into account that \(F(t, -1, \lambda , \mu ) = 0\), note that

Moreover,

and

Substituting all these in Eq. (16), we obtain the partial differential equation (PDE) satisfied by \(\zeta \) as

As usual, applying the method of the characteristics, we reduce the PDE to a system of ODEs, along which the solutions are integrated from some initial data given on a suitable hypersurface.

To this end, let *z*, *u* and *v* be parameterized by *w*, \(0< w < t\), and with the boundary conditions \(z(t) = z\), \(u(t) = u\), \(v(t) = v\). A comparison with Eq. (17), taking into account the chain rule, gives us

This in turn implies that, for a real constant *c*, we are able to deduce that

where \(c = \zeta \left( 0, z(0), u(0), v(0)\right) = \zeta \left( 0, z, u, v \right) = e^{- u(0) \lambda _0}\), and

which implies Eq. (14).

Furthermore, by Eq. (17) and the chain rule written in Eq. (18), we deduce that

Recalling that \(0< w < t\), and that \(z(t) = z\),

for a real constant \(C = z \exp { \left\{ - s \mu ^* \int _0^t v(x) \ \mathrm{d}x \right\} }\), which allows us to write that

Similarly, by Eq. (17) and the chain rule written in Eq. (18), and substituting *z*(*w*), we get that

and

By substituting *t* for \(t-w\), and by taking into account that we have a change of sign in the LHS of both \(\frac{\hbox {d} u(w)}{\hbox {d}w}\) and \(\frac{\hbox {d} v(w)}{\hbox {d}w}\), we have Eq. (13), with boundary conditions \(u(0) = u\) and \(v(0) = v\). \(\square \)

### Proposition 6

Let \(v(t) = w'(t) = y_2(t)\) and \(w(t) = y_1(t)\), then the system of ODEs as given in Eq. (13) turns out to be a dynamical system such that

### Proof

In Theorem 1, for the Hawkes/sdHawkes/\(\infty \) system, we derive \(\zeta (t, z, u, v)\) by Eq. (14) where the couple \(\left( u(\cdot ), v(\cdot ) \right) \) solves the system of ODEs as given in Eq. (13). Now, let

Differentiating both sides, we have \(v(t) = w'(t)\), which implies that \(v'(t) = w''(t)\). Putting these values in Eq. (13), we get

To convert Eq. (23) into a dynamical system, let

which implies Eqs. (19), (20) and (21). \(\square \)

### Proposition 7

If the random variables *B* and *C* follow exponential distributions with parameter *a* and *b*, respectively, then Eqs. (19), (20) and (21) become such that

Furthermore, let

then we are able to write the dynamical system

### Proof

Taking into account the assumptions made on the random variables *B* and *C*, we get that

Substituting these values in Eqs. (19), (20) and (21), we get Eqs. (24), (25) and (26). Moreover, taking

the system given by Eqs. (24), (25) and (26) turns out to be

with boundary conditions

Finally, by Eq. (27), we are able to write the dynamical system as given in Eq. (28). \(\square \)

Next, we are going to deduce the results for the M/sdHawkes/\(\infty \) system.

### Theorem 2

For an M/sdHawkes/\(\infty \) system, let

where \(t \ge 0\), \(0 \le z \le 1\), \(v \ge 0\). Given the constant intensity \(\lambda _t = \lambda \), and the initial values, \((N_t, \mu _t)|_{t=0} = (0, 0)\), we get that

where

and, given the boundary condition \(v(0) = v\), \(v(\cdot )\) solves the ODE

The proof of Theorem 2 is obtained in three steps: Propositions 8 and 9 given below, whose proofs are in “Appendix”, and then the main part which is also proved in “Appendix”.

### Proposition 8

The joint distribution of \(\left( N, \mu \right) \), for \(t > 0\), and \(\lambda _t = \lambda \), positive constant,

is such that

### Proposition 9

Taking

we have that

### Remark 5

Note that, in queueing systems, the situation in which a service time follows a general distribution is more general than the situation in which a service time follows a state-dependent Hawkes process. This observation suggests to study the results obtained in Theorem 2 for the M/sdHawkes/\(\infty \) system to try to find the relations with the analogous results for an M/G/\(\infty \) system (see Eick et al. [9]). This is an interesting open research problem which could be studied in detail.

### Remark 6

Koops et al. [16] have studied a \(Hawkes/M/\infty \) system. More precisely, they obtained that

where \(u(\cdot )\) solves the ODE \(u'(w) = - r u(w) - (1 + (z-1) e^{-\mu ^* w}) \beta (u(w)) + 1\). In Theorem 1, these known results have been extended taking into account the state-dependent Hawkes service times.

### Remark 7

In Theorem 1, if \(r = s= 0\) and \({\mathbb {E}}[B_t] = {\mathbb {E}}[C_t] = 0\), Eqs. (3) and (4) are simplified and \(\lambda _t = \lambda _0 \) and \(\mu _t = N_t \mu _0\). This means that the arrival process, \(M_t\), turns out to be a Poisson process with parameter \(\lambda _0\) and, if there are \(N_t\) customers in the system at time *t*, the service time has an exponential distribution with parameter \(N_t \mu _0\), i.e. this is an \(M/M/\infty \) system. Therefore, as usual, the joint distribution is

and taking \(F(t, k, \lambda , \mu ) = F(t, k) = P[N_t = k]\)

while, for \(k = 1, 2, \ldots \)

Solving the above system of difference-differential equations, we obtain the distribution of \(N_t\), as

and by noting that

we have that

Furthermore, note that *F*(*t*, *k*), for \(t \rightarrow \infty \), turns out to be

These results of distribution of \(N_t\) and of limiting distribution coincide with the results presented in Gross et al. [14].

## Concluding remarks and open problems

Main contribution of this paper is to derive the joint time-dependent distribution of the vector process \((N, \lambda , \mu )\), given by system size, arrival and service intensity processes for the Hawkes/sdHawkes/\(\infty \) and M/sdHawkes/\(\infty \) systems. To get this task, we proved the Markov property for the vector process \((N, \lambda , \mu )\). Then, the idea is to characterize the law of the infinite server system in terms of the solution of a corresponding system of ODEs. The methodology used is inspired by Koops et al. [16], where the authors achieved the same results for a Hawkes/M/\(\infty \) system. For a M/M/\(\infty \) system, the above results are deduced directly following a classical procedure.

However, we have to take into account that, in a queueing system, if the service time follows a general distribution, then this is a more general situation than that in which the service time follows a state-dependent Hawkes process. Hence, an interesting research problem, which could be studied in detail, is to connect the results obtained for the M/sdHawkes/\(\infty \) system with the analogous results for the M/G/\(\infty \) system. More precisely, the idea is to investigate the relations between the transient behaviour of M/G/\(\infty \) system and that of M/sdHawkes/\(\infty \) system.

Taking into account that Koops et al. [16] obtained the time-dependent results for Hawkes/M/\(\infty \) system, an open problem is to study if these results could be extended for a Hawkes/G/\(\infty \) system. Instead of obtaining a solution by solving ODEs (as in Theorem 1), several methods are possible, for instance, methods such as fixed point equation in the transform domain and concepts using branching processes. Others future works could be to investigate the asymptotic behaviour of the distributions and the moments for the Hawkes/sdHawkes/\(\infty \) system.

## References

Aït-Sahalia, Y., Cacho-Diaz, J., Laeven, R.J.A.: Modeling financial contagion using mutually exciting jump processes. J. Financ. Econ.

**117**(3), 585–606 (2015)Aksamit, A., Jeanblanc, M.: Enlargement of Filtration with Finance in View. Springer, Berlin (2017)

Brémaud, P.: Point Processes and Queues: Martingale Dynamics, vol. 50. Springer, New York (1981)

Bielecki, T.R., Jeanblanc, M., Rutkowski, M.: Hedging of Credit Derivatives in Models with Totally Unexpected Default, pp. 35–100. Stochastic Processes and Applications to Mathematical Finance. World Science Publications, Hackensack, NJ (2006)

Calzolari, A., Torti, B.: Enlargement of filtration and predictable representation property for semi-martingales. Stoch. Int. J. Probab. Stoch. Process.

**88**(5), 680–698 (2016)Chiang, W.H., Liu, X., Mohler, G.: Hawkes process modeling of COVID-19 with mobility leading indicators and spatial covariates. Int. J. Forecast.

**38**(2), 505–520 (2022)Dassios, A., Zhao, H.: Exact simulation of Hawkes processes with exponentially decaying intensity. Electron. Commun. Probab.

**18**(62), 1–13 (2013)Daw, A., Pender, J.: Queues driven by Hawkes processes. Stoch. Syst.

**8**(3), 192–229 (2018)Eick, S.G., Massey, W.A., Whitt, W.: The physics of the \(M_t/G/\infty \) queue. Oper. Res.

**41**(4), 731–742 (1993)Embrechts, P., Liniger, T., Lin, L.: Multivariate Hawkes processes: an application to financial data. J. Appl. Probab.

**48**(A), 367–378 (2011)Errais, E., Giesecke, K., Goldberg, L.R.: Affine point processes and portfolio credit risk. SIAM J. Financ. Math.

**1**(1), 642–665 (2010)Escobar, J.V.: A Hawkes process model for the propagation of COVID-19: simple analytical results. EPL (Europhys. Lett.)

**131**, 68005 (2020)Garetto, M., Leonardi, E., Torrisi, G.L.: A time-modulated Hawkes process to model the spread of COVID-19 and the impact of countermeasures. Annu. Rev. Control.

**51**, 551–563 (2021)Gross, D., Shortle, J.F., Thompson, J.M., Harris, C.M.: Fundamentals of Queueing Theory, 4th ed. Wiley Series in Probability and Statistics. Wiley, India (2019)

Jeanblanc, M., Yor, M., Chesney, M.: Mathematical Methods for Financial Markets. Springer Finance, Springer, London (2009)

Koops, D., Saxena, M., Boxma, O., Mandjes, M.: Infinite-server queues with Hawkes input. J. Appl. Probab.

**55**(3), 920–943 (2018)Li, Z., Cui, L.: Numerical method for means of linear Hawkes processes. Commun. Stat. Theory Methods

**49**(15), 3681–3697 (2020)Morariu-Patrichi, M., Pakkanen, M.S.: State-dependent Hawkes processes and their application to limit order book modelling. Quant. Finance

**22**, 563–583 (2021)Øksendal, B.K.: Stochastic Differential Equations: An Introduction with Applications, 6th edn. Springer, Berlin (2003)

Rizoiu, M. A., Xie, L., Sanner, S., Cebrian, M., Yu, H., Van Hentenryck, P.: Expecting to be HIP: Hawkes intensity processes for social media popularity. In: Proceedings of the 26th International Conference on World Wide Web, pp. 735–744 (2017)

Tardelli, P.: Recursive backward scheme for the solution of a BSDE with a non-Lipschitz generator. Probab. Eng. Inf. Sci.

**31**(2), 1–19 (2017)

## Acknowledgements

The authors are grateful to the editor and the anonymous reviewers for their insightful comments, which helped in improving the paper. One of the authors (PT) gratefully acknowledges the support received from the Department of Mathematics, Indian Institute of Technology Delhi, India. This research work is supported by the Department of Science and Technology, India.

## Author information

### Authors and Affiliations

### Corresponding author

## Additional information

### Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## Appendix

### Appendix

### Proof of Proposition 4

Taking into account the observations made in Remark 4, and the results of Lemma 1, since in \((t, t + \Delta t)\), we can have a service completed with probability \(y \Delta t\), or we can have still customers in service with probability \(1 - y \Delta t\),

After elementary manipulations, we get

Then, letting \(\Delta t \downarrow 0\), we have

Taking the left-hand side, LHS, of Eq. (36) and differentiating, successively, with respect to \(\lambda \) and \(\mu \), we get

Recalling that \(P[B \le 0] = 0\), \(P[C \le 0] = 0\), then taking the right-hand side, RHS, of Eq. (36), and, again, differentiating, successively, with respect to \(\lambda \) and to \(\mu \), we get

\(\square \)

### Proof of Proposition 5

In order to transform Eq. (15) with respect to the intensities \(\lambda \) and \(\mu \), note that

and, analogously,

Moreover, recalling that \(\beta (u) := {\mathbb {E}} [e^{- u B}]\) and \(\gamma (v) := {\mathbb {E}} [e^{- v C}]\), successively we have that

and

After all the transformations we have made and rearranging, we get the claim. \(\square \)

### Proof of Proposition 8

Recalling the results achieved in Lemma 1, since in a small time interval, \((t, t + \Delta t)\), we can have a service with probability \(y \Delta t\), or we can have still customers in service with probability \(1 - y \Delta t\),

After elementary manipulations, we get

Then, letting \(\Delta t \downarrow 0\), we have

Taking LHS of Eq. (39) and differentiating with respect to \(\mu \) yields

Recalling that \(P[C \le 0] = 0\), then taking RHS of Eq. (39), and, again, differentiating with respect to \(\mu \), we get

Rearranging Eqs. (40) and (41), we get the claim. \(\square \)

### Proof of Proposition 9

Note that

Therefore, by the LHS of Eq. (34),

Recalling that \(\gamma (v) := {\mathbb {E}} [e^{- v C}]\), by the RHS of Eq. (34), we have

and

After all the transformations we made on Eq. (34), and by Eq. (42), we get the claim. \(\square \)

### Proof of Theorem 2

Recalling the definition of \(\zeta \) given in Eq. (31), which in turn implies that

note that

and

Moreover, taking into account that \(F(t, -1, \mu ) = 0\)

and

Applying all these transformations on Eq. (35), we find for \(\zeta (t, z, v)\) the PDE

Applying the method of the characteristics, as in Theorem 1, we reduce a PDE to a system of ODEs. Again, let *z* and *v* be parameterized by *w*, with the boundary conditions \(z(t) = z\), \(v(t) = v\) and \(0< w < t\). Taking into account that for the chain rule, and by a comparison with Eq. (43) we get

Again, following the same steps of Theorem 1, we get the claim. \(\square \)

## Rights and permissions

## About this article

### Cite this article

Selvamuthu, D., Tardelli, P. Infinite-server systems with Hawkes arrivals and Hawkes services.
*Queueing Syst* **101, **329–351 (2022). https://doi.org/10.1007/s11134-022-09813-3

Received:

Revised:

Accepted:

Published:

Issue Date:

DOI: https://doi.org/10.1007/s11134-022-09813-3

### Keywords

- Infinite-server systems
- Hawkes processes
- State-dependent
- Markov property
- Self-exciting

### Mathematics Subject Classification

- 60K25
- 60G55
- 60K30
- 60J75
- 60G46