SearcharxivSearch

arXiv · 0710.4394

Markovian perturbation, response and fluctuation dissipation theorem

Abstract

We consider the Fluctuation Dissipation Theorem (FDT) of statistical physics from a mathematical perspective. We formalize the concept of "linear response function" in the general framework of Markov processes. We show that for processes out of equilibrium it depends not only on the given Markov process X(s) but also on the chosen perturbation of it. We characterize the set of all possible response functions for a given Markov process and show that at equilibrium they all satisfy the FDT. That is, if the initial measure is invariant for the given Markov semi-group, then for any pair of times s<t and nice functions f,g, the dissipation, that is, the derivative in s of the covariance of g(X(t)) and f(X(s)) equals the infinitesimal response at time t and direction g to any Markovian perturbation that alters the invariant measure of X(.) in the direction of f at time s. The same applies in the so called FDT regime near equilibrium, i.e. in the limit s going to infinity with t-s fixed, provided X(s) converges in law to an invariant measure for its dynamics. We provide the response function of two generic Markovian perturbations which we then compare and contrast for pure jump processes on a discrete space, for finite dimensional diffusion processes, and for stochastic spin systems.

Explore related subjects

Keep this discovery

BibTeXRIS

Amir Dembo, Jean-Dominique Deuschel. 2010-02-17. Markovian perturbation, response and fluctuation dissipation theorem. https://arxiv.org/abs/0710.4394

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