Transfer of regularity for Markov semigroups
Vlad Bally, Lucia Caramellino

TL;DR
This paper investigates how regularity properties of Markov semigroups can be transferred from approximating sequences with smooth densities, under certain conditions balancing blow-up and convergence speed.
Contribution
It introduces an interpolation approach to transfer regularity from smooth approximations to the limiting Markov semigroup.
Findings
Established conditions for regularity transfer based on blow-up and convergence balance
Proved the existence of a smooth density for the limiting semigroup under these conditions
Provided a framework for analyzing regularity in Markov processes via approximation sequences
Abstract
We study the regularity of a Markov semigroup , that is, when for a suitable smooth function . This is done by transferring the regularity from an approximating Markov semigroup sequence , , whose associated densities are smooth and can blow up as . We use an interpolation type result and we show that if there exists a good equilibrium between the blow up and the speed of convergence, then and has some regularity properties.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Stochastic processes and financial applications · Mathematical Approximation and Integration
Transfer of regularity for Markov semigroups
Vlad Bally
Lucia Caramellino
LAMA (UMR CNRS, UPEMLV, UPEC), MathRisk INRIA, Université Paris-Est - [email protected] Dipartimento di Matematica, Università di Roma Tor Vergata, and INdAM-GNAMPA - [email protected]
Abstract
We study the regularity of a Markov semigroup , that is, when for a suitable smooth function . This is done by transferring the regularity from an approximating Markov semigroup sequence , , whose associated densities are smooth and can blow up as . We use an interpolation type result and we show that if there exists a good equilibrium between the blow-up and the speed of convergence, then and has some regularity properties.
Contents
Keywords: Markov semigroups; regularity of probability laws; interpolation techniques.
2010 MSC: 60J25, 46B70.
Acknowledgments. This research is partly funded by the Bézout Labex, funded by ANR, reference ANR-10-LABX-58. L.C. also acknowledges the MIUR Excellence Department Project awarded to the Department of Mathematics, University of Rome Tor Vergata. The Beyond Borders Project “Asymptotic Methods in Probability” is acknowledged by both authors.
1 Introduction
In this paper we study Markov semigroups, that is, positive semigroups , such that . The link with Markov processes is given by a family , , , of transition probability measures in such that
[TABLE]
We study here the regularity of , which is the property , , for a suitable smooth function , by transferring the regularity from an approximating Markov semigroup sequence , .
Hereafter we assume that the domain of the Markov semigroup contains the Schwartz space of the functions all of whose derivatives are rapidly decreasing. We assume that the semigroup is strongly continuous in its domain and we call its infinitesimal generator. We suppose also that the domain of contains and for every , , , and .
Let , , be a sequence of Markov semigroups:
[TABLE]
For every , we assume that satisfies the same properties as : is included in the domain of and if then , ; is strongly continuous in its domain; the domain of its infinitesimal operator contains and if .
Classical results (Trotter Kato theorem, see e.g. [14]) assert that, as , if then The problem that we address in this paper is the following. We suppose that has the regularity (density) property with and we ask under which hypotheses this property is inherited by the limit semigroup . If we know that converges to some in a sufficiently strong sense, of course we obtain But in our framework does not converge: here, can even “blow up” as . However, if we may find a good equilibrium between the blow-up and the speed of convergence, then we are able to conclude that and has some regularity properties. This is an interpolation type result.
Roughly speaking our main result is as follows. We assume that the speed of convergence is controlled in the following sense: there exists some such that for every
[TABLE]
Here is the norm in the standard Sobolev space In fact we will work with weighted Sobolev spaces, and this is an important point. And also, we will assume a similar hypothesis for the adjoint (see Assumption 2.1 for a precise statement).
Moreover we assume a “propagation of regularity” property: there exist and such that for every
[TABLE]
Here also we will work with weighted Sobolev norms. And a similar hypothesis is supposed to hold for the adjoint (see Assumption 2.2 for a precise statement).
Finally we assume the following regularity property: for every , with and for every , ,
[TABLE]
Here, are multi-indexes and are the corresponding differential operators. Moreover, , and are suitable parameters and as (we refer to Assumption 2.3). In concrete examples (jump type stochastic differential equations) is related to the lower eigenvalue of the Malliavin covariance matrix
- essentially this is of order And in order to handle the derivatives and we need to make respectively integrations by parts (which involve See also Assumption 3.6.
By (1.1)–(1.3), the rate of convergence is controlled by and the blow-up of is controlled by . So the regularity property may be lost as . However, if there is a good equilibrium between and and then the regularity is saved: we ask that for some
[TABLE]
the parameters , and being given in (1.1), (1.2) and (1.3) respectively. Then with and the following upper bound holds: for every , and , one may find some constant such that for very with and
[TABLE]
This is the “transfer of regularity” that we mention in the title and which is stated in Theorem 2.6. The proof is based on a criterion of regularity for probability measures given in [4], which is close to interpolation spaces techniques.
The regularity criterion presented in this paper is tailored in order to handle the following example (which will be treated in a forthcoming paper). We consider the integro-differential operator
[TABLE]
where is an infinite measure on the normed space such that Moreover, for a sequence , we denote
[TABLE]
and we define
[TABLE]
By Taylor’s formula,
[TABLE]
(recall that is the norm in the standard Sobolev space ). Under the uniform ellipticity assumption for every the semigroup associated to has the regularity property (1.3) with depending on the measure The speed of convergence in (1.1), with is controlled by So, if (1.4) holds, then we obtain the regularity of and the short time estimates (1.5).
The semigroup associated to corresponds to stochastic equations driven by the Poisson point measure with intensity measure , so the problem of the regularity of has been extensively discussed in the probabilistic literature. A first approach initiated by Bismut [9], Léandre [20] and Bichteler, Gravereaux and Jacod [8] (see also the recent monograph of Bouleau and Denis [10] and the bibliography therein), is done under the hypothesis that and with Then one constructs a Malliavin type calculus based on the amplitude of the jumps of the Poisson point measure and employs this calculus in order to study the regularity of A second approach initiated by Carlen and Pardoux [12] (see also Bally and Clément [6]) follows the ideas in Malliavin calculus based on the exponential density of the jump times in order to study the same problem. Finally a third approach is due to Picard [22, 23], but see also Ishikawa and Kunita [16], the contributions of Kunita [17, 18] and the recent monograph by Ishikawa [15] for many references and developments in this direction. Picard constructs a Malliavin type calculus based on finite differences (instead of standard Malliavin derivatives) and obtains the regularity of for a general class of intensity measures including purely atomic measures (in contrast with . We stress that all the above approaches work under different non degeneracy hypotheses, each of them corresponding to the specific noise that is used in the calculus. So in some sense we have not a single problem but three different classes of problems. The common feature is that the strategy in order to solve the problem follows the ideas from Malliavin calculus based on some noise contained in Our approach is completely different because, as described above, we use the regularization effect of This regularization effect may be exploited either by using the standard Malliavin calculus based on the Brownian motion or using some analytical arguments. The approach that we propose in [5] is probabilistic, so employs the standard Malliavin calculus. But anyway, as mentioned above, the regularization effect vanishes as and a supplementary argument based on the equilibrium given in (1.4) is used. We precise that the non degeneracy condition is of the same nature as the one employed by J. Picard so the problem we solve is in the same class.
The idea of replacing “small jumps” (the ones in here) by a Brownian part (that is in is not new – it has been introduced by Asmussen and Rosinski in [2] and has been extensively employed in papers concerned with simulation problems: since there is a huge amount of small jumps, they are difficult to simulate and then one approximates them by the Brownian part corresponding to See for example [1, 7, 13] and many others. However, at our knowledge, this idea has not been yet used in order to study the regularity of
The paper is organized as follows. In Section 2 we give the notation and the main results mentioned above and in Section 4 we give the proof of these results. Section 3 is devoted to some preliminary results about regularity. Namely, in Section 3.1 we recall and develop some results concerning regularity of probability measures, based on interpolation type arguments, coming from [4]. These are the main instruments used in the paper. In Section 3.2 we prove a regularity result which is a key point in our approach. In fact, it allows to handle the multiple integrals coming from the application of a Lindeberg method for the decomposition of . Finally, in Appendix A and B we prove some technical results used in the paper.
2 Notation and main results
2.1 Notation
For a multi-index we denote (the length of the multi-index) and is the derivative corresponding to that is , with . For , and two multi-indexes and , we denote by the derivative with respect to and by the derivative with respect to . Moreover, for and we denote
[TABLE]
If is not a scalar function, that is, or , we denote respectively
We will work with the weights
[TABLE]
The following properties hold:
- •
for every ,
[TABLE]
- •
for every , there exists such that
[TABLE]
- •
for every , there exists such that for every ,
[TABLE]
- •
for every there exist such that for every and ,
[TABLE]
Note that (2.3)–(2.5) are immediate, whereas (2.6) is proved in Appendix A (see Lemma A.1).
For , and (we stress that we include the case ), we set the usual norm in and
[TABLE]
We denote to be the closure of with respect to the above norm. If we just denote and (which is the usual Sobolev space). So, we are working with weighted Sobolev spaces. The weighted Sobolev spaces are the natural framework in the paper [4] where the “balance argument” is obtained. There (see Theorem A.2 in [4]) we have used a crucial result of Petrushev and Xu [21] concerning the construction of kernels with polynomial decay at infinity. Then the weights appear in a natural way in order to capture the behaviour of the kernel at infinity.
The following properties hold:
- •
for every there exists such that for every , and ,
[TABLE]
- •
for every and there exists such that for every and ,
[TABLE]
and if ,
[TABLE]
- •
for , , and , the following two assertions are equivalent: there exists a constant such that for every ,
[TABLE]
and there exists a constant such that for every ,
[TABLE]
Notice that (2.8) is a consequence of (2.6). The inequality (2.9) is an immediate consequence of (2.6) and of the fact that for every . And the inequality (2.10) is a consequence of Morrey’s inequality (Corollary IX.13 in [11]), whose use gives , and of (2.6). In order to prove the equivalence between (2.11) and (2.12), one takes (respectively and uses (2.6) as well.
2.2 Main results
We consider a Markov semigroup with infinitesimal operator and a sequence , , of Markov semigroups with infinitesimal operator We suppose that is included in the domain of , , and of and we suppose that for we have .
We denote Moreover, we denote by the formal adjoint of and by the formal adjoint of that is
[TABLE]
being the scalar product in
We present now our hypotheses. The first one concerns the speed of convergence of
Assumption 2.1
Let , and let be a decreasing sequence such that We assume that for every and there exists such that for every and ,
[TABLE]
Our second hypothesis concerns the “propagation of regularity” for the semigroups .
Assumption 2.2
Let be an increasing sequence such that for some For every and , there exist and , such that for every and
[TABLE]
The hypothesis is rather difficult to verify so, in Appendix B, we give some sufficient conditions in order to check it (see Proposition B.4).
Our third hypothesis concerns the “regularization effect” of the semi-group .
Assumption 2.3
We assume that
[TABLE]
with . Moreover, we assume there exist and a sequence , , with, as ,
[TABLE]
for some such that the following property holds: for every there exist increasing in and in a constant and a constant such that for every , , for every multi-indexes and with and
[TABLE]
Note that in (2.20) we are quantifying the possible blow-up of as .
We also assume the following statements hold for the semigroup .
Assumption 2.4
For every there exists such that
[TABLE]
Assumption 2.5
For every there exists such that
[TABLE]
Our main result is the following:
Theorem 2.6
Suppose that Assumption 2.1, 2.2 , 2.3, 2.4 and 2.5 hold. Suppose also that for some
[TABLE]
Then with Moreover, for every and every multi-indexes and there exists some constants and such that for every , with and ,
[TABLE]
with from (2.20).
3 Regularity results
This section is devoted to some preliminary results allowing us to prove the statements resumed in Section 2.2: in Section 3.1 we give an abstract regularity criterion, while in Section 3.2 we prove a regularity result for iterated integrals, that will be useful to handle a Lindeberg type decomposition of .
3.1 A regularity criterion based on interpolation
Let us first recall some results obtained in [4] concerning the regularity of a measure on (with the Borel -field). For two signed finite measures and for we define the distance
[TABLE]
If and are probability measures, is the total variation distance and is the Fortet Mourier distance. In this paper we will work with an arbitrary . Notice also that where is the dual of
We fix now , with , and . Hereafter, we denote by the conjugate of Then, for a signed finite measure and for a sequence of absolutely continuous signed finite measures with we define
[TABLE]
The following result is the key point in our approach:
Lemma 3.1
Let with , and be given. There exists a constant (depending on and only) such that the following holds. Let be a finite measure for which one may find a sequence , such that Then with and moreover
[TABLE]
The proof of Lemma 3.1 is given in [4], being a particular case (take ) of Proposition A.1 in Appendix A. We give a first simple consequence:
Lemma 3.2
Let be a family of probability densities such that, for every , . We assume that for some and the following holds. For every and there exists a constant such that
[TABLE]
Then, for every there exists a constant such that
[TABLE]
for every (so does not matter the value of one may morally replace it by in the power of ; however, appears in the constant ).
Proof. We take and we define for and for Notice that Then (3.3) with gives
[TABLE]
Since , we use (3.4) (with replaced by and replaced by ) and we obtain
[TABLE]
We write here to stress the possible dependence on of the constant in (3.4). We optimize over : we look for such that
[TABLE]
Straightforward computations give where
[TABLE]
In order to successfully insert such in (3.6), we need that . Notice in fact that if then (3.6) would give and this is not the kind of estimate we are looking for.
We take sufficiently large in order to have and . Then we write
[TABLE]
It follows that the restriction amounts to which is exactly the restriction we have assumed for .
We replace in (3.6) and we obtain
[TABLE]
Since as , can be chosen large enough in order that (3.5) holds (since depends on so does and consequently the constant in our estimates).
We will also use the following consequence of Lemma 3.1 (the proof is given in [3] and we do not repeat it here):
Lemma 3.3
Let , with , and be given and set
[TABLE]
We consider an increasing sequence , such that and for some constant Suppose that we may find a sequence of functions , such that
[TABLE]
and, with
[TABLE]
for some Then with
Moreover, for and , let
[TABLE]
Then, for every
[TABLE]
* being the constant in (3.3) and being given in (3.7).*
3.2 A regularity lemma
We give here a regularization result in the following abstract framework. We consider a sequence of operators , , and we denote by the formal adjoint defined by with the scalar product in .
Assumption 3.4
Let be fixed. We assume that for every and there exist constants and such that for every and ,
[TABLE]
We assume that , , is non decreasing with respect to and .
We also consider a semigroup of the form
[TABLE]
We define the formal adjoint operator
[TABLE]
Assumption 3.5
If then . Moreover, there exists such that for every and there exist constants such that for every ,
[TABLE]
We assume that , , is non decreasing with respect to and .
We denote
[TABLE]
Under Assumptions 3.4 and 3.5, one immediately obtains
[TABLE]
In fact these are the inequalities that we will employ in the following. We stress that the above constants and may depend on and are increasing w.r.t. and .
Finally we assume that the (possible) blow-up of as is controlled in the following way.
Assumption 3.6
Let be fixed. We assume that for every and there exist , and such that for every multi-indexes and with , and one has
[TABLE]
We also assume that and are both increasing in and .
This property will be used by means of the following lemma:
Lemma 3.7
Suppose that Assumption 3.6 holds.
* For every , and there exists such that for every and one has*
[TABLE]
where
* For every , , there exists such that for every , for every multi-index with and one has*
[TABLE]
where .
Proof. In the sequel, will denote a positive constant which may vary from a line to another and which may depend only on and for the proof of A. and only on and for the proof of B.
A. Using (3.22) if
[TABLE]
By (2.4) so that
[TABLE]
We conclude that
[TABLE]
By (2.9) so the proof of (3.23) is completed.
B. Let with . Using integration by parts
[TABLE]
Using (2.6), (3.22) and (2.4), it follows that
[TABLE]
This implies (3.24).
We are now able to give the “regularity lemma”. This is the core of our approach.
Lemma 3.8
Suppose that Assumption 3.4, 3.5 and 3.6 hold. We fix , and , such that
* There exists a function such that*
[TABLE]
* We fix and we denote One may find universal constants (depending on and such that for every multi-index with and every *
[TABLE]
Proof. A. For , we denote . By the very definition of one has
[TABLE]
As a consequence, one gets the kernel in (3.25):
[TABLE]
and the regularity immediately follows.
B. We split the proof in several steps.
Step 1: decomposition. Since we may find such that We fix this and we write
[TABLE]
with
[TABLE]
Here we use the semi-group property
We suppose that . In the case the proof is analogous but simpler. We will use Lemma 3.7 in order to estimate the terms corresponding to each of these two operators. As already seen, both and are given by means of smooth kernels, that we call and respectively.
Step 2. We take with and we denote . For we write
[TABLE]
It follows that
[TABLE]
We will use (3.21) times first and (3.23) then. We denote
[TABLE]
and we write
[TABLE]
with
[TABLE]
Step 3. We denote , so that with We take and we formally write
[TABLE]
This formal equality can be rigorously written by using the regularization by convolution of the Dirac function.
We denote
[TABLE]
and we write
[TABLE]
Since , , so using (2.6), we obtain (recall that
[TABLE]
Using (3.20) times and (3.24) (with we get
[TABLE]
Since we obtain
[TABLE]
By inserting in (3.27) we obtain (3.26), so the proof is completed.
4 Proofs of the main results
In this section we prove Theorem 2.6. But before we give an intermediary result, Theorem 4.1 below, which is more precise concerning constants. Let us introduce some notation. For we denote
[TABLE]
We recall that the constants , , , and are defined in Assumption 2.1, Assumption 2.2 and Assumption 2.3. Under Assumption 2.3, for some , so we have
[TABLE]
For we set
[TABLE]
Our intermediary result concerning the regularity of the semigroup is the following.
Theorem 4.1
Suppose that Assumption 2.1, 2.2 , 2.3 and 2.4 hold. Moreover we suppose there exists such that
[TABLE]
* being given in (4.1). Then the following statements hold.*
A. with
B. Let and be such that
[TABLE]
We fix , , and we put with the conjugate of . There exist and (depending on and ) such that for every
[TABLE]
C. Let Set . There exist (depending on ) such that for every , and for every multi-indexes such that ,
[TABLE]
Remark 4.2
We stress that in hypothesis (4.5) the order of derivation does not appear. However the conclusions (4.6) and (4.8) hold for every The motivation of this is given by the following heuristics. The hypothesis (2.20) says that the semi-group has a regularization effect controlled by If we want to decouple this effect times we write and then each of the operators acts with a regularization effect of order But this heuristics does not work directly: in order to use it, in the proof we have to develop a Taylor expansion coupled with the interpolation criterion studied in Section 3.
Proof. Step 0: constants and parameters set-up. We first choose some parameters which will be used in the following steps. To begin we stress that we work with measures on so the dimension of the space is (and not We recall that in our statement the quantities and are given and fixed. In the following we will denote by a constant depending on all these parameters and which may change from a line to another. We define
[TABLE]
and given we denote
[TABLE]
Notice that this is equal to the constant defined in (3.7) corresponding to and and to (instead of
Step 1: a Lindeberg-type method to decompose . We fix (once for all) and we write
[TABLE]
We iterate this formula times (with chosen in (4.9)) and we obtain
[TABLE]
with (we put
[TABLE]
In order to analyze we use Lemma 3.8 for the semigroup and for the operators (the same for each ), with , (with ). So the hypotheses (3.14) and (3.15) in Assumption 3.4 coincide with the requests (2.14) and (2.15) in Assumption 2.1. And we have Moreover the hypotheses (3.16) and (3.17) in Assumption 3.5 coincide with the hypotheses (2.16) and (2.17) in Assumption 2.2. And we have . Hence,
[TABLE]
Finally, the hypothesis (3.22) in Assumption 3.6 coincides with (2.20) in Assumption 2.3. So, we can apply Lemma 3.8: by using (3.25) we obtain
[TABLE]
We denote
[TABLE]
so that (4.11) reads
[TABLE]
We recall that is defined in (4.3) and we define the measures on defined by
[TABLE]
So, the proof consists in applying Lemma 3.3 to and .
Step 2: analysis of the principal term. We study here the estimates for which are required in (3.8).
We first use (3.26) in order to get estimates for . We fix and we recall that in Lemma 3.8 we introduced Moreover in Lemma 3.8 one produces such that (3.26) holds true: for every multi-index with
[TABLE]
Denote
[TABLE]
With this notation, if we have
[TABLE]
where is the constant defined in (4.1). We take and we take Moreover we fix and (so and we take to be the one in (4.13). Moreover we take sufficiently large in order to have This guarantees that
[TABLE]
[TABLE]
We conclude that
[TABLE]
By (4.2) and with
[TABLE]
In the following we will choose sufficiently large, depending on and So is a constant depending on , and as the constants considered in the statement of our theorem.
Step 3: analysis of the remainder. We study here as required in (3.9): we prove that, if then
[TABLE]
Using first and (see (2.14) and (2.16)) and then (see (2.21)) we obtain
[TABLE]
which gives
[TABLE]
Using now the equivalence between (2.11) and (2.12) we obtain
[TABLE]
We take now we denote and we write
[TABLE]
the last inequality being a consequence of (4.18) and of . Now (4.17) is proved because .
Step 4: use of Lemma 3.3 and proof of A. and B. We recall that is defined in (4.10) and we estimate
[TABLE]
with
[TABLE]
and
[TABLE]
By our choice of we have
[TABLE]
so, taking sufficiently large we get And we also have and So we finally get
[TABLE]
The above inequality guarantees that (3.9) holds so that we may use Lemma 3.3. We take and, using (see (2.21)) we obtain
[TABLE]
Then, (see (3.10)). One also has (see (3.11)) and finally (see (3.12))
[TABLE]
We have used here (4.19). For large we also have
[TABLE]
Now (3.13) gives (4.6). So **A **and **B **are proved.
Step 5: proof of C. We apply B. with replaced by , so . Since (here the dimension is ), we can use the Morrey’s inequality: for every , with , then . By (4.6), one has
[TABLE]
i.e. (using (2.6)),
[TABLE]
Now, by a standard calculus, (use that ), so (4.8) follows.
We are finally ready for the
Proof of Theorem 2.6. Our assumptions guarantees that and satisfies (4.8). We take a cut-off function such that ( denoting the open ball centered at [math] with radius ) and we denote By (4.8) we know that, for every and every one has
[TABLE]
where , is computed from (4.8) (the precise value is not important here) and and both depend on and Since the above left hand side is identically null when , we can write
[TABLE]
where is a new constant depending on as well (we also stress that here , so the underlying dimension is ). This allows one to apply Lemma 3.2: for every , and ,
[TABLE]
Then by Morrey’s Lemma, for every
[TABLE]
the last inequality being true if we take close to and . And this gives (2.23).
Appendix A Weights
For and , we denote
[TABLE]
Lemma A.1
For every multi-index there exists a constant such that
[TABLE]
Moreover, for every there is a constant such that for every
[TABLE]
Proof. One checks by recurrence that
[TABLE]
where is a polynomial of order And since
[TABLE]
the proof (A.2) is completed. In order to prove (A.3) we write
[TABLE]
This, together with (A.2) implies
[TABLE]
so the first inequality in (A.3) is proved. In order to prove the second inequality we proceed by recurrence on . The inequality is true for Suppose that it is true for Then we write
[TABLE]
and we use again (A.2) in order to obtain
[TABLE]
the second inequality being a consequence of the recurrence hypothesis.
Remark A.2
The assertion is false if we define because blows up in zero.
We look now to itself.
Lemma A.3
For every multi-index there exists a constant such that
[TABLE]
Moreover, for every there is a constant such that for every
[TABLE]
Proof. One proves by recurrence that, if then with a polynomial of order Since it follows that and (A.4) follows. Now we write
[TABLE]
and the same arguments as in the proof of (A.3) give (A.5).
Appendix B Semigroup estimates
We consider a semigroup on such that where is a probability transition kernel and we denote by its formal adjoint.
Assumption B.1
There exists such that for every and every
[TABLE]
Moreover, for every there exists such that for every and
[TABLE]
Lemma B.2
Under Assumption B.1, for every one has
[TABLE]
Proof. Using Hölder’s inequality, the identity and (B.2)
[TABLE]
Then, using (B.1)
[TABLE]
Using Hölder’s inequality first and the above inequality we obtain
[TABLE]
We consider also the following hypothesis.
Assumption B.3
There exists such that for every there exists such that for every and
[TABLE]
Proposition B.4
Suppose that Assumption B.1 and B.3 hold. Then for every and there exists a universal constant (depending on and only) such that for every
[TABLE]
Proof. We will prove (B.5). Let with By (B.4)
[TABLE]
with
[TABLE]
Taking and using (B.3)
[TABLE]
And we have
[TABLE]
We conclude that
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Alfonsi, A., Cancès, E., Turinici, G., Di Ventura, B., and Huisinga, W. (2005). Adaptive simulation of hybrid stochastic and deterministic models for biochemical systems. In ESAIM Proceedings 14 , 1–13.
- 2[2] Asmussen, S., Rosinski, J. (2001). Approximations of small jumps of Lévy processes with a view towards simulation. J. Appl. Probab. 38 , 482–493.
- 3[3] Bally, V. (2019). Upper bounds for the function solution of the homogeneous 2 Boltzmann equation with hard potential. Ann. Appl. Probab. 29 , 1929–1961.
- 4[4] Bally, V., Caramellino, L. (2017). Convergence and regularity of probability laws by using an interpolation method. Ann. Probab. 45 , 1110–1159.
- 5[5] Bally, V., Caramellino, L. (2019). Regularity for the semigroup of jump equations. Working paper.
- 6[6] Bally, V., Clément, E. (2011). Integration by parts formulas with respect to jump times for stochastic differential equations. Stochastic Analysis 2010 , D. Crisan (Ed.), Springer Verlag.
- 7[7] Ball, K., Kurtz, T. G., Popovic, L., Rempala, G. (2006). Asymptotic analysis of multiscale approximations to reaction networks. Ann. Appl. Probab. 16 , 1925–1961.
- 8[8] Bichteler, K., Gravereaux, J.-B., Jacod, J. (1987). Malliavin calculus for processes with jumps. Gordon and Breach science publishers , New York.
