Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2501.11913

A trajectorial approach to the gradient flow of McKean-Vlasov SDEs with mobility

Zhenxin Liu·Xuewei Wang
View original source ↗Read source document ↗Export metadata ↓

Abstract

We establish the gradient flow representation of diffusion with mobility $b$ with respect to the modified Wasserstein quasi-metric $W_h$, where $h(r)=rb(r)$. The appropriate selection of the free energy functional depends on the specific form of the generalized entropy. Different from the JKO scheme, we derive the trajectorial version of the relative entropy dissipation identity for the McKean-Vlasov stochastic differential equation (SDE) with Nemytskii-type coefficients, utilizing techniques from stochastic analysis. Based on this, we demonstrate that the trajectorial average of the solution process to the McKean-Vlasov SDE, with respect to the underlying measure, corresponds to the rate of dissipation of the free energy. As an application, we present the energy dissipation of the Fermi-Dirac-Fokker-Planck equation, a model widely used in physics and biology to describe saturation effects. Inspired by numerical simulations, we propose two questions on condensation phenomena and non-exponential convergence rate.

Explore related subjects

math.PRmath.APmath.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhenxin Liu, Xuewei Wang. 2025-01-21. A trajectorial approach to the gradient flow of McKean-Vlasov SDEs with mobility. https://arxiv.org/abs/2501.11913

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗