Search arXivSearch

arXiv · 1908.00955

Weak Existence and Uniqueness for McKean-Vlasov SDEs with Common Noise

Abstract

This paper concerns the McKean-Vlasov stochastic differential equation (SDE) with common noise. An appropriate definition of a weak solution to such an equation is developed. The importance of the notion of compatibility in this definition is highlighted by a demonstration of its r\^ole in connecting weak solutions to McKean-Vlasov SDEs with common noise and solutions to corresponding stochastic partial differential equations (SPDEs). By keeping track of the dependence structure between all components in a sequence of approximating processes, a compactness argument is employed to prove the existence of a weak solution assuming boundedness and joint continuity of the coefficients (allowing for degenerate diffusions). Weak uniqueness is established when the private (idiosyncratic) noise's diffusion coefficient is non-degenerate and the drift is regular in the total variation distance. This seems sharp when one considers using finite-dimensional noise to regularise an infinite dimensional problem. The proof relies on a suitably tailored cost function in the Monge-Kantorovich problem and representation of weak solutions via Girsanov transformations.

Explore related subjects

Keep this discovery

BibTeXRIS

William R. P. Hammersley, David Šiška, Łukasz Szpruch. 2019-08-02. Weak Existence and Uniqueness for McKean-Vlasov SDEs with Common Noise. https://arxiv.org/abs/1908.00955

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