SearcharxivSearch

arXiv · 1708.09610

Einstein relation and linear response in one-dimensional Mott variable-range hopping

Abstract

We consider one-dimensional Mott variable-range hopping with a bias, and prove the linear response as well as the Einstein relation, under an assumption on the exponential moments of the distances between neighboring points. In a previous paper \cite{FGS} we gave conditions on ballisticity, and proved that in the ballistic case the environment viewed from the particle approaches, for almost any initial environment, a given steady state which is absolutely continuous with respect to the original law of the environment. Here, we show that this bias--dependent steady state has a derivative at zero in terms of the bias (linear response), and use this result to get the Einstein relation. Our approach is new: instead of using e.g. perturbation theory or regeneration times, we show that the Radon-Nikodym derivative of the bias--dependent steady state with respect to the equilibrium state in the unbiased case satisfies an $L^p$-bound, $p>2$, uniformly for small bias. This $L^p$-bound yields, by a general argument not involving our specific model, the statement about the linear response.

Explore related subjects

Keep this discovery

BibTeXRIS

A. Faggionato, N. Gantert, M. Salvi. 2017-08-31. Einstein relation and linear response in one-dimensional Mott variable-range hopping. https://arxiv.org/abs/1708.09610

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