Search arXivSearch

arXiv · 2006.00463

Well-posedness and tamed schemes for McKean-Vlasov Equations with Common Noise

Abstract

In this paper, we first establish well-posedness of McKean-Vlasov stochastic differential equations (McKean-Vlasov SDEs) with common noise, possibly with coefficients having super-linear growth in the state variable. Second, we present stable time-stepping schemes for this class of McKean-Vlasov SDEs. Specifically, we propose an explicit tamed Euler and tamed Milstein scheme for an interacting particle system associated with the McKean-Vlasov equation. We prove stability and strong convergence of order $1/2$ and $1$, respectively. To obtain our main results, we employ techniques from calculus on the Wasserstein space. The proof for the strong convergence of the tamed Milstein scheme only requires the coefficients to be once continuously differentiable in the state and measure component. To demonstrate our theoretical findings, we present several numerical examples, including mean-field versions of the stochastic $3/2$ volatility model and the stochastic double well dynamics with multiplicative noise.

Explore related subjects

Keep this discovery

BibTeXRIS

Chaman Kumar, Neelima, Christoph Reisinger, Wolfgang Stockinger. 2020-05-31. Well-posedness and tamed schemes for McKean-Vlasov Equations with Common Noise. https://arxiv.org/abs/2006.00463

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR