ABSTRACT
In this paper, we analyse piecewise deterministic Markov processes (PDMPs), as introduced in Davis (1984). Many models in insurance mathematics can be formulated in terms of the general concept of PDMPs. There one is interested in computing certain quantities of interest such as the probability of ruin or the value of an insurance company. Instead of explicitly solving the related integro-(partial) differential equation (an approach which can only be used in few special cases), we adapt the problem in a manner that allows us to apply deterministic numerical integration algorithms such as quasi-Monte Carlo rules; this is in contrast to applying random integration algorithms such as Monte Carlo. To this end, we reformulate a general cost functional as a fixed point of a particular integral operator, which allows for iterative approximation of the functional. Furthermore, we introduce a smoothing technique which is applied to the integrands involved, in order to use error bounds for deterministic cubature rules. We prove a convergence result for our PDMPs approximation, which is of independent interest as it justifies phase-type approximations on the process level. We illustrate the smoothing technique for a risk-theoretic example, and compare deterministic and Monte Carlo integration.
KEYWORDS: Risk theory, piecewise deterministic Markov process, quasi-Monte Carlo methods, phase-type approximations, dividend maximisation
MATHEMATICS SUBJECT CLASSIFICATION (2010): 60J25, 91G60, 65D32
1. Introduction
Many models in risk theory can be formulated as piecewise deterministic Markov processes (PDMPs) – a general class of finite-variation sample path Markov processes introduced by Davis (1984). This applies, among others, to the classical Cramér–Lundberg model, the renewal risk models, and multi-portfolio models recently introduced by Albrecher & Lautscham (2015). Moreover, PDMPs are sufficiently general to allow for non-constant model parameters, i.e. quantities such as the hazard rate or the premium rate may be state dependent. Examples of PDMPs and their control in the field of insurance mathematics are, e.g. Dassios & Embrechts (1989), Embrechts & Schmidli (1994), Schäl (1998), Rolski (1999), Cai et al. (2009), Leobacher & Ngare (2016), and Eichler et al. (2017).
The general theory of PDMPs is well developed, see for example the monographs by Davis (1993), Jacobsen (2006), or Bäuerle & Rieder (2011) for general results on PDMPs and their optimal control. More specialised contributions to the control theory of PDMPs can be found in Davis (1993), Lenhart & Liaot (1985), Costa & Davis (1989), Dempster & Ye (1992), Almudevar (2001), Forwick et al. (2004), Bäuerle & Rieder (2010), Costa & Dufour (2013), or Davis & Farid (1999) for viscosity solutions of associated Hamilton–Jacobi–Bellman equations, and Colaneri (2017) for a general comparison principle for solutions to control problems for PDMPs.
For the numerical treatment of (control) problems for PDMPs, however, only problem-specific solutions have been provided. A standard approach is to link expected values representing a quantity of interest in the problem to the solution of an associated integro-(partial) differential equation, see, e.g. Asmussen & Albrecher (2010). In only very few cases is it possible to derive an explicit solution to this integro-(partial) differential equation. Requiring an explicit solution typically restricts the complexity of the model significantly. One possibility is to solve the integro-(partial) differential equation numerically. This carries all the intricacies and difficulties of a combined numerical method for differential and integral equations. Alternatively one can apply crude Monte Carlo methods, see, e.g. Riedler (2013). Those methods, while robust, are limited in speed by the Monte Carlo convergence rate. Another – highly sophisticated – approach uses quantisation of the jump distribution, see de Saporta et al. (2016).
In this article we concentrate on particularly easy to implement methods similar to Monte Carlo. The aim is to adapt the problem in a way that also allows for deterministic numerical integration algorithms such as quasi-Monte Carlo (QMC). QMC has been applied successfully to problems in risk theory, see Tichy (1984), Coulibaly & Lefèvre (2008), Siegl & Tichy (2000), Albrecher & Kainhofer (2002), and Preischl et al. (2018). It should be noted that the finiteness of the total variation needed for the convergence estimate (Albrecher & Kainhofer 2002, Theorem 1) has not been proven.
We would like to highlight two features of our approach. Inspired by Albrecher & Kainhofer (2002), we reformulate a general cost functional as a fixed point of a particular integral operator, which allows for iterative approximation of the functional. In terms of numerical integration this means that we get a high-dimensional integration problem of fixed dimension, where the dimension is a multiple of the number of iterations. Having a fixed dimension is required for the application of standard QMC or other deterministic cubature rules.
The application of QMC requires some degree of regularity of the integrand. Only in rare cases these will be satisfied automatically. The examples from risk theory considered here lead to non-smooth integrands. For these situations, we introduce a smoothing technique which, in its simplest case, leads to integrands. From the earlier considerations, we obtain deterministic error bounds for those. We prove convergence in distribution of the ‘smoothed processes’ to the original ones, which implies convergence of the corresponding expected values for every initial value of the process. In Section 2.1 we even obtain uniform convergence with respect to the initial value in a particular setup from risk theory.
Our convergence result has an additional benefit for a typical situation in risk-theoretic modelling. In the literature on the analysis of ruin probabilities, or more generally, on Gerber–Shiu functions, the assumption of a claim size distribution of mixed exponential or phase-type form is quite common. Apart from the possibility to obtain explicit expressions for quantities of interest in such setups, this modelling approach is motivated by the fact that the class of phase-type distributions is dense in the class of distributions with support on , see Rolski (1999, Theorem 8.2.3). Under mild assumptions on the claim size distribution we want to approximate, our convergence result applies and justifies the phase-type approximation procedure even on the process level. Furthermore, efficient and easy to implement numerical methods for the computation of important targets such as Gerber-Shiu functions and expected discounted future dividend payments of an insurance company are of particular importance when models become more general and hence also more complicated. This makes our contribution valuable from both the analytical and the numerical point of view.
We would like to emphasise that the methods presented here per se do not provide solutions to optimal control problems, which is the main application of PDMPs in risk theory. However, the integration algorithms as introduced here can be used in a policy iteration procedure for calculating costs associated with a fixed policy.
The paper is structured as follows. In Section 2 we recall the definition of a PDMP and provide some risk-theoretic examples. In Section 3 we derive the fixed point approach for valuation of a cost functional of a PDMP. Section 4 reviews deterministic numerical integration of possibly multivariate functions. Subsequently, Section 5 is devoted to the aforementioned smoothing procedure, and presents a stability result. Section 6 contains an application of the smoothing to one of the risk-theoretic examples and a comparative study of deterministic and Monte Carlo integration for this example.
2. Piecewise deterministic Markov processes
In this section we first define PDMPs. Then we give a couple of examples of practical interest.
A PDMP is a continuous-time stochastic process with (possibly random) jumps, which follows a deterministic flow, e.g. the solution of an ordinary differential equation (ODE), between jump times. We will not give the most general definition of PDMPs here, but instead refer to the monograph by Davis (1993). For a subset A of we denote by , and its interior, closure, and boundary, respectively. We write for the Borel σ-algebra on A.
Definition 2.1
Let . A function is called a flow on A, if
ϕ is continuous,
for all ;
for all and all it holds that if and then .
For fixed , let . Then the function is called a trajectory of the flow.
If ϕ is a flow on A, then we write and .
Thus consists of the points on the boundary of A from which the trajectory moves into immediately, and consists of the points on the boundary of A to which a trajectory moves from without passing other points on the boundary in-between. Furthermore, we write .
Remark 2.2
The classical example of a flow arises through ODEs. Let be Lipschitz continuous. By the classical Picard–Lindelöf theorem on existence and uniqueness of solutions of ODEs we have that for every there exists a continuously differentiable function such that and for all . For we define . The function ϕ defines a flow on . If , then the restriction of ϕ to is a flow on A.
Definition 2.3
Let K be a finite set and let be a function which satisfies that, for every , and is a flow on with .
The state space of a PDMP is the measurable space defined by and .
The flow of a PDMP is defined by .
The active boundary of the PDMP is defined by . Furthermore, we define a σ-algebra on by .
The jump intensityλ of a PDMP is defined by a family of functions with measurable and bounded for all .
The jump kernelQ of a PDMP is a function such that is - measurable for every , and is a probability measure on for every with .
We call the triple the local characteristics of a PDMP.
Given a state space and local characteristics of a PDMP we define the function by
Definition 2.4
Let be a state space and let be local characteristics of a PDMP, let , and let be a probability space. A piecewise deterministic Markov process starting in x is a stochastic process which satisfies the following. There exists a sequence of random variables with and a.s. and a.s. for all such that
it holds -a.s. that ,
for all , , and for with it holds -a.s. that ,
for all it holds -a.s. that
for all and all it holds -a.s. that
Theorem 2.5
Let be a state space and let be local characteristics of a PDMP, let . There exist a probability space and a stochastic process such that X is a PDMP starting in x with state space E and local characteristics . Furthermore, X has the strong Markov property.
Proof.
The proof of Theorem 2.5 for a more general setup that also allows for the possibility of explosions and countable K can be found in Davis (1993, Section 2.25).
Figure 1 illustrates a path of a PDMP.
Figure 1.
Illustration of a PDMP.
Let be a function. For all we denote by the function which satisfies for all that . It is not hard to see that f is measurable if and only if is measurable for every . We say that f is n-times continuously differentiable, if for every there exists an open set with and an n-times continuously differentiable function such that . We write for the space of n-times differentiable functions on E and for the space of functions in for which all derivatives are bounded. Moreover, is the space of functions in for which all derivatives vanish at infinity.
Further, for , a PDMP X, and we write .
In the remainder of this section we provide some illustrative examples from risk theory. For other examples and applications in different fields we refer to Davis (1993), de Saporta et al. (2012), and Riedler (2013).
2.1. Examples
2.1.1. Classical Cramér–Lundberg model
Let be a stochastic process given by
| (1) |
where , is a homogeneous Poisson process with intensity , is a family of positive i.i.d. random variables with distribution function , and for all . A usual assumption in this kind of model is the independence of and N. In risk theory the process X represents a standard model for the surplus of an insurance portfolio. A quantity of interest is the probability of X ever becoming negative, i.e. we are interested in ℙ(τ<∞) , where . The model translates into a PDMP via
,
, ,
and , and ,
, .
- For , , and ,
for , and ,
where we have used the notation for all and . For , any definition for Q will do, since the jump intensity is 0 there, but the above definition is provided for definiteness.
2.1.2. Cramér–Lundberg model with dividend payments
A classical modification of the model from Section 2.1.1 is the introduction of a dividend barrier at level b>0. Then, once the surplus reaches the barrier, the incoming premium rate is immediately distributed as a dividend. Furthermore, if the process starts above b, the excess is distributed as a lump sum dividend, such that . A typical quantity of interest is the expected value of discounted future dividend payouts until ruin of the company, which is given by
| (2) |
where is a preference-based discount factor and . The model translates into a PDMP via
,
, , ,
and , and , and ,
, , .
- For , , and ,
for , for , and
for . Finally, for .
Note that only initial values translate to a viable initial value for the PDMP. However, this is sufficient for determining for all via (2).
2.1.3. Cramér–Lundberg model with time dependent dividend barrier
In Albrecher & Kainhofer (2002) the model from Section 2.1.2 is further extended to include a time dependent barrier of the form
where , m>1. The quantity of interest is again the expected value of discounted future dividend payments until the time of ruin, i.e.
for , where again and is a preference-based discount factor. The model translates into a PDMP via
,
, , ,
and , and , and ,
, , .
- For , , and ,
for , for , and
for . Finally, for .
2.1.4. Cramér–Lundberg model with loan
In Dassios & Embrechts (1989) the model from Section 2.1.2 is modified such that the insurance company is not ruined when the surplus hits zero, but has the possibility to take up a loan at an interest rate . The time of ruin is given by . The corresponding quantity of interest is
for , where is a preference-based discount factor. The model translates into a PDMP via
,
, , , , ,
and , and , is the flow of the ODE at and , and , and ,
, , , , .
- For , , and ,
for , for , and
for . Finally, for , and for .
2.1.5. Multidimensional Cramér–Lundberg model
In Albrecher & Lautscham (2015) a two-dimensional extension of the model in Section 2.1.2 is studied. The basis are independent surplus processes modelling two insurance portfolios , , where and are compound Poisson processes with intensities and jump size distributions . Furthermore, are barriers. As a new feature, the drift of the component at the barrier is added to the other component's drift, causing faster growth of the latter. Dividends are only paid when both surplus processes have reached their individual barriers. We show how the model translates into a PDMP, namely
The flow is given by
and for all , . It remains to describe the jump behaviour. We get deterministic ‘jumps’ at the active boundaries of which do not manifest themselves as jumps of the process, i.e. for and similar for the other active boundaries. Since each surplus process is a compound Poisson process with drift, jumps in the components occur due to realisations of independent identically distributed exponential random variables (independence implies that mutual jumps occur with probability zero). The two-dimensional process thus jumps at the minimum of the individual jump times. This means that we have a constant jump intensity for k=1,2,3,4, and . If a jump occurs at time , it happens with probability in the first surplus process with jump size distribution , and with probability in the second surplus process with jump size distribution . It remains to describe the jump kernel for the jumps from . To this end define, for and , and ,
Furthermore,
A quantity of interest in this model is again the expected value of discounted future dividend payments until the time of ruin of one of the portfolios,
| (3) |
for , , with , and being a preference-based discount factor.
3. Iterated integrals and a fixed point approach
In this section we derive a method for numerical approximation of the quantities of interest appearing in the models introduced in the previous section. We rewrite the quantity of interest as a sum of integrals with fixed dimension and an error term that goes to zero exponentially fast with increasing dimension of the integral. This allows for the use of deterministic integration rules. The starting point for the derivation of this integral representation is the observation that the quantity of interest is a fixed point of a certain integral operator associated to the PDMP.
Definition 3.1
Suppose there exists a set such that for all it holds that , and for all and all . We call a cemetery of the PDMP.
Definition 3.2
Let a PDMP be given and let be a cemetery of the PDMP. A running reward function is a measurable function satisfying . A terminal cost function is a measurable function satisfying . The cost functional corresponding to is defined by
(4) where .
Let be the first jump time. Equation (4) can be rewritten as follows,
Since X is a PDMP and hence a strong Markov process, this yields with , defined by
| (5) |
Recall that for every it holds that and denote the corresponding density by . With this, the function and the operator admit representations as integrals,
Note that corresponds to the expected discounted rewards collected before the first jump at time when starting in x. represents the expected discounted rewards from time onwards conditional on the event . Iterating the above steps times leads to
| (6) |
Lemma 3.3
Let and be bounded, for all assume that the functions are bounded by and for all let . Then for all and for all it holds that and, in particular, it holds that uniformly in .
Proof.
The boundedness of ℓ and Ψ implies that also V is bounded by . Using the strong Markov property and Equation (5) we have by induction on n,
(7) where we used in the last equality. Recall that . For every let be an Erlang-distributed random variable. Combining this with (7) we get that
The latter expression converges to zero as uniformly in .
Combining Lemma 3.3 with (6) results in the error estimate
| (8) |
Finally, we obtain the following representation,
| (9) |
In (9) we denote by the family of inter-jump times and by the family of post-jump locations.
Remark 3.4
Solving the integral brings several advantages compared to a crude Monte Carlo approach. First, (9) is an integral with a fixed dimension. Hence, it can be approximated using deterministic integration rules like QMC, for which deterministic error bounds are available. Second, the bias of restricting oneself to a fixed number of jumps can be estimated uniformly in using the bias estimate in Lemma 3.3. Third, rare events like surviving a large number of jumps are – in this formulation – not rare in the sense that it is unlikely to draw such a realisation, which has the effect of importance sampling.
4. Cubature rules for -functions
In order to obtain convergence estimates for numerical integration methods such as QMC methods or other cubature rules, we need more regularity of the integrands than they admit in many practical applications. For example, we may need to bound a certain norm of the Hessian matrix of the integrand. In Section 5, we will rewrite the problem introduced in Section 3 so that the integrand is a function which satisfies , or more generally for some . We outline two different methods for treating such integrands f by cubature rules.
4.1. QMC methods
QMC methods are equal-weight cubature rules with M deterministically chosen integration nodes. Let the integrand satisfy . In order to obtain a convergence estimate for numerical integration of f using QMC, we require a so-called Koksma–Hlawka type inequality. The original Koksma–Hlawka inequality bounds the integration error of a QMC rule by the product of the variation of the integrand (in the sense of Hardy and Krause) and the so-called discrepancy of the integration node set (see, e.g. Niederreiter (1992, Chapter 2)). We remark, however, that we cannot easily apply the classical Koksma–Hlawka inequality in this paper, as we cannot rely on the integrands to have bounded variation in the sense of Hardy and Krause. Hence, we are going to resort to a variant of the Koksma–Hlawka inequality which was recently proven in Pausinger & Svane (2015). Let be a QMC rule using M integration nodes . Then by Pausinger & Svane (2015, Theorem 3.12) we have
| (10) |
where , is the Hessian matrix of f at , denotes the usual operator norm, and where is the isotropic discrepancy of the integration node set,
where denotes the Lebesgue measure on the . Now let . In Niederreiter (1992, Chapter 2) it is shown that
where by we denote the star discrepancy of , defined as
where denotes for . It is well known that common point sequences that are employed in QMC methods, such as Sobol' sequences or Halton sequences, have a star discrepancy of order (and it is known that this order can, if at all, only be improved with respect to the exponent of the log-term). Hence, by using, e.g. Sobol' points in a QMC method for numerically integrating a -function, we cannot expect an error that converges to zero faster than .
As we shall see below, this order of magnitude can, with respect to the disadvantageous dependence on d, not be improved further for -functions. However, there is room for improvement if we make additional smoothness assumptions on the integrand.
4.2. Product rules
In Hinrichs et al. (2017) it is shown that, by using products of Gauss rules, one can obtain the following result. Let be such that for some . Then, by using a product rule of -point Gauss quadrature rules, one obtains
| (11) |
where , and where
where denotes the (weak) partial derivative of order for . A d-fold Gauss product rule as described above uses points in total, and hence yields a convergence order of . It is known due to Bakhvalov (1959) that this convergence order is best possible. For the special case , we only obtain a relatively small improvement over the bound implied by (10). However, there is an additional advantage in the bound (11). By requiring that the function f satisfies additional smoothness assumptions, namely that for some which is possibly larger than 2, we obtain an improved convergence rate. Hence, we face a trade-off between imposing a higher degree of smoothness on the integrand f to obtain a higher accuracy in the quadrature rule, and the error we make by smoothing the integrand to that extent. It is therefore likely that the method needs to be fine-tuned on a case-by-case basis. In practice, product rules often cannot be applied, since, for example, for integrating a d=1024-variate integrand using only integration nodes per coordinate requires a point set consisting of integration nodes. To overcome the latter problem, it might be useful to apply the theory of weighted integration as introduced in Sloan & Woźniakowski (1998), possibly combined with truncation (see, e.g. Kritzer et al. (2016)) or multivariate decomposition methods (see, e.g. Kuo (2010)). A detailed analysis of these approaches applied to the present problem is left open for future research.
5. Smoothing of the integrand
The integrand in (9) is not necessarily a -function. Therefore, in this section we provide a technique for smoothing the integrand in order to apply convergence results for integration rules that are described in Section 4.
The piecewise construction of the process described in Definition 2.4 leads to the situation that for is a function of and . In particular, all subsequent pre-jump locations depend on all previous post-jump locations and jump times, via ϕ and λ. Consequently, regularity of the integrand depends on regularity of the flow ϕ and the intensity function λ. The analysis in this section is restricted to the case where the flow originates from autonomous ODEs, i.e. for all there exist Lipschitz continuous functions such that . General results from the literature on ODEs, see, e.g. Grigorian (2009), yield that the derivatives can be described by so-called associated first- and second-order variational equations for which one requires to be a -function.
For the density of the inter-jump times to be we need that . Also we need , and since they appear in the integral defining .
A serious problem with respect to smoothness arises if the PDMP model allows for jumps from the active boundary. Suppose and . Then, conditional on , the time of the next jump is distributed as , where T has distribution function . But in general neither nor will depend smoothly on y, even if has arbitrarily high regularity. We are not aware of a general remedy for this problem. However, for all PDMP models put forward in Section 2.1, the jumps from the active boundary do not constitute jumps of the original problem. In the following subsection we describe by example how PDMPs can be approximated by PDMPs that do not allow for jumps from the boundary.
Concerning the jump kernel Q, it is hard to state general sufficient regularity conditions. An exemplary favourable situation arises if the jump kernel Q admits a -density in the sense that for all and all . In the one-dimensional examples from risk theory in Sections 2.1.1–2.1.4, this condition is satisfied and for the two-dimensional example in Section 2.1.5 we present a smoothing technique in Section 5.2.
5.1. Smoothing of the flow
Consider the example from Section 2.1.4 without dividend barrier. We can describe the problem alternatively with a state space consisting of three components:
,
, , ,
- is determined by an autonomous ODE of the form ,
for some . The function is given by and , and by and ,(12) , , .
- For ,
Here, is not differentiable in 0. However, we may smoothen this discontinuity using a ‘smoothened Heaviside function’. Note that .
Definition 5.1
Let . We call a function a -Heaviside function, if
for y<−1,
for y>1,
h is non-decreasing,
,
h is κ-times continuously differentiable.
Lemma 5.2
Let and let be a piecewise -function with discontinuity in i.e. let there exist -functions with on and on . Let h be a -Heaviside function. For every define by . Then,
for every
for every
for all it holds that
for all it holds that .
Proof.
The elementary proof is left to the reader.
There are various possible choices for the smoothing: from the left and from the right . Figure 2 depicts these three possible smoothings for a function with a discontinuity in . A concrete example for a function h that satisfies the above requirements is given by
| (13) |
For every , a smoothed version of the function defined in (12) is given by
We can finally formulate a PDMP corresponding to the new model, where the flow has been smoothened,
,
, , ,
and , and , ;
, , ;
- for ,
Figure 2.
Illustration of smoothing a piecewise -function with a discontinuity in .
Note that . Since the dividend barrier b is never reached, we also have to smoothen the reward function in a way that the region where dividends are paid can be reached, i.e. . We will show convergence of the corresponding value functions in Section 6.
5.2. Smoothing of jump measures
We give an example for a class of jump measures that can be approximated by measures leading to -integrands in (9).
Let be the state space of a PDMP and let be its local characteristics. Let the probability kernel Q satisfy the following assumption.
Assumption 5.3
We assume that
there exists a positive integer n such that for every , and every , there exist sets such that
for every there exists such that , for every it holds that is a connected -manifold,for every and every the mapping from to , is ,
for all it holds that ,
for every and every there exists a -mapping such that for all it holds thatwhere denotes the m-dimensional Lebesgue measure,
for every and every the mapping from to , is .
Note that Assumption 5.3(1) implies that, for every , is a -manifold, and that for all with we have .
Under Assumption 5.3 we have for and for that
where for all . For the integral in (9) this implies that we have iterated sums for each jump, which increases the complexity for large numbers of jumps. Instead, we may write the sum as an integral over ,
where and . However, with this ‘trick’ we have lost the property of the integrand being . So, using again our smoothened Heaviside function , we can smoothen the indicator functions,
This expression, considered as a function of x, is as it is a composition of -functions.
Theorem 5.4
In the setup of this section we have for all that
Proof.
It holds that
For our concrete example of h the first integral can be estimated by . Thus
yielding the statement of the theorem.
Now, consider the example from Section 2.1.5. Here, a jump can be either a jump in -direction or a jump in -direction, i.e.
In this case we can find functions such that and for uniform random variables . Hence,
Remark 5.5
If we consider, say, i=100 in (9), then we get a very high number of terms to be summed in the integral. However, we always assume ε to be very small, in particular, we may assume that per jump at most two, and in most situations only one, of the terms are nonzero.
5.3. Convergence
In this section we prove a general convergence result for approximated versions of PDMPs with smoothing as above. We will exploit results on Feller processes presented in Kallenberg (2002, Chapter 19) and Ethier & Kurtz (1986, Chapters 4.2 and 4.8). For the remainder of this section we make the following assumptions:
for all ,
,
for all the mapping is continuous.
With this, we can utilise the following theorem.
Theorem 5.6 Davis 1993, Theorem 27.6 —
If for all and for all and if the mapping is continuous for all then the PDMP is a Feller process.
We give an example for a class of jump kernel which comprises the jump kernels of the one-dimensional examples in Section 2.1 and which satisfies (iii).
Example 5.7
Let be an interval for every and let be a bounded density function on . Furthermore, let, for every and every , . Then for every it holds that
Since, by assumption, all are continuous and all are intervals, it holds that is bounded by and goes to zero as for almost all .
Therefore, bounded convergence implies that the above sum converges to 0. From this the desired continuity follows.
The generator of X in the setup of the current section is given by
| (14) |
where for we define by . Note that for this means . So the domain of the generator consists of all functions in which are continuously differentiable along the trajectories of the flow on all components, cf. Ethier & Kurtz (1986, p. 8), and .
Definition 5.8 Kallenberg 2002, Chapter 19 —
Let A be a closed linear operator with domain of definition . A core for A is a linear subspace such that the restriction has closure A.
Proposition 5.9 Kallenberg 2002, Proposition 19.9 —
If is the generator of a Feller semigroup then any dense, -invariant subspace is a core for .
Proposition 5.10
Under the assumptions made in this section, and for being defined as in (14), it is true that is a core for .
Proof.
We certainly have that is a dense subspace of . Furthermore, the transition semigroup satisfies for all , see (Davis 1993, p.76), since the PDMP is Feller by Theorem 5.6.
We have to prove that is invariant under . We show this by proving that, for all , . For k=0 this is just the Feller property. Since all derivatives are bounded in the -norm, differentiation and application of commute, i.e. for all . Consequently, is a core for .
Theorem 5.11 Kallenberg 2002, Theorem 19.25 —
Let X be a Feller process in E with semigroup and generator with domain and for all let be Feller processes in E with semigroups and generators with domains . Let D be a core for . Then the following statements are equivalent:
for every there exists a sequence with for all and such that and uniformly as
for all t>0 we have as in the strong operator topology,
for every and every it holds that as uniformly for
if in E, then in .
Remark 5.12
The notion of weak convergence of processes in Item (iv) needs an explanation. Here, is the space of càdlàg functions, equipped with the Skorokhod topology, see Ethier & Kurtz (1986, p. 118). With this topology, is a Borel subset of a Polish space and for a sequence of -valued random variables (i.e. processes in E with càdlàg paths), and a -valued random variable X we have if and only if for all bounded Skorokhod continuous functions , see Kurtz & Protter (1996, Section 6) or Ethier & Kurtz (1986, Chapter 3). We do not wish to go into the details of the notion of Skorokhod continuity. It suffices to mention that from Kurtz & Protter (1996, Section 8, Example 8.1) we know that for given continuous functions and , and fixed , the following functionals exhibit this property:
Lemma 5.13
Let be continuous and bounded, then the functional
is Skorokhod continuous.
Proof.
Let σ denote the Skorokhod metric on . Let . There exists t>0 such that . By Skorokhod continuity of there exists an such that for all it holds that, if then . Therefore,
We remark that a function is continuous if and only if is continuous for all k. In particular, every indicator function of a component is continuous.
We are in the position to show that cost functionals indeed commute with weak limits of PDMPs.
Lemma 5.14
Let X be a PDMP and be a sequence of PDMPs on the same state space E and with the same cemetery and let and be a running reward function and a terminal cost function, respectively. Assume that both ℓ and Ψ are continuous and bounded. Assume further that for all and and in .
Then
as .
Proof.
Recall that on , and on , so that and . Thus by Lemma 5.13 the mappings and are Skorokhod continuous.
Moreover, if ω is a path of the PDMPs, then it holds that for all , such that . This completes the proof.
Also, finite time ruin probabilities, i.e. the probability of the PDMP reaching the cemetery before a given time horizon t, commute with weak limits, as we show next.
Lemma 5.15
Let X be a PDMP and be a sequence of PDMPs on the same state space E and with the same cemetery . Assume further that for all and and in .
Then for all .
Proof.
Consider a functional of the same form as in Remark 5.12, with . Since the cemetery is the union of only entire , and is therefore a union of connected components of E, the indicator function of the cemetery is continuous. Therefore if we define and , , we have for all and for all .
The following theorem specifies conditions under which Theorem 5.11 is applicable in the PDMP setting.
Theorem 5.16
Let X be a Feller PDMP with local characteristics and let be Feller PDMPs with local characteristics . Further, let the following assumptions hold:
and as uniformly in
for all
(15) in E.
Then in .
Proof.
Let , , and be the domains of the generators , , and , corresponding to and X, respectively. For we have
By Proposition 5.10, is a core for all generators involved. For every we set for all , such that trivially as . Next, observe that we have for all ,
(16)
(17) Since , , and Q are probability measures on , and since, by assumption, and uniformly in , the terms in (16) converge to zero. The term in (17) can be estimated as follows,
The latter expression tends to zero, since for all it was assumed that (15) holds, and since uniformly in . Thus, Item (i) of Theorem 5.11 holds. This implies that Item (iv) of Theorem 5.11 holds. The latter is equivalent to the assertion of this theorem.
Remark 5.17
Note that in the Feller case we can move to another external state only due to a purely random jump, i.e. a jump determined by for or Q. Therefore, if we assume uniform convergence of the local characteristics across all state components, and in particular also in the sense of (15), then the result of Theorem 5.16 still holds.
Since uniform convergence of the local characteristics and the assumption that are essential in the proof of Theorem 5.16, we need an alternative argument for situations with an active boundary or for situations in which a smooth approximation fails. A prototypical univariate example for both cases is a drift of the form for some . Here one faces either a discontinuity or a subdivision of into two state components, i.e. , with a continuous drift on each component. For a specific example, we find a method for dealing with this particular situation in the next section.
6. Application to the Cramér–Lundberg model with loan
In this section we apply our smoothing technique to the example presented in Section 2.1.4 and calculate the quantity of interest using different numerical integration methods. In this setup, solves the ODE and , with
In the setup of Section 2.1.4, the quantity of interest is the expected value of discounted future dividend payments until the time of ruin. The cemetery is given by , the running reward ℓ is given by , and the terminal cost is for . For , , let
Since g is not differentiable in 0 and for all with , we replace g by a smoothed version and we also modify ℓ accordingly. For let
Observe that , that and that . For define the PDMP so that for all its flow is the solution to the ODE with . Apart from that all specifications are the same as for the original PDMP X. In addition, we replace by
where h can be chosen as in (13) and we define
We aim at computing for the smoothed process, in order to observe how (9) simplifies in this example. By the definition of the cemetery, for all with . For with , any jumps bigger than lead to the cemetery, so we only need to integrate over jump sizes up to . Thus, we get that
Moreover, since λ is constant on it holds for all with , that , where is as in Section 2.1.1. For with we get
| (18) |
where the functions , solve and .
Thus depends on and , whereas depends on and . However, this depensdence has been suppressed in (18) for the sake of readability.
Assumption 6.1
The jump distribution admits a density , with .
In what follows, suppose that Assumption 6.1 holds. A variable substitution and , where , . We then put
which leads to
| (19) |
Due to the recursive structure of the functions , the Jacobi matrix of the substitution has lower triangular shape, such that its determinant is the product of the diagonal elements. For being able to reasonably apply (10) we need to bound the Hessian of the integrand. If for example the jump size distribution is the Gamma distribution with parameters , i.e. , then this boils down to the condition and , which implies that the integrand is bounded in . In the original problem statement this corresponds to an additional integrability condition on the jump size distribution. Finally, for of the form we have
Remark 6.2
In Section 5.3 the stability, with respect to the smoothing parameter ε of the considered functional of the process, is dealt with in a fairly general setting. Unfortunately, because of the discontinuity of the drift g in the present example, we cannot achieve uniform convergence of the smoothed drift around the barrier level b, whereas point-wise convergence is achieved.
Theorem 6.3
In the setup of this section, the following assertion holds true. There exists C>0 such that .
Proof.
Recall that
where and .
It is readily checked that and that for all . Hence we get from Kamke (1964, Theorem 8, p. 111) that
for all and for all , where
Since and coincide on and , we can refine this estimate to get
for all , where is the time needed for the trajectory to cross . Note that yields for all , and hence . For we have by construction that . In total we get
(20) Since , it holds that for sufficiently small .
Recall that is the time of the first jump of X conditional on . Since the jump intensity is constant on , is exponentially distributed with intensity . Hence, we can write
and analogously for . We write and for . Therefore,
(21) For and it holds that for , and
for . On the other hand, we have that, for and , for , and
for . Using for all , we get , such that
for all . Hence,
Now , where , see (20). With this, the first term in (21) can be estimated by
(22) Next, observe that (we remind the reader that the states are denoted by , which is why in the following the terms are not to be confused with the integration variables used in and below (18)),
Combining this with (20), we can estimate the second term in (21) by
(23)
(24) Furthermore, since
the third term in (21) can be estimated as follows,
(25) Taking the supremum over in (21) and using (22), (23), and (25) we obtain that
for some constant C and for sufficiently small ε. Thus,
which completes the proof.
6.1. Numerical experiment
We now solve the example presented above numerically. We set the following parameter values. The initial value of the PDMP , the premium income rate c=5, the credit rate , the intensity of the Poisson process , the jump size distribution is for all given by with , and the discount rate . With this, the optimal dividend threshold according to Dassios & Embrechts (1989) is b=3.24289. Furthermore, we set the smoothing parameter . For computing the flow it is enough to solve the corresponding ODE once and to store the solution for repeated use.
We implemented Monte Carlo (random), QMC with the Sobol' sequence (Sobol), and QMC with a scrambled version of the Halton sequence (scrambled Halton), where scrambling refers to a permutation of digits (see, e.g. Owen (2000)). The Sobol' point generator we used was taken from Frances Y. Kuo's homepage Kuo (n.d.) and is based on Joe & Kuo (2008).
The reference solution was calculated using Monte Carlo with sample paths and d=1024, meaning that the maximum number of jumps we allow for is 512. In our plots we show the results plotted over an increasing number of integration nodes .
Figure 3 shows the estimated standard deviation (root mean square error) of the estimation, which is calculated by using 50 repetitions with randomly shifted versions of our integration nodes.
Figure 3.
The estimated standard deviation of the estimation.
Funding Statement
Peter Kritzer P. Kritzer is supported by the Austrian Science Fund (FWF): Project F5506-N26, which is part of the Special Research Program ‘Quasi-Monte Carlo Methods: Theory and Applications’. P. Kritzer is partially supported by the National Science Foundation (NSF) [grant number DMS-1638521] to the Statistical and Applied Mathematical Sciences Institute. P. Kritzer, G. Leobacher, and M. Szölgyenyi gratefully acknowledge the partial support of the Erwin Schrödinger International Institute for Mathematics and Physics (ESI) in Vienna under the thematic programme ‘Tractability of High Dimensional Problems and Discrepancy’. G. Leobacher is supported by the Austrian Science Fund (FWF): Project F5508-N26, which is part of the Special Research Program ‘Quasi-Monte Carlo Methods: Theory and Applications’. M. Szölgyenyi is supported by the AXA Research Fund grant ‘Numerical Methods for Stochastic Differential Equations with Irregular Coefficients with Applications in Risk Theory and Mathematical Finance’ and supported by the Vienna Science and Technology Fund (WWTF): Project MA14-031.
Acknowledgments
The authors would like to thank an anonymous referee for useful comments on how to improve the presentation of the results. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation. Part of this article was written while G. Leobacher was affiliated with the Institute of Financial Mathematics and Applied Number Theory, Johannes Kepler University Linz, Altenbergerstraße 69, 4040 Linz, Austria. A part of this article was written while M. Szölgyenyi was affiliated with the Institute of Statistics and Mathematics, Vienna University of Economics and Business, Welthandelsplatz 1, 1020 Vienna, Austria.
Disclosure statement
No potential conflict of interest was reported by the authors.
References
- Albrecher H. & Kainhofer R. (2002). Risk theory with a nonlinear dividend barrier. Computing 68(4), 289–311. doi: 10.1007/s00607-001-1447-4 [DOI] [Google Scholar]
- Albrecher H. & Lautscham V. (2015). Dividends and the time of ruin under barrier strategies with a capital-exchange agreement. Anales del Instituo de Actuarios Espanoles 21(3), 1–30. [Google Scholar]
- Almudevar A. (2001). A dynamic programming algorithm for the optimal control of piecewise deterministic Markov processes. SIAM Journal on Control and Optimization 40(2), 525–539. doi: 10.1137/S0363012999364474 [DOI] [Google Scholar]
- Asmussen S. & Albrecher H. (2010). Ruin probabilities, 2nd ed Advanced Series on Statistical Science and Applied Probability Hackensack, NJ: World Scientific. [Google Scholar]
- Bakhvalov N. S. (1959). On the approximate calculation of multiple integrals. Vestnik MGU, Series Mathematical, Mechanics & Astronomy Physical Chemistry 4, 3–18. In Russian. [Google Scholar]
- Bäuerle N. & Rieder U. (2010). Optimal control of piecewise deterministic Markov processes with finite time horizon. Modern Trends in Controlled Stochastic Processes: Theory and Applications 123, 143. [Google Scholar]
- Bäuerle N. & Rieder U. (2011). Markov decision processes with applications to finance. Heidelberg: Universitext, Springer. [Google Scholar]
- Cai J., Feng R. & Willmot G. E. (2009). On the expectation of total discounted operating costs up to default and its applications. Advances in Applied Probability 41(2), 495–522. doi: 10.1239/aap/1246886621 [DOI] [Google Scholar]
- Colaneri K., Eksi Z., Frey R. & Szölgyenyi M. (2017). Optimal liquidation under partial information with price impact. arXiv:1606.05079
- Costa O. L. & Davis M. H. A. (1989). Impulse control of piecewise-deterministic processes. Mathematics of Control, Signals, and Systems (MCSS) 2(3), 187–206. doi: 10.1007/BF02551384 [DOI] [Google Scholar]
- Costa O. L. & Dufour F. (2013). Continuous average control of piecewise deterministic Markov processes. New York: Springer. [Google Scholar]
- Coulibaly I. & Lefèvre C. (2008). On a simple quasi-Monte Carlo approach for classical ultimate ruin probabilities. Insurance: Mathematics and Economics 42(3), 935–942. [Google Scholar]
- Dassios A. & Embrechts P. (1989). Martingales and insurance risk. Communications in Statistics. Stochastic Models 5(2), 181–217. doi: 10.1080/15326348908807105 [DOI] [Google Scholar]
- Davis M. H. A. (1984). Piecewise-deterministic Markov processes: A general class of nondiffusion stochastic models. Journal of the Royal Statistical Society Series B 46(3), 353–388. With discussion. [Google Scholar]
- Davis M. H. A. (1993). Markov models and optimization. Monographs on Statistics and Applied Probability London: Chapman & Hall. [Google Scholar]
- Davis M. H. A. & Farid M. (1999). Piecewise-deterministic processes and viscosity solutions. In W. M. McEneaney, G. George Yin, and Q. Zhang, eds., Stochastic Analysis, Control, Optimization and Applications. Boston: Springer. P. 249–268.
- de Saporta B., Dufour F. & Zhang H. (2016). Numerical methods for simulation and optimization of piecewise deterministic markov processes. Mathematics and Statistics Series London: ISTE; Hoboken, NJ: John Wiley & Sons, Inc. [Google Scholar]
- de Saporta B., Dufour F., Zhang H. & Elegbede C. (2012). Optimal stopping for the predictive maintenance of a structure subject to corrosion. Journal of Risk and Reliability 226(2), 169–181. [Google Scholar]
- Dempster M. A. H. & Ye J. J. (1992). Necessary and sufficient optimality conditions for control of piecewise deterministic Markov processes. Stochastics: An International Journal of Probability and Stochastic Processes 40(3–4), 125–145. [Google Scholar]
- Eichler A., Leobacher G. & Szölgyenyi M. (2017). Utility indifference pricing of insurance catastrophe derivatives. European Actuarial Journal 7(2), 515–534. doi: 10.1007/s13385-017-0154-2 [DOI] [PMC free article] [PubMed] [Google Scholar]
- Embrechts P. & Schmidli H. (1994). Ruin estimation for a general insurance risk model. Advances in Applied Probability 26(2), 404–422. doi: 10.2307/1427443 [DOI] [Google Scholar]
- Ethier S. N. & Kurtz T. G. (1986). Markov processes. Wiley Series in Probability and Mathematical Statistics: Probability and Mathematical Statistics New York: John Wiley & Sons, Inc. [Google Scholar]
- Forwick L., Schäl M. & Schmitz M. (2004). Piecewise deterministic Markov control processes with feedback controls and unbounded costs. Acta Applicandae Mathematica 82(3), 239–267. doi: 10.1023/B:ACAP.0000031200.76583.75 [DOI] [Google Scholar]
- Grigorian A. (2009). Ordinary differential equation. Lecture notes. https://www.math.uni-bielefeld.de/grigor/odelec2009.pdf
- Hinrichs A., Novak E., Ullrich M. & Woźniakowski H. (2017). Product rules are optimal for numerical integration in classical smoothness spaces. Journal of Complexity 38, 39–49. doi: 10.1016/j.jco.2016.09.001 [DOI] [Google Scholar]
- Jacobsen M. (2006). Point process theory and applications. Probability and its Applications Boston, MA: Birkhäuser Boston, Inc. [Google Scholar]
- Joe S. & Kuo F. Y. (2008). Constructing Sobol' sequences with better two-dimensional projections. SIAM Journal of Scientific Computation 30, 2635–2654. doi: 10.1137/070709359 [DOI] [Google Scholar]
- Kallenberg O. (2002). Foundations of modern probability, 2nd Probability and its Applications (New York) New York: Springer-Verlag. [Google Scholar]
- Kamke E. (1964). Differentialgleichungen. I. Gewöhnliche differentialgleichungen. 5th ed Leipzig: Akademische Verlagsgesellschaft. [Google Scholar]
- Kritzer P., Pillichshammer F. & Wasilkowski G. W. (2016). Very low truncation dimension for high dimensional integration under modest error demand. Journal of Complexity 35, 63–85. doi: 10.1016/j.jco.2016.02.002 [DOI] [Google Scholar]
- Kuo F. Y. (n.d.). F. Y. Kuo's homepage. http://web.maths.unsw.edu.au/∼fkuo/sobol/index.html. Last visited 14/12/2017.
- Kuo F. Y., Sloan I. H., Wasilkowski G. W. & Woźniakowski H. (2010). Liberating the dimension. Journal of Complexity 26, 422–454. doi: 10.1016/j.jco.2009.12.003 [DOI] [Google Scholar]
- Kurtz T. G. & Protter P. E. (1996). Weak convergence of stochastic integrals and differential equations I. In D. Talay and L. Tubaro, eds., Probabilistic Models for Nonlinear Partial Differential Equations. Berlin, Heidelberg: Springer.
- Lenhart S. & Liaot Y. (1985). Integro-differential equations associated with optimal stopping time of a piecewise-deterministic process. Stochastics: An International Journal of Probability and Stochastic Processes 15(3), 183–207. doi: 10.1080/17442508508833356 [DOI] [Google Scholar]
- Leobacher G. & Ngare P. (2016). Utility indifference pricing of derivatives written on industrial loss indexes. Journal of Computational and Applied Mathematics 300, 68–82. doi: 10.1016/j.cam.2015.11.028 [DOI] [Google Scholar]
- Niederreiter H. (1992). Random number generation and quasi-Monte Carlo methods. CBMS-NSF Regional Conference Series in Applied Mathematics, Philadelphia: SIAM.
- Owen A. B. (2000). Monte Carlo, quasi-Monte Carlo, and randomized quasi-Monte Carlo. In H. Niederreiter and J. Spanier, eds., Monte Carlo and Quasi- Monte Carlo Methods 1998. Springer. P. 86–97.
- Pausinger F. & Svane A. M. (2015). A Koksma–Hlawka inequality for general discrepancy systems. Journal of Complexity 31, 773–793. doi: 10.1016/j.jco.2015.06.002 [DOI] [Google Scholar]
- Preischl M., Thonhauser S. & Tichy R. F. (2018). Integral equations, quasi-monte carlo methods and risk modeling. In J. Dick, F. Y. Kuo and H. Woźniakowski, eds., Contemporary Computational Mathematics – A Celebration of the 80th Birthday of Ian Sloan, Vol. 1, 2. Cham: Springer. P. 1051–1074.
- Riedler M. G. (2013). Almost sure convergence of numerical approximations for piecewise deterministic Markov processes. Journal of Computational and Applied Mathematics 239, 50–71. doi: 10.1016/j.cam.2012.09.021 [DOI] [Google Scholar]
- Rolski T., Schmidli H., Schmidt V. & Teugels J. (1999). Stochastic processes for insurance and finance. Wiley Series in Probability and Statistics New York: John Wiley & Sons. [Google Scholar]
- Schäl M. (1998). On piecewise deterministic Markov control processes: Control of jumps and of risk processes in insurance. Insurance: Mathematics and Economics 22(1), 75–91. [Google Scholar]
- Siegl T. & Tichy R. F. (2000). Ruin theory with risk proportional to the free reserve and securitization. Insurance: Mathematics and Economics 26(1), 59–73. [Google Scholar]
- Sloan I. H. & Woźniakowski H. (1998). When are quasi-Monte Carlo algorithms efficient for high dimensional integrals? Journal of Complexity 14, 1–33. doi: 10.1006/jcom.1997.0463 [DOI] [Google Scholar]
- Tichy R. F. (1984). Über eine zahlentheoretische Methode zur numerischen Integration und zur Behandlung von Integralgleichungen. Osterreichische Akademie der Wissenschaften Mathematisch-Naturwissenschaftliche Klasse. Sitzungsberichte. Abteilung II 193(4–7), 329–358. [Google Scholar]



