SearcharxivSearch

arXiv · 2507.17469

Nonlinear rough Fokker-Planck equations

Abstract

McKean-Vlasov SDEs describe systems where the dynamics depend on the law of the process. The corresponding Fokker-Planck equation is a nonlinear, nonlocal PDE for the corresponding measure flow. In the presence of common noise and conditional law dependence, the evolution becomes random and is governed by a stochastic Fokker-Planck equation; that is, a nonlinear, nonlocal SPDE in the space of measures. (Such equations constitute an important ingredient in the theory of mean-field games with common noise.) Well-posedness of such SPDEs is a difficult problem, the best result to date due to Coghi-Gess (2019), which however comes with dimension-dependent regularity assumptions. In the present work, we show how rough path techniques can circumvent these entirely. Hence, and somewhat contrarily to common believe, the use of rough paths leads to substantially less regularity demands on the coefficients than methods rooted in classical stochastic analysis methods.

Explore related subjects

Keep this discovery

BibTeXRIS

Fabio Bugini, Peter K. Friz, Wilhelm Stannat. 2025-07-23. Nonlinear rough Fokker-Planck equations. https://arxiv.org/abs/2507.17469

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