SearcharxivSearch

arXiv · 1803.09344

Large Deviations from the Hydrodynamic Limit for a System with Nearest Neighbor Interactions

Abstract

We give a new proof of the large deviation principle from the hydrodynamic limit for the Ginzberg-Landau model studied in Donsker and Varadhan (1989) using techniques from the theory of stochastic control and weak convergence methods. The proof is based on characterizing subsequential hydrodynamic limits of controlled diffusions with nearest neighbor interaction that arise from a variational representation of certain Laplace functionals. The approach taken here does not require superexponential probability estimates, estimation of exponential moments, or an analysis of eigenvalue problems, that are central ingredients in previous proofs. Instead, proof techniques are very similar to those used for the law of large number analysis, namely in the proof of convergence to the hydrodynamic limit (cf. Guo, Papanicolaou and Varadhan (1988)). Specifically, the key step in the proof is establishing suitable bounds on relative entropies and Dirichlet forms associated with certain controlled laws. This general approach has the promise to be applicable to other interacting particle systems as well and to the case of non-equilibrium starting configurations, and to infinite volume systems.

Explore related subjects

Keep this discovery

BibTeXRIS

Sayan Banerjee, Amarjit Budhiraja, Michael Perlmutter. 2018-03-25. Large Deviations from the Hydrodynamic Limit for a System with Nearest Neighbor Interactions. https://arxiv.org/abs/1803.09344

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