Search arXivSearch

arXiv · 1809.10498

Effective dynamics for non-reversible stochastic differential equations: a quantitative study

Abstract

Coarse-graining is central to reducing dimensionality in molecular dynamics, and is typically characterized by a mapping which projects the full state of the system to a smaller class of variables. While extensive literature has been devoted to coarse-graining starting from reversible systems, not much is known in the non-reversible setting. In this article, starting with a non-reversible dynamics, we introduce and study an effective dynamics which approximates the (non-closed) projected dynamics. Under fairly weak conditions on the system, we prove error bounds on the trajectorial error between the projected and the effective dynamics. In addition to extending existing results to the non-reversible setting, our error estimates also indicate that the notion of mean force motivated by this effective dynamics is a good one.

Explore related subjects

Keep this discovery

BibTeXRIS

Frédéric Legoll, Tony Lelièvre, Upanshu Sharma. 2018-09-27. Effective dynamics for non-reversible stochastic differential equations: a quantitative study. https://doi.org/10.1088/1361-6544%2Fab34bf

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