The adaptive EM schemes for McKean-Vlasov SDEs with common noise in finite and infinite horizons
Hu Liu, Shuaibin Gao, Junhao Hu

TL;DR
This paper develops adaptive Euler-Maruyama schemes for McKean-Vlasov SDEs with common noise, establishing convergence rates under superlinear growth conditions and demonstrating their effectiveness through numerical examples.
Contribution
It introduces adaptive EM schemes for McKean-Vlasov SDEs with common noise, providing convergence analysis under superlinear growth conditions.
Findings
Established $L^p$ convergence rates in finite and infinite horizons.
Demonstrated the schemes' effectiveness through numerical examples.
Abstract
This paper is dedicated to investigating the adaptive Euler-Maruyama (EM) schemes for the approximation of McKean-Vlasov stochastic differential equations (SDEs) with common noise. When the drift and diffusion coefficients both satisfy the superlinear growth conditions, the convergence rates in finite and infinite horizons are revealed, which reacts to the particle number and step size. Subsequently, there is an illustration of the theory results by means of two numerical examples.
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
TopicsStochastic processes and financial applications · Gas Dynamics and Kinetic Theory · Advanced Mathematical Physics Problems
The adaptive EM schemes for McKean-Vlasov SDEs with common noise in finite and infinite horizons
, , ,
1 School of Mathematics and Information Science, North Minzu University,
Yinchuan, 750021, China.
2 School of Mathematics and Statistics, South-Central Minzu University,
Wuhan, 430074, China. The corresponding author. Email: [email protected]
Abstract
This paper is dedicated to investigating the adaptive Euler-Maruyama (EM) schemes for the approximation of McKean-Vlasov stochastic differential equations (SDEs) with common noise. When the drift and diffusion coefficients both satisfy the superlinear growth conditions, the convergence rates in finite and infinite horizons are revealed, which reacts to the particle number and step size. Subsequently, there is an illustration of the theory results by means of two numerical examples.
Key words. McKean-Vlasov stochastic differential equations; particle systems; adaptive EM scheme; common noise; convergence
1 Introduction
The McKean-Vlasov SDE (introduced by McKean in [27]) for a -dimensional valued process , is a type of SDEs whose coefficients depend on both state variables and the distributions of state, that is,
[TABLE]
where represents an -dimensional standard Brownian motion and denotes the marginal law of the process at time . The initial condition is given by the -valued random variable where is the space of -measurable random variables with for any .
In this work, we study McKean-Vlasov SDEs with common noise of the form
[TABLE]
where is an -dimensional Brownian motion and denotes the flow of marginal conditional distributions of given the common noise. In contrast to the McKean-Vlasov SDEs without common noise (1.1), the marginal conditional distributions are no longer deterministic. The classical notion of propagation of chaos can be intuitively viewed as the idea that in a large network of interacting particles, these particles will gradually become independent as . When all particles have a common random source, (i.e., all particles are influenced by the track of the common noise ,) it is reasonable that they are asymptotically independent. However, for the information generated by the common noise, it seems unlikely to become asymptotically independent as . To put it another way, as , it is expected that the empirical distribution of the particles will converge to the common conditional distribution of each particle given a common source of . For more details on this topic, please refer to [7, 8].
The simulation of McKean-Vlasov SDEs typically involves two steps. The first step is to use the empirical measure
[TABLE]
to approximate the measure , where denotes the Dirac measure at point and is the solution to interacting particle system
[TABLE]
where and are independent Brownian motions for any The second step is to construct a reasonable time-step scheme to discretise the particle system .
The existence and uniqueness theory of strong solutions for McKean-Vlasov SDEs with coefficients exhibiting linear growth and satisfying Lipschitz-type conditions (both in the state and the measure components) is well-established (see[34, 23, 16]). In the case of the drift exhibiting super-linear growth while the diffusion maintains linear growth, it is known that McKean-Vlasov SDEs admit a unique strong solution[9]. The theories about well-posedness for McKean-Vlasov SDEs whose coefficients exhibit super-linear growth in the state variable have been extensively studied in various literature[30, 28, 21]. For results of further advancements on the existence and uniqueness of weak and strong solutions, please refer to [4, 29, 15, 19, 35] and the references therein.
In recent years, McKean-Vlasov SDEs have garnered substantial attention largely due to their wide-ranging applicability in diverse technical domains and mathematical models. The study of the McKean-Vlasov equations with common noise has become a focal point, as demonstrated in [31], where a limiting equation for individual particles interacting with each other is presented. The significance of common noise in McKean-Vlasov SDE is further underscored by their applications in modeling complex systems. In the realm of financial systems, these models can effectively capture the dynamics of contagion and common exposure risks within large-scale networks, as demonstrated in [24]. Further literature, in which the motivation to consider the class McKean-Vlasov SDEs of a common noise source, plays a crucial role in McKean-Vlasov SDEs and associated interacting equations extends to the field of neuroscience. In this context, McKean-Vlasov equations are used to characterize the voltage fluctuations of a representative neuron in a complex network (see [11, 36]). The well-posedness theories of McKean-Vlasov SDEs with common noise have been established in [8, 21, 14].
Concerning classical SDEs, there is a large body of literature investigating numerical approximation[6, 20]. The scenario where coefficients exhibit super-linear growth has attracted significant attention and is now well-explored in the literature. Building on this, prior studies have introduced tamed EM schemes tailored for local Lipschitz drift coefficients that may potentially exhibit super-linear growth in [18, 33]. This approach was subsequently expanded to accommodate diffusion coefficients with super-linear growth, as detailed in references [22, 17].
The pioneering works on the numerical approximation of McKean-Vlasov SDEs within a continuous framework were presented in [5]. Conventional numerical approximation methods for McKean-Vlasov SDEs with Lipschitz continuous coefficients are well-documented, and strong convergence results with a convergence order of 1/2 have been established using various numerical schemes, e.g., explicit EM scheme [25], tamed scheme [21], projected scheme [4], Milstein scheme [1, 2]. The investigation into stable time-stepping schemes for the tamed EM scheme and an implicit scheme for interacting particle systems (in the absence of common noise) was initiated in [10]. This study was conducted under the premise that the drift term is permitted to exhibit super-linear growth in the state component, while the diffusion term adheres to global Lipschitz continuity in both the state variable and the measure component.
This paper is centered on a time-stepping scheme to approximate the particle system in equation (1.3) by using an adaptive timestep. Fang utilized this approach to investigate various properties of SDEs in both finite and infinite time horizons [12]. After that, the methodology was introduced by Reisinger and Stockinger in their article, where they presented an adaptive time-stepping scheme for McKean-Vlasov SDEs with super-linear growth in the drift and diffusion, assuming only a monotonicity condition, (see [32]). Building upon this foundation, this paper extends the study to McKean-Vlasov SDEs with a common noise in both finite and infinite time. A key requirement of the paper is that both the drift term and the diffusion term grow superlinearly in state variables.
In summary, under fairly general assumptions, this paper investigates the adaptive EM schemes for the McKean-Vlasov SDEs with common noise and shows the strong convergence rates in finite and infinite horizons.
The paper is structured as follows. In Section 2, we introduce some basic notations and probabilistic framework which gives background results needed throughout this paper. In Section 3, we describe the particle method and the adaptive scheme and give the main results both in finite and infinite horizons. In Section 4, we present several numerical examples to support our theoretical results.
2 Mathematical preliminaries
Let represent the -dimensional Euclidean space. For all linear operators (e.g. matrices ) appearing in this article, we will use the standard Hilbert–Schmidt norm denoted by . The transpose of a matrix will be denoted by In addition, we use to denote the family of all probability measures on , where denotes the Borel -field over , and define the subset of probability measures with finite th moment by
[TABLE]
For any , the -Wasserstein distance between and is defined as
[TABLE]
where is the set of all the couplings of and , i.e., if and only if and . is a Polish space under the -Wasserstein metric. For a given will denote the space of -valued, -measurable random variables satisfying Furthermore, refers to the space of -valued continuous, -adapted processes, defined on the interval for with finite -th moments.
We give the complete probability spaces and endowed with two right-continuous and complete filtrations and Here, we assume the Brownian motion will be constructed on the and and will be constructed on the We then define the product space where is the completion of and is the complete and right continuous augmentation of It is known from Lemma 2.4 in [8] that for a given random variable , equipped with the completion the mapping is -almost surely well defined and forms a random variable from into , can also be seen as a conditional law of given .
3 Adaptive time-stepping strategies
3.1 Definition of adaptive EM scheme
In this subsection, we introduce the adaptive EM scheme for the interacting particle system (1.3) that is associated with (1.2), and we use a scheme that allows the computation of an empirical measure for all . We start at with for all . At step now we perform the EM scheme given by
[TABLE]
where and and the step for each particle the size of the adaptive time-step and increases as increases until such that for each , where
[TABLE]
We use the notation to represent the nearest time point before time and to denote the number of step approximations up to time . Then we introduce the piecewise constant interpolant process and measure , and also define the continuous interpolant process
[TABLE]
so that \big{(}\hat{X}_{t}^{i,N}\big{)}_{t\in[0,T]} is the solution to the SDE
[TABLE]
3.2 Boundedness and convergence in finite horizon
This subsection investigates the boundedness and convergence of adaptive scheme in finite horizon.
Assumption 3.1
*The mappings , and are measurable and satisfy:
(1) For some , there exists a constant such that*
[TABLE]
*for any .
(2) There exist constants such that*
[TABLE]
for any
Remark 3.1
Due to Assumption 3.1, there exists a constant such that
[TABLE]
for any and And
[TABLE]
for any and where constant
In the preceding discussion, a set of assumptions has been posited to ensure that the well-posedness of the equation under consideration remains intact. Furthermore, the establishment of moment bounds and the demonstration of strong convergence for the adaptive EM scheme are pivotal objectives that will be addressed in the forthcoming sections.
Compared to the classic EM scheme, which employs a constant time step size , the present analysis incorporates an adaptive scheme wherein the timestep is contingent upon the state variable . This necessitates an adjustment to the timestep management strategy. We will consider a timestep function that is governed by a tunable parameter with . Subsequently, the convergence analysis hinges solely on the examination of the limit as .
Assumption 3.2
*(Adaptive timestep)
(1) The adaptive timestep function is continuous and positive, and there exists a constant such that*
[TABLE]
*where is defined in Assumption 3.1.
(2) The timestep function satisfies*
[TABLE]
(3) There exist constants such that
[TABLE]
Remark 3.2
According to Assumption 3.1(2) and Remark 3.1, there exist constants such that
[TABLE]
[TABLE]
for any The constraints on the timestep function in Assumption 3.2 could ensure that
[TABLE]
[TABLE]
which will play an important role in proving the moment boundedness of numerical solution in Theorem 3.1.
Remark 3.3
We emphasize that the corresponding time-step function can be chosen under the Assumption 3.2. For example, let . Due to (3.6), then and (3.5) is satisfied by taking . Then more details can be seen in Section 4.
The proof of the following lemma can be found in Theorem 2.1 of [21].
Lemma 3.1
Let Assumption 3.1 hold. Then for all , (1.2) admits a unique strong solution such that
[TABLE]
Theorem 3.1
Let Assumption 3.1 and Assumption 3.2 hold. Then is almost surely attainable, and for all , there exists a constant , which depends on and , such that
[TABLE]
Proof. Since the step size is variable, we need to show for any and almost all , there exists finite such that , i.e. . Then, define a stopping time \tau_{R}:=\inf\{t\geq 0:\max_{i\in\{1,\dots,N\}}\big{|}\hat{X}_{t}^{i,N}\big{|}\geq R\} for each By Itô’s formula, we have
[TABLE]
almost surely for any . Consequently, by taking the expectation and using Remark 3.1, Young’s inequality, we deduce
[TABLE]
Hence, by (3.3) and Assumption 3.2, taking gives
[TABLE]
where \mathbb{E}\left[\big{|}W_{\pi}^{i}-W_{\underline{\pi}}^{i}\big{|}^{p}\Big{|}{\cal F}_{\underline{\pi}}\right]\leq C_{p}(\pi-\underline{\pi})^{p/2}, and \mathbb{E}\Big{[}{\cal W}_{2}^{2}(\mu_{\pi}^{\bar{X},N},\delta_{0})\Big{]}=\mathbb{E}\Big{[}\big{|}\bar{X}_{\pi}^{i,N}\big{|}^{2}\Big{]}. By substituting the aforementioned equations into equation (3.2) and applying Young’s inequality, we arrive at
[TABLE]
Then using Gronwall’s inequality, we get
[TABLE]
Note that
[TABLE]
Hence
[TABLE]
Therefore, as , and is attainable. Then using the stability up to time the claim follows from Fatou’s lemma.
Given time , the step-size depends on and , thus for each particle step size number until time is a random variable. Consequently the total number of steps makes the following estimate.
Proposition 3.1
Let Assumption 3.1 and Assumption 3.2 hold. Then there exists independent of and such that
[TABLE]
Proof. Obviously, we see
[TABLE]
We can get the result immediately by Theorem 3.1.
To demonstrate the approximation of the particle system, we now introduce the propagation of chaos result. Initially, since we have already defined the interacting particle system in (1.3), we shall focus exclusively on the system of noninteracting particles:
[TABLE]
almost surely for any and Moreover, by Proposition 2.11 in [8],
[TABLE]
The following result can be shown in the same way as shown in Theorem 3.2 in [13], so we omit it here.
Proposition 3.2
Let Assumption 3.1 be satisfied with , then
[TABLE]
where the constant does not depend on .
Theorem 3.2
(strong convergence) Let Assumption 3.1 and Assumption 3.2 hold. Then, for any , there exists such that
[TABLE]
Proof. First, define . We get
[TABLE]
Subsequently, employing Itô’s formula and the fact that we derive
[TABLE]
Note that
[TABLE]
Using the polynomial growth condition in Assumption 3.1, we know
[TABLE]
where \tilde{Q}_{L}(\hat{X}_{s}^{i,N},\bar{X}_{s}^{i,N}):=L(1+\big{|}\hat{X}_{s}^{i,N}\big{|}^{q}+\big{|}\bar{X}_{s}^{i,N}\big{|}^{q}). Similarly,
[TABLE]
Combining Remark 3.1 on and , we are able to deduce that
[TABLE]
where \tilde{Q}_{K}(\hat{X}_{s}^{i,N},\bar{X}_{s}^{i,N}):=K(1+\big{|}\hat{X}_{s}^{i,N}\big{|}^{q}+\big{|}\bar{X}_{s}^{i,N}\big{|}^{q}). According to Assumption 3.1, we know
[TABLE]
Using Young’s inequality and all the estimates above, we conclude that
[TABLE]
Additionally, the definition of Wasserstein distance yields
[TABLE]
By utilising Assumption 3.1 and Young’s inequality, we obtain
[TABLE]
Using Hölder’s inequality means
[TABLE]
Owing to the boundedness established in Theorem 3.1, we arrive at
[TABLE]
From (3.3) for any applying Hölder’s inequality yields
[TABLE]
where \mathbb{E}\left[\big{|}b(\bar{X}_{s}^{i,N},\mu_{s}^{\bar{X},N})\big{|}^{4p}\right], \mathbb{E}\Big{[}\big{\|}\sigma(\bar{X}_{s}^{i,N},\mu_{s}^{\bar{X},N})\big{\|}^{4p}\Big{]} and \mathbb{E}\Big{[}\big{\|}\sigma^{0}(\bar{X}_{s}^{i,N},\mu_{s}^{\bar{X},N})\big{\|}^{4p}\Big{]} are uniformly bounded on by Remark 3.1 and Theorem 3.1. Additionally, we have
[TABLE]
[TABLE]
[TABLE]
Therefore, collecting all the estimates together, we get
[TABLE]
The result can be obtained immediately by applying Gronwall’s inequality.
3.3 Boundedness and convergence in infinite horizon
In this subsection, we extend our analysis from finite time to infinite time by giving moment bounds and strong convergence order under some stronger assumptions. We modify Assumption 3.1(1) as the following assumption:
Assumption 3.3
There exist constants such that
[TABLE]
for any and .
Remark 3.4
Based on Assumption 3.3, for any , we obtain
[TABLE]
Choose sufficiently small to make hold. Then from (3.4), we see that there exist constants such that
[TABLE]
where ,
Assumption 3.4
*(Adaptive timestep for infinite time interval)
(1) The adaptive timestep function is continuous and bounded by with , and there exists a positive constant such that for all and satisfies*
[TABLE]
*where is the same as that in Assumption 3.1.
(2) The timestep function satisfies*
[TABLE]
We can choose appropriately so that it satisfies and . The following result can be found in Proposition 2.5 in [35], so we omit it here.
Lemma 3.2
Let be a solution to McKean-Vlasov SDE (1.2). If (1.2) satisfies Assumption 3.3, then for all there exists a constant which is independent of . For any , we have
[TABLE]
Theorem 3.3
(Moment bound in infinite time interval) If (1.2) satisfies Assumption 3.1(2), Assumption 3.3, and the timestep function satisfies Assumption 3.4, then for all , there exists a constant that is independent of and , but is solely dependent on initial condition the exponent and parameters such that for all ,
[TABLE]
Proof. First, for some , by using (3.3) we get
[TABLE]
where \mathbb{E}\left[\big{|}W_{s}-W_{\underline{s}}\big{|}^{p}\Big{|}{\cal F}_{\underline{s}}\right]\leq C_{p}(s-\underline{s})^{p/2} and \mathbb{E}\Big{[}{\cal W}_{2}^{p}(\mu_{s}^{\bar{X},N},\delta_{0})\Big{]}=\mathbb{E}\Big{[}\big{|}\bar{X}_{s}^{i,N}\big{|}^{p}\Big{]} are used. Moreover, using Remark 3.4 and (3.3) yields
[TABLE]
Next, by applying Itô’s formula to e^{\gamma pt}\big{|}\hat{X}_{t}^{i,N}\big{|}^{p} for any we get
[TABLE]
Then, it follows from (3.3) and (3.3) that
[TABLE]
We choose gives
[TABLE]
Hence,
[TABLE]
Combining Theorem 4.1 in [26] and Proposition 3.2 in [35] gives the following results.
Proposition 3.3
Let Assumption 3.1, Assumption 3.3 be satisfied with , if and then for some
[TABLE]
where the constant does not depend on and .
Theorem 3.4
(Strong convergence order) Let and If (1.2) satisfies Assumption 3.1, Assumption 3.3, and the time-step function h satisfies Assumption 3.4, with , then there exists a constant such that
[TABLE]
Proof. Define then we have
[TABLE]
For any by Itô’s formula we obtain
[TABLE]
Note that
[TABLE]
Using Assumption 3.1 and Young’s inequality, it can be deduced that
[TABLE]
where \tilde{Q}_{L}(\hat{X}_{s}^{i,N},\bar{X}_{s}^{i,N}):=L(1+\big{|}\hat{X}_{s}^{i,N}\big{|}^{q}+\big{|}\bar{X}_{s}^{i,N}\big{|}^{q}). Likewise, applying Remark 3.1 and Young’s inequality on means
[TABLE]
We see
[TABLE]
where \tilde{Q}_{K}(\hat{X}_{s}^{i,N},\bar{X}_{s}^{i,N}):=K(1+\big{|}\hat{X}_{s}^{i,N}\big{|}^{q}+\big{|}\bar{X}_{s}^{i,N}\big{|}^{q}). Similarly, one obtains
[TABLE]
where
[TABLE]
By Assumption 3.3, we have
[TABLE]
Hence, substituting the derived estimates (3.3), (3.3), (3.3), (3.3) into (3.3) yields
[TABLE]
Recall
[TABLE]
and
[TABLE]
Therefore, taking the expectation of both sides yields
[TABLE]
By applying Young’s inequality, we can further analyze
[TABLE]
Since is independent of , we chose so
[TABLE]
By Hölder’s inequality, we derive
[TABLE]
By Theorem 3.3, there exists a constant such that
[TABLE]
And by the same argument as Theorem 3.2, it is known that
[TABLE]
Hence, we have
[TABLE]
Then,
[TABLE]
4 Numerical examples
The purpose of this section is to demonstrate the performance of the scheme proposed in this paper. To approximate the law at each timestep on the interval , we use a standard particle method with particles for each realization of . For our experiment, we use to approximate the conditional law. Since the exact solution of the example is not known, to illustrate the strong convergence in , we therefore compute the root-mean-square error (RMSE) by comparing the numerical solution at level with the solution at level , at the final time . This is denoted by RMSE,
[TABLE]
where denotes the numerical solution of at time (for our numerical experiment set ). and the two-particle systems at each level are generated by the same Brownian motions. In adaptive timestep function we use for some fixed
Example 4.1
Consider the one-dimensional McKean-Vlasov SDE
[TABLE]
with . So
[TABLE]
[TABLE]
The coefficients can be readily verified to satisfy all assumptions listed above, thus it has a unique strong solution. Consider the particle system of (4.1) as
[TABLE]
*For the adaptive step size, choose *
[TABLE]
Set , then we have
[TABLE]
Hence, . It can be easily verified that Assumption 3.2 holds by choosing the coefficients appropriately. So the adaptive EM scheme can work on this example.
Example 4.2
Consider the one-dimensional McKean-Vlasov SDE
[TABLE]
with . So
[TABLE]
[TABLE]
for all and . It is easy to show that these coefficients satisfy Assumption 3.3. Set then we choose
[TABLE]
These choices show that the adaptive EM scheme can work on this example.
Funding
This work is supported by the National Natural Science Foundation of China (62373383, 62076106), the Fundamental Research Funds for the Central Universities, South-Central MinZu University (CZQ25020, CZZ25007), and the Fund for Academic Innovation Teams of South-Central Minzu University (XTZ24004).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. Bao, C. Reisinger, P. Ren, W. Stockinger, Milstein schemes and antithetic multilevel Monte Carlo sampling for delay Mc Kean–Vlasov equations and interacting particle systems , IMA J. Numer. Anal., 44(4): 2437-2479,
- 2[2] J. Bao, C. Reisinger, P. Ren, W. Stockinger, First-order convergence of Milstein schemes for Mc Kean-Vlasov equations and interacting particle systems , Proc. R. Soc. A., 477 (2245): 20200258(2021).
- 3[3] M. Bauer, T. Meyer-Brandis and F. Proske, Strong solutions of mean-field stochastic differential equations with irregular drift , Electron. J. Probab., 23:1-35(2018).
- 4[4] D. Belomestny and J. Schoenmakers, Projected particle methods for solving Mc Kean–Vlasov stochastic differential equations , SIAM J. Numer. Anal., 56(6):3169–3195(2018).
- 5[5] M. Bossy and D. Talay, A stochastic particle method for the Mc Kean–Vlasov and the Burgers equation , Math. Comp., 66: 157–192(1997).
- 6[6] U. Botija-Munoz, C. Yuan, Explicit Numerical Approximations for SDD Es in Finite and Infinite Horizons using the Adaptive EM Method: Strong Convergence and Almost Sure Exponential Stability , Appl. Math. Comput., 478: 128853(2024).
- 7[7] R. Carmona, and F. Delarue, Probabilistic Theory of Mean Field Games with Applications I:Mean Field FBSD Es,Control, and Games , Probab. Theory Stoch. Model. 83(2018).
- 8[8] R. Carmona, and F. Delarue, Probabilistic Theory of Mean Field Games with Applications II: Mean Field Games with Common Noise and Master Equations , Probab. Theory Stoch. Model. 84(2018).
