An explicit Milstein-type scheme for interacting particle systems and McKean–Vlasov SDEs with common noise and non-differentiable drift coefficients
Abstract
We propose an explicit drift-randomised Milstein scheme for both McKean–Vlasov stochastic differential equations and associated high dimensional interacting particle systems with common noise. By using a drift randomisation step in space and measure, we establish the scheme’s strong convergence rate of under reduced regularity assumptions on the drift coefficient: no classical (Euclidean) derivatives in space or measure derivatives (e.g., Lions/Fréchet) are required. The main result is established by enriching the concepts of bistability and consistency of numerical schemes used previously for standard SDE. We introduce certain Spijker-type norms (and associated Banach spaces) to deal with the interaction of particles present in the stochastic systems being analysed. A discussion of the scheme’s complexity is provided.
keywords:
[class=MSC]keywords:
, and
1 Introduction
For a given , consider the following stochastic differential equation (SDE) of McKean–Vlasov type and with common noise,
(1) |
almost surely for all , where and are, respectively, and dimensional independent Wiener processes and denotes the stochastic flow of conditional marginal laws of given . The initial value is an - measurable random variable, independent of and . The McKean–Vlasov SDE (1) can be viewed as an infinite-dimensional system of particles with representing the randomness inherent in the individual particle and the randomness common to all the particles. When , the particles are governed by only one source of randomness, , and the stochastic flow becomes a deterministic one. Notice that McKean–Vlasov SDEs are different from standard SDEs due to the dependence of the coefficients on the (conditional) marginal law of given , which brings additional difficulties.
Due to their wide applications in areas such as Finance, mathematical neuroscience and biology, machine learning and physics — animal swarming, cell movement induced by chemotaxis, opinion dynamics, particle movement in porous media and electrical battery modelling, self-assembly of particles and dynamical density functional theory (see for example [31, 16, 8, 25, 2, 27, 33, 9, 13, 14, 28, 32])— McKean–Vlasov equations and associated interacting particle systems, with or without common noise, addressed via stochastic systems or associated Fokker Plank equations ([38, 22, 21]) have gained immense popularity.
As in the case of SDEs, explicit solutions of McKean–Vlasov SDEs are typically not available, which necessitates the development of numerical schemes to approximate them. The numerical approximation of McKean–Vlasov SDEs can be carried out in two steps, as explained below.
-
•
As a first step one builds the so-called interacting particle system, , where one replaces the (conditional) marginal law appearing in the coefficients of (1) by the empirical law obtained from the particles. Concretely, taking i.i.d. copies of and of ,
one defines the interacting particle system associated with the above McKean–Vlasov SDE by
(2) almost surely for any and , where
is the empirical measure of particles. Subsequently, one needs to show, roughly put, that for some (fixed) convergences to of (1) as ; see the seminal work by Sznitman [53] (and Proposition 2.5 below).
-
•
In the second step of approximation, the temporal discretization of the interacting particle system is performed to obtain fully implementable numerical schemes for the McKean–Vlasov SDEs such as Euler-type schemes and Milstein-type schemes. The main difficultly is to show that all estimates are independent of the number of particles (see Theorem 3.3 and Corollary 3.4 below). The direct application of results from classic SDE theory do not deliver this independence.
It is critical to note that the results of this manuscript double for either the numerical approximation of McKean–Vlasov SDEs if one’s starting point is (1), or for stand-alone systems of interacting particle SDE systems if one’s starting point is (2).
Results on the strong well-posedness and propagation of chaos for McKean–Vlasov SDEs are being extensively researched and we cannot possibly do justice to that growing body of literature. Nonetheless, we mention some of the milestones and more recent results fitting thematically with our manuscript: for PoC results, one starts from Sznitman’s seminal work [53] to the monographs [13, 14] and the recent developments by [23, 39, 40] to mention a few – overall, there are still gaps in the existing PoC results, especially across dimensions. Concretely, in [20, Section 3.5] the PoC rates across the dimension is estimated numerically for a diffusion of polynomial growth and a drift of polynomial growth (a setting outside the scope of this work) and the rates estimated are better than the rates found in any theoretical results at present. For a focus on well-posedness, one starts from the McKean’s seminal work [43], to again [13, 14] and the recent developments [6, 17, 37, 44, 45, 52, 20] (and references therein).
The second step of numerical approximation of McKean–Vlasov SDEs saw relatively little development after the first Euler-type scheme was proposed and analysed (in a weak sense) in [10], but experience rapid advances in a string of recent papers, [3, 4, 5, 18, 19, 36, 37, 41, 24, 49]. In particular, [24] proposed an Euler-type numerical scheme for the interacting particle system associated with the McKean–Vlasov SDE, and its strong convergence is investigated when the drift coefficient grows super-linearly in the state variable. More precisely, the drift is assumed to be one-sided Lipschitz continuous in the state variable and Lipschitz continuous in the measure variable, while the diffusion coefficient is assumed to be Lipschitz continuous in both the state and measure variables. The rate of strong convergence of the scheme is shown to be equal to . In [4, 36], a Milstein-type scheme for the interacting particle system associated with the McKean–Vlasov SDEs is proposed using the notion of Lions derivatives, introduced by P.-L. Lions in his lectures at the Collège de France and presented in [12], and its strong convergence is shown with rate . The drift coefficient is assumed to satisfy a one-sided Lipschitz condition in the state variable and a polynomial Lipschitz condition, and the diffusion coefficient to satisfy Lipschitz condition; both are assumed to be Lipschitz continuous in the measure variable. Furthermore, only the diffusion coefficient is required to be once differentiable (in both state and measure variables). In [4], the authors additionally require second order differentiability of the coefficients. In [37], an Euler-type scheme and a Milstein-type scheme are developed for the interacting particle system connected with McKean–Vlasov SDEs with common noise, where all the coefficients are allowed to grow super-linearly in the state variable.
In this article, we develop a Milstein-type scheme for the interacting particle system corresponding to the McKean–Vlasov SDE without assuming the differentiability of the drift coefficient (in space or measure component), which is therefore more relaxed than the corresponding results in [4, 36, 37]. It is out of the scope of this work to lift the differentiability conditions on the diffusion coefficient and hence those assumptions match those already existing in the most recent literature. The relaxation of the regularity requirement of the drift coefficient is achieved by a certain randomisation strategy that needs to be applied to both state and measure components: the technical developments necessary to deal with this difficulty are the second contribution of this manuscript. In the case of SDEs (when the coefficients do not depend on the law of the solution process), the technique of randomisation has been studied in [35] (also [7, 34] and and more recently in [46, 48]) to construct a Milstein-type scheme without assuming the first order differentiability of the drift coefficient. As the coefficients in our settings depend on the law of the solution process as well, we require a two-fold randomisation – one with respect to the state variable and the other with respect to the measure variable. For this, we use a uniform random variable to generate a random point in each sub-interval of the time mesh and the Euler scheme is used to obtain values of the particles’ states at these random points, which are then used in the drift coefficient of the Milstein scheme, both for the state and empirical measure. The precise details of this randomisation can be found in Section 3. Critically, the technique developed in [35] for the analysis cannot be used directly in our settings and a novel approach is required. We observe the following.
-
•
The interacting particle system associated with the McKean–Vlasov SDE can be treated as an -dimensional SDE and thus the results of [35] could be applied directly. However, all estimates would depend on and hence “explode” as tends to infinity. This implies that to establish our results a new tool must be developed in order to show the independence on .
-
•
We propose a new notion of bistability and consistency of the numerical scheme that is appropriate for the context of high-dimensional interacting particle systems. Inspired by [35] we propose suitable stochastic Spijker norms capable of dealing with the interaction component of the particles. Further details can be found in Section 5.
-
•
A discussion on the practicalities of implementing our scheme is given in Section 3.1.1 which includes a critical view on complexity and the consequence of having common-noise.
-
•
In the simplest version possible of (1), three drift functions are well within the scope of our work are (linear interaction, convolution-functionals and linear interaction kernels)
for any real-valued functions that satisfy a standard Lipschitz condition in space (but are not differentiable), e.g., and more complex examples for can be found in [16, 13, 14, 30, 32] and represents the conditional expectation given the common noise . The 2nd drift example, , corresponds to the usual convolution operator fairly common in modelling with McKean–Vlasov SDE and associated interacting particle systems (with or without common noise) [15, 30, 32, 1]. Lastly, we point the reader to Example 3.15 in [1] that intuitively highlights why is Lipschitz in the Wasserstein metric but is not Lions differentiable.
Organization
The main framework of the McKean–Vlasov equation and the interacting particle system including well-posedness and propagation of chaos is given in Section 2. The numerical scheme focusing on the approximation of the interacting particle system is found in Section 3 as are the main convergence results. All proofs are given in Section 5.
1.1 Notations
Both the Euclidean norm on and the standard matrix norm on are denoted by . The notation stands for the Dirac measure centred at . We use the same notation to denote the -th column of a matrix and the -th element of a vector . stands for the Borel -algebra on a topological space . Further, denotes the space of all probability measures on having finite second moment and equipped with the -Wasserstein metric given by
for any , , where denotes the set of couplings of and . Clearly, is a Polish space under this metric. We use to denote the Banach space of all -valued random variables defined on a probability space and satisfies , where stands for expectation with respect to . Similarly, we use to denote the Banach space of processes having . Also, stands for the space of all -Hölder continuous functions with the following norm,
(3) |
For a function , is the derivative of with respect to the space variable and is the Lions derivative with respect to the measure variable. stands for the indicator function of a set and . The constants that appear in the paper vary from line to line, will depend on the problems data, for instance , , etc., but critically are independent of the number of particle and the schemes timestep (given below).
2 McKean–Vlasov Stochastic Differential Equations and the interacting particle systems
Let be a fixed constant. Consider probability spaces and equipped with filtrations and , respectively. The filtrations and satisfy the usual conditions, i.e., they are complete and right continuous. Assume that and are independent Brownian motions defined on and , respectively. In what follows, the interacting particles are governed by i.i.d. copies of and represents the noise common to all the particles. Let us define a product probability space , where , is the completion of and is the completion and right-continuous augmentation of . The expectation with respect to is denoted by .
Let , and be -measurable functions.
In this article, we consider the following -valued McKean–Vlasov stochastic differential equations (SDEs) with common noise defined on ,
(4) |
almost surely for all , where is the flow of conditional laws of given and . A priori, it is not certain that the flow of conditional marginals is an -adapted continuous process. However, due to Lemma 2.5 in [14], when the McKean–Vlasov SDE (2) has a unique -adapted continuous solution with uniformly bounded second moment, then is an -adapted continuous process.
We make the following assumptions.
Assumption H– 1.
for some .
Assumption H– 2.
There exists a constant such that
for all , and .
Assumption H– 3.
There exists a constant such that
for all , and .
Proposition 2.2 (Well-posedness and Moment Bounds).
To introduce the interacting particle system connected with the McKean–Vlasov SDEs (2), let us consider i.i.d. copies of and , denoted by and for , respectively. Define the following system of equations,
(5) |
almost surely for any and . Notice that due to Proposition 2.11 in [14], . We remark that the proof of Proposition 2.11 in [14], which establishes the result in a more restrictive setting, uses (only) the well-posedness of the system (2) and Theorem 1.33 from [14] (Yamada Watanabe Theorem) and thus particles have the same law under our settings also. The system (2) is popularly known as the conditional non-interacting particle system. On approximating by the empirical measure of the states of particles at time , and denoted , one obtains the following system of interacting particles,
(6) |
almost surely for any and , where
is the empirical measure of particles.
Remark 2.3.
The system (2) can be understood as an -dimensional SDE and thus its well-posedness and moment stability up to order follow from [29] under Assumptions H–1 (with ), H–2 and H–3. In other words, the interacting particle system (2) connected with the McKean–Vlasov SDE (2) has a unique strong solution adapted to the filtration and one can show that
where is the same constant as in Proposition 2.2. Note that the RHS of the moment estimate above is critically independent of – this follows from [37] but does not from [29].
The following lemma gives the time-regularity of the interacting particle system (2) and its proof is given in Appendix A.2.
Lemma 2.4.
The convergence of the interacting particle system (2) to the non-interacting particle system (2) is popularly known in the literature as the propagation of chaos and is stated in the following proposition (see Theorem 2.12 in [14] for details or Appendix A.3). For this, let us define the empirical measure of the non-interacting particle system (2) as
almost surely for any and . Further, use Theorem 5.8 in [13] and Proposition 2.2 to obtain the following estimate,
(7) |
for any and , where is a positive constant.
Proposition 2.5 (Propagation of Chaos).
The proof of this result can be found in Appendix A.3.
All in all, the PoC rates here are in line with the PoC results found in the numerics for McKean Vlasov SDE literature [3, 4, 5, 18, 19, 52, 36, 37, 41, 24, 49]. There are improved results obtaining rate of and (e.g., [23, 39]) that hold under stricter conditions that do not fit the scope of the work presented in the manuscript. We have added text to this effect in the main body of the paper.
3 Main Result
The drift-randomised Milstein scheme was originally proposed and analysed for standard SDEs with non-differentiable drift coefficient in [35]. In the case of McKean–Vlasov SDEs, for which the coefficients depend on the law of the solution process as well, one needs additional randomisation of the drift coefficient with respect to the measure component and a way to deal with the implications from interacting particles. The associated difficulties are tackled in this paper.
3.1 The Scheme
In order to propose the randomised Milstein scheme for the interacting particle system (2) connected with the McKean–Vlasov SDEs (2), the map is assumed to be continuously differentiable for every . The notion of Lions derivative (see Appendix A.4 for details) is used to differentiate these functions with respect to the measure component. For , let us define matrices and whose -th column are given by,
(8) | ||||
(9) |
for all , , , , . Also, define the -dimensional vectors and for any and as
(10) |
for all .
Now, consider a sequence of i.i.d. standard uniformly distributed random variables defined on a probability space , equipped with the natural filtration of . Let stand for the expectation with respect to . The random variables are assumed to be independent of , , and for all . Now consider the general non-equidistant temporal grid of with subintervals,
(11) |
with for , and . Now, consider a new probability space equipped with a filtration ; where . We will denote the expectation with respect to by .
The drift-randomised Milstein scheme for the interacting particle system (2) of the McKean–Vlasov SDE (2) is given by
(12) | ||||
(13) |
almost surely for all and with the initial value , where the empirical measures and are defined as
(14) |
Remark 3.1 (Comparison to prior art: classical case).
When , the conditional law becomes the unconditional law of the solution process. If either is known or and do not depend on , then the McKean–Vlasov SDE (2) becomes a standard SDE. In such a case, the randomised Milstein scheme (13) considered here reduces to the one considered in [35]. Indeed, the terms involving measure derivatives in (8) and hence in (10), (12) and (13) vanish in this case. Additional terms that appear in (12) and (13) are due to the dependence of the coefficients , and on the law of the solution process (measure variable).
3.1.1 Practical Implementation
In this section, we comment on implementation issues, specifically the sampling of the random time mesh and simulation of the Lévy area. The latter results explicitly from the presence of common noise and is not specific to our randomisation method, the former is an essential aspect of the scheme.
We first note that in Equations (12) and (13) the same uniform random variables , , are used for each particle in the system to identify random points in each sub-interval of the temporal grid . This approach is similar to the adaptive time-stepping Euler scheme of [49] where the same random points (arising due to adaptive step-sizes) are used for each particle of the system. A refined version uses different time meshes for individual particles, but common, uniform timesteps for the definition of the empirical measure. In our setting, for each realisation of the common noise, a single path of random timesteps is simulated, so that the computational effort of the randomisation is comparable to the simulation of a discrete Brownian path, but negligible compared to the simulation of iterated stochastic integrals as required for the Milstein scheme, which we discuss further now.
If the following, commutative conditions are imposed on the diffusion coefficients,
for any , , and , then
almost surely for any and , and thus one can write the third term on the right-hand side of (13) as
In the above, the last three terms require the approximation of the Lévy area, which can be done with the help of the techniques developed in [54]. A similar conclusion holds for the fourth term on the right-hand side of (13). Furthermore, the terms involving Lions derivatives are of order , as shown in [4, Proof of Proposition 2.3] for the regular case, and hence can be ignored when is large. In addition, if , i.e., the common noise term is not present, the fourth term on the right-hand side of the above equation can also be dropped and thus we have
which leads to a fully implementable randomised Milstein scheme. Summing up, when is large and , the randomised Milstein scheme can be reduced to
almost surely for any and .
3.2 The Main Convergence Result and Its Assumptions
In order to investigate the rate of convergence of the randomised Milstein scheme (13), we make the following additional assumptions.
Assumption H– 4.
There exists a constant such that
for all , , , and .
Assumption H– 5.
There exists a constant such that
for all , , , , and .
Remark 3.2.
Below, we state the main result of this paper containing the error rate for the approximation of the scheme to the interacting particle system (2). For notational simplicity, we use to represent for any and . This result is proved in Section 5.4.
Theorem 3.3.
Let Assumptions H–1 with , H–2 to H–5 hold. Then, the drift-randomised Milstein scheme (13) converges in the strong sense to the true solution of the interacting particle system (2) with order 1. Concretely, for and we have
where the positive constants and appear in Proposition 5.5 and Proposition 5.9, respectively.
A direct combination of Proposition 2.5 and Theorem 3.3 delivers the control on the error for the numerical approximation of the McKean–Vlasov Equation SDE (2) (and (2)). For convenience of notation, is used to denote for any and .
Corollary 3.4.
Remark 3.5 (Application to optimal control and machine learning).
In an -player stochastic differential game with an -valued state process , agent chooses a control process with values in an action space so as to minimize some target functional (see, e.g., the framework considered in [23, (1.1)]). For a Markovian control , the resulting dynamics can be described by a (controlled) McKean–Vlasov SDE,
(15) |
Throughout, and are independent Wiener processes, and we write
to denote the empirical measure of a vector in . A similar situation arises in mean-field control, where a central agent chooses the same feedback control for each agent so as to minimise their (the central agent’s) objective.
In both these situations, for a non-differentiable control of (Markovian) type, , appearing in and not appearing in or (as Assumption H-4 and H-5 require differentiability), then our approximation scheme will be applicable to the simulation of the controlled (mean-field) SDE and still produce an approximation of strong order as long as one can establish sufficient regularity of such that Assumption H-2 and H-3 holds for the modified drift
This exact same argument would work for controlled SDE in classical settings where the control is non-differentiable, e.g., when (adapting from (15))
In situations when is a random field our theory would not apply directly (Kruse et al.’s [7, 34, 35] or [46, 48] as well). It might be possible to address space-measure mean-field controls as in [47] but [47] also shows that proving regularity properties for in its measure component is involved.
Lastly, our method also fits into a situation where machine learning is applied, via tools like reinforcement learning or policy iteration, to solve the optimal control problem. The requirement is a suitable choice of control/policy iteration class that would ensure Assumption H-2 and H-3 holds. A popular choice, especially in the moderate- to high-dimensional context, are deep neural networks, and a commonly used activation function therein is a ReLU, which makes the resulting parametric ansatz function Lipschitz but not everywhere differentiable; see [50] for applications of such a policy gradient method to non-smooth mean-field control, and to [51] for a proof that the resulting feedback control remains uniformly Lipschitz over the iterations, in a setting with controlled drift but without mean-field interaction.
4 Moment Bound
In this section, we assume throughout that the conditions of Theorem 3.3 are in force. Here, we establish moment bounds for the scheme (13), but before proving it (Lemma 4.3), we state and prove the following auxiliary result.
Proof.
Notice that for every , is -measurable and Assumption H–2 gives the continuity of and for , which in turn implies that defined in (12) is -measurable for any . Also, continuity of and for and implies in (13) is -measurable for any and .
As , we have from Remark 2.1 and Minkowski’s inequality that
(16) |
where the last inequality is obtained by using
Similarly, we get for ,
(17) |
which along with (12) further implies
for any and . Thus, on using Remark 2.1, one also obtains
(18) |
for all and . Moreover, recall (8) and use Remarks 2.1 and 3.2 along with (4) and (17) to obtain the following,
(19) |
for all , , and . Similarly,
(20) |
for all , , and .
As a consequence of the above lemma, we obtain the following corollary.
Proof.
The following lemma gives the moment bound of the randomised Milstein scheme (13).
Lemma 4.3.
Proof.
Recall (12) and use Minkowski’s inequality, Remark 2.1 and to obtain the following,
(22) |
for all , and . Due to (13) and Minkowski’s inequality, for any and ,
which on application of Lemma A.1 and Remark 2.1 yields
for any and . Furthermore, the application of (22) and Theorem 7.1 in [42] give
(23) |
for any and .
Also, by adapting an argument similar to the one used in (21), we have
for any , and . On substituting the above in Equation (23), one obtains
where , which on using Young’s inequality yields
Thus, we have
for any . The application of the discrete Grönwall inequality (see Lemma A.2) yields
This completes the proof. ∎
5 Proof of Main Result
The proof mechanism we use builds from the notions of “bistability” and “consistency” introduced in [7] (and further explored in [34, 35]). We introduce a notion of bistability and consistency for the numerical scheme (13) of the interacting particle system (2) (and associated with the McKean–Vlasov SDE (2)) by choosing suitable norms and spaces. This choice of Banach spaces and norms is designed to capture the underlying key feature of the systems being analysed, namely, that we deal with interacting particle systems – and to the best of our knowledge, are new.
Throughout this section and in line with the statement of Theorem 3.3, we take , where comes from Assumption H–1 and assumed to satisfy . We next introduce the required notation and definitions to prove our main result Theorem 3.3.
5.1 Quantities of Interest, Norms, Banach Spaces and Residuals
For the time grid given in (11), define the Banach spaces , of stochastic grid processes as
and
(24) |
respectively. Also, define
(25) |
almost surely for any and , where is defined using (12), and the empirical measures and are defined using (14).
Define for as the collection of the pointwise residuals (associated to executing the scheme with ) by
(26) |
almost surely for any .
Randomised Quadrature Rule for Stochastic Processes.
In this small section we discuss the randomised quadrature rule for stochastic processes developed in [35]. For this, let us recall the sequence of i.i.d. uniform random variables and the temporal grid from Section 3.1. Consider a stochastic process on satisfying for . For each , is approximated by the randomised Riemann sum
(27) |
which is a random variable on and an unbiased estimator of , i.e., . Moreover, due to Theorem 4.1 in [35], we have
Additionally, if for some , then
(28) |
where is defined in Lemma A.1.
5.2 Bistability of the Scheme
We now specify the notion of a scheme’s bistability and show that the proposed randomised Milstein scheme (13) of the interacting particle system (2) is bistable (see Proposition 5.5 below). For this, recall the scheme from (13) and define . Clearly, due to Lemma 4.3. Also, recall the definition of residuals from (5.1) for some set .
Definition 5.1 (Stochastic Bistability).
Let us first establish some useful lemmas.
Proof.
Lemma 5.3.
Proof.
Corollary 5.4.
We now prove the bistability of the scheme (13) in the following proposition.
Proposition 5.5.
Proof.
Recall Equations (13), (5.1) and (5.1) to write
(31) |
for any , and then use the Spijker norm (24) to get the following,
which on using Corollary 5.4 yields
(32) |
Further, by rearranging the terms of (31) and using Minkowski’s inequality, one obtains
and then application of Corollary 5.4 gives the following,
which due to Young’s inequality yields
This further implies
Due to Lemma A.2, we get
for any , which further implies
and the proof is completed by combining the above with (32). ∎
5.3 Consistency of the Scheme
Recall the temporal grid from (11) and set the values of the interacting particle system (2) over the grid points of as the set where for any and . Notice that is different from , where the later stands for the randomised Milstein scheme (13). Further, is defined using in (5.1). Next, we introduce the notion of a scheme’s consistency and establish that the randomised Milstein scheme (13) is consistent (see below Proposition 5.9).
Definition 5.6 (Consistency).
In the context of the measure dependent drift coefficient, we obtain the following randomised quadrature rule.
Corollary 5.7.
Proof.
Lemma 5.8.
Proof.
For notational simplicity, define
for all , , and . Notice that
is an -adapted standard martingale. Thus, by using Lemma A.1 and Theorem 7.1 in [42], we get
(34) |
for all . Now, recall from (10) to write the following for any ,
which on the application of Assumption H–3, Lemma A.3 along with (2) and the values of , from (8), (9) yields
for all , and . This further implies, due to Remarks 2.1 and 3.2,
Moreover, the application of Hölder’s inequality (as , Remarks 2.3 and 3.2, Lemma 2.4 and Theorem 7.1 in [42] yield
(35) |
for any , , and . Further, by using Assumptions H–2 and H–3, Remark 2.3, Hölder’s inequality, Lemma 2.4 and , one obtains
(36) |
for all , , and . On substituting (36) in (35), one obtains
which, substituting in (34), gives the first estimate. The second estimate can be proved by similar arguments. ∎
Proposition 5.9.
Proof.
Let us recall the residual from (5.1), the interacting particle system from (2) and from (5.1) to write and
(37) |
for all and . For any , from (27),
which along with Assumption H–2 yields
and thus from (37) one obtains
(38) |
for all . Furthermore, Theorem 7.1 in [42] yields
which on using Equations (33) and (36),
(39) |
for all and . Also,
(40) |
for all . The proof is completed by substituting (5.3) and (40) in (5.3) and using Corollary 5.7 and Lemma 5.8. ∎
5.4 Rate of Convergence of the Scheme
Appendix A Auxiliary results
The following lemma is the discrete Burkholder–Davis–Gundy inequality, see [11].
Lemma A.1 (Discrete Burkholder–Davis–Gundy Inequality).
Let be a discrete-time martingale on a probability space with respect to the filtration . Then, there exist constants such that,
for any where is the quadratic variation process of .
The discrete version of the Grönwall’s inequality is given below, see Proposition 4.1 in [26].
Lemma A.2 (Discrete Grönwall’s Inequality).
Let and be sequences of non-negative real numbers satisfying for all where is a constant. Then, for all .
A.1 Proof of Proposition 2.2
A.2 Proof of Lemma 2.4
A.3 Proof of Proposition 2.5
A.4 Lions Derivative and Particle Projection Function Inequalities
Given a function and , we say that is Lions differentiable at if we can find an atomless, Polish probability space and a random variable with law such that the “lift” function defined by has Fréchet derivative at . By Riesz representation theorem, we can find such that for all . Further, Theorem 6.5 (structure of the gradient) in [12] guarantees the existence of a function , independent of the choice of the probability space and the random variable , satisfying such that . Then, we call as Lions’ derivative of at .
By using similar arguments used in Lemma 4.2 in [36], one can prove the following lemma.
Lemma A.3.
Let be a real valued function defined on such that derivative with respect to the state variable and with respect to the measure variable satisfy Lipschitz condition uniformly in time, i.e., there exists a constant such that,
for all , and . Then, for all , , and , the following holds,
[Acknowledgments] The authors would like to thank the anonymous referees whose comments improved the quality of this paper.
G. dos Reis acknowledges support from the Fundação para a Cincia e a Tecnologia (Portuguese Foundation for Science and Technology) through the project UIDB/00297/2020 and UIDP/00297/2020 (Center for Mathematics and Applications).
References
- [1] Adams, D., Dos Reis, G., Ravaille, R., Salkeld, W. and Tugaut, J. (2022). Large Deviations and Exit-times for reflected McKean–Vlasov equations with self-stabilising terms and superlinear drifts. Stochastic Process. Appl. 146 264–310.
- [2] Baladron, J., Fasoli, D., Faugeras, O. and Touboul, J. (2012). Mean-field description and propagation of chaos in networks of Hodgkin–Huxley and FitzHugh–Nagumo neurons. J. Math. Neurosci. 2(10)
- [3] Bao, J., and Huang, X. (2022). Approximations of McKean–Vlasov stochastic differential equations with irregular coefficients. J. Theoret. Probab. 35 1187–1215.
- [4] Bao, J., Reisinger, C., Ren, P., and Stockinger, W. (2021). First order convergence of Milstein schemes for McKean–Vlasov equations and interacting particle systems. Proc. R. Soc. A. 477(2245).
- [5] Bao, J., Reisinger, C., Ren, P., and Stockinger, W. (2021). Milstein schemes and antithetic multi-level Monte Carlo sampling for delay McKean–Vlasov equations and interacting particle systems. arXiv preprint arXiv:2005.01165.
- [6] Bauer, M., Meyer–Brandis, T. and Proske, F. (2018). Strong solutions of mean-field stochastic differential equations with irregular drift. Electron. J. Probab. 23(132) 1–35.
- [7] Beyn, W.-J. and Kruse, R. (2010). Two-sided error estimates for the stochastic theta method. Discrete Contin. Dyn. Syst. Ser. B 14 389–407.
- [8] Bolley, F., Cañizo, J.A. and Carrillo, J.A. (2011). Stochastic mean-field limit: non-Lipschitz forces and swarming. Math. Models Methods Appl. Sci. 21(11), 2179–2210.
- [9] Bossy, M., Faugeras, O. and Talay, D. (2015). Clarification and complement to “mean-field description and propagation of chaos in networks of Hodgkin–Huxley and FitzHugh–Nagumo neurons”. J. Math. Neurosci. 5(19).
- [10] Bossy, M. and Talay, D. (1997). A stochastic particle method for the McKean–Vlasov and the Burgers equation. Math. Comput. 66(217) 157–192.
- [11] Burkholder, D. L. (1966). Martingale transforms. Ann. Math. Statist. 37 1494–1504.
- [12] Cardaliaguet, P. (2013). Notes on Mean-field games, notes from P. L. Lions lectures at Collège de France, https://www.ceremade.dauphine.fr/cardalia/MFG100629.pdf.
- [13] Carmona, R. and Delarue, F. (2018). Probabilistic theory of mean Field games with applications I: Mean Field FBSDEs, Control, and Games, Springer International Publishing, Switzerland.
- [14] Carmona, R. and Delarue, F. (2018). Probabilistic theory of mean field games with applications II: Mean Field games with common noise and master equations, Control, and Games, Springer International Publishing, Switzerland.
- [15] Carrillo, J. A., Choi, Y. P. and Tse, O. (2019). Convergence to equilibrium in Wasserstein distance for damped Euler equations with interaction forces. Comm. Math. Phys. 365(1) 329–361.
- [16] Carrillo, J. A., Fornasier, M., Toscani, G. and Vecil, F. (2010). Particle, kinetic, and hydrodynamic models of swarming, In Mathematical modeling of collective behavior in socio-economic and life sciences, (pp. 297–336). Birkhäuser Boston.
- [17] Chaudru de Raynal, P.-E. (2020). Strong well-posedness of McKean–Vlasov stochastic differential equation with Hölder drift. Stochastic Process. Appl. 130(1) 79–107.
- [18] Chen, X. and dos Reis, G. (2022). A flexible split-step scheme for solving McKean–Vlasov stochastic differential equations, Appl. Math. Comput. 427, 127180.
- [19] Chen, X. and dos Reis, G. (2023). Euler simulation of interacting particle systems and McKean–Vlasov SDEs with fully super-linear growth drifts in space and interaction, IMA Journal of Numerical Analysis, drad022, https://doi.org/10.1093/imanum/drad022
- [20] Chen, X., dos Reis, G., and Stockinger, W. (2023). Wellposedness, exponential ergodicity and numerical approximation of fully super-linear McKean–Vlasov SDEs and associated particle systems. arXiv preprint arXiv:2302.05133.
- [21] Coghi, M. and Nilssen, T. (2021). Rough nonlocal diffusions. Stochastic Process. Appl. 141 1–56.
- [22] Coghi, M. and Gess, B. (2019). Stochastic nonlinear Fokker–Planck equations. Nonlinear Anal. 187 259–278.
- [23] Delarue, F., Lacker, D. and Ramanan, K. (2019). From the master equation to mean field game limit theory: a central limit theorem. Electron. J. Probab. 24, 1-54.
- [24] Dos Reis, G., Engelhardt, S. and Smith G. (2022). Simulation of McKean–Vlasov SDEs with super-linear growth. IMA J. Numer. Anal. 42(1) 874–922.
- [25] Dreyer, W., Gaberšček, M., Guhlke, C., Huth, R. and Jamnik, J. (2011). Phase transition in a rechargeable lithium battery. Eur. J. Appl. Math. 22(3) 267–290.
- [26] Emmrich, E. (1999). Discrete versions of Grönwall’s lemma and their application to the numerical analysis of parabolic problems. TU Berlin, FB Mathematik, Preprint.
- [27] Goddard, B. D., Pavliotis, G. A. and Kalliadasis, S. (2012). The overdamped limit of dynamic density functional theory: rigorous results. Multiscale Modeling & Simulation 10(2) 633-663.
- [28] Guhlke, C., Gajewski, P., Maurelli, M., Friz, P.K. and Dreyer, W. (2018). Stochastic many-particle model for LFP electrodes. Contin. Mech. Thermodyn. 30(3) 593–628.
- [29] Gyöngy, I. and Krylov, N. V. (2007). On stochastic equations with respect to semimartingales I. Stochastics 4(1) 1–21.
- [30] Harang, F. and Mayorcas, A. (2023). Pathwise regularisation of singular interacting particle systems and their mean field limits. Stochastic Process. Appl. 159 499–540.
- [31] Holm, D. D. and Putkaradze, V. (2006). Formation of clumps and patches in self-aggregation of finite-size particles. Physica D: Nonlinear Phenomena, 220(2), 183–196.
- [32] Jin, S., Li, L. and Liu, J. G. (2020). Random batch methods (RBM) for interacting particle systems. J. Comput. Phys., 400, 108877.
- [33] Kolokolnikov, T., Carrillo, J. A., Bertozzi, A., Fetecau, R. and Lewis, M. (2013). Emergent behaviour in multi-particle systems with non-local interactions. Phys. D (260) 1–4.
- [34] Kruse, R. (2012). Characterization of bistability for stochastic multistep methods. BIT 52 109–140.
- [35] Kruse, R. and Wu, Y. (2019). A randomised Milstein method for stochastic differential equations with non-differentiable drift coefficients. Discrete Contin. Dyn. Syst. Ser. B 24(8) 3475–3502.
- [36] Kumar, C. and Neelima (2021). On Explicit Milstein-type Scheme for McKean–Vlasov stochastic differential equations with superlinear drift coefficient. Electron. J. Probab. 26(111) 1–32.
- [37] Kumar, C., Neelima, Reisinger, C. and Stockinger, W. (2022). Well-posedness and tamed schemes for McKean–Vlasov equations with common noise. Ann. Appl. Probab. 32(5) 3283–3330.
- [38] Kurtz, T. G. and Xiong, J. (1999). Particle representations for a class of nonlinear SPDEs. Stochastic Process. Appl. 83(1) 103–126.
- [39] Lacker, D. (2023). Hierarchies, entropy, and quantitative propagation of chaos for mean field diffusions. Probability and Mathematical Physics, 4(2), 377-432.
- [40] Lacker, D. and Le Flem, L. (2023). Sharp uniform-in-time propagation of chaos. Probability Theory and Related Fields, 1-38
- [41] Li, Y., Mao, X., Song, Q., W, F., and Yin, G. (2023). Strong convergence of Euler–Maruyama schemes for McKean–Vlasov stochastic differential equations under local Lipschitz conditions of state variables. IMA J. Numer. Anal. 43(2) 1001–1035.
- [42] Mao, X. (2008). Stochastic differential equations and applications, 2nd edition, Horwood Publishing Limited, Chichester.
- [43] McKean Jr., H.P. (1966). A class of Markov processes associated with nonlinear parabolic equations. Proc. Nat. Acad. Sci. U.S.A. 56 1907–1911.
- [44] Mehri, S., Scheutzow, M., Stannat, W. and Zangeneh, B. Z. (2020). Propagation of chaos for stochastic spatially structured neuronal networks with delay driven by jump diffusions. Ann. Appl. Probab. 30(1) 175–207.
- [45] Mishura, Y. S. and Veretennikov, A. Y. (2020). Existence and uniqueness theorems for solutions of McKean–Vlasov stochastic equations. Theor. Probab. Math. Statist. 103 59–101.
- [46] Morkisz, P. M., and Przybyłowicz, P. (2021). Randomized derivative-free Milstein algorithm for efficient approximation of solutions of SDEs under noisy information. Journal of Computational and Applied Mathematics, 383, 113112.
- [47] Possamaï, D., and Tangpi, L. (2021). Non-asymptotic convergence rates for mean-field games: weak formulation and McKean–Vlasov BSDEs. arXiv preprint arXiv:2105.00484.
- [48] Przybyłowicz, P., Schwarz, V. and Szölgyenyi, M. (2022). Randomized Milstein algorithm for approximation of solutions of jump-diffusion SDEs. arXiv preprint arXiv:2212.00411.
- [49] Reisinger, C. and Wolfgang, S. (2022). An adaptive Euler–Maruyama scheme for McKean–Vlasov SDEs with super-linear growth and application to the mean-field FitzHugh–Nagumo model. J. Comput. Appl. Math. 400 113725
- [50] Reisinger, C., Stockinger, W. and and Zhang, Y. (2021) A fast iterative PDE-based algorithm for feedback controls of nonsmooth mean-field control problems. arXiv preprint arXiv:2108.06740.
- [51] Reisinger, C., Stockinger, W. and and Zhang, Y. (2022) Linear convergence of a policy gradient method for finite horizon continuous time stochastic control problems. arXiv preprint 2203.11758.
- [52] Salkeld, W., dos Reis, G. and Tugaut, J. (2019). Freidlin-Wentzell LDPs in path space for McKean–Vlasov equations and the Functional Iterated Logarithm Law. Ann. Appl. Probab. 29(3) 1487–1540.
- [53] Sznitman, A.-S. (1991). Topics in propagation of chaos. Springer, Berlin, Heidelberg.
- [54] Wiktorsson, M. (2001). Joint characteristic function and simultaneous simulation of iterated Itô’s integrals for multiple Brownian motions. Ann. Appl. Probab. 11 470–487.
Authors’ Addresses
Sani Biswas, Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, 247 667, India.
sbiswas2@ma.iitr.ac.in
Chaman Kumar, Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, 247 667, India.
chaman.kumar@ma.iitr.ac.in
Neelima, Department of Mathematics, Ramjas College, University of Delhi, Delhi, 110 007, India.
neelima_maths@ramjas.du.ac.in
Gonçalo dos Reis, School of Mathematics, University of Edinburgh, Peter Guthrie Tait Road, Edinburgh, EH9 3FD, United Kingdom, and Centro de Matemática e Aplicaç ões (CMA), FCT, UNL, Portugal.
G.dosReis@ed.ac.uk
Christoph Reisinger, Mathematical Institute, University of Oxford.
Andrew Wiles Building, Woodstock Road, Oxford, OX2 6GG, UK.
christoph.reisinger@maths.ox.ac.uk