SearcharxivSearch

arXiv · 1708.03713

Localization of directed polymers with general reference walk

Abstract

Directed polymers in random environment have usually been constructed with a simple random walk on the integer lattice. It has been observed before that several standard results for this model continue to hold for a more general reference walk. Some finer results are known for the so-called long-range directed polymer in which the reference walk lies in the domain of attraction of an $\alpha$-stable process. In this note, low-temperature localization properties recently proved for the classical case are shown to be true with any reference walk. First, it is proved that the polymer's endpoint distribution is asymptotically purely atomic, thus strengthening the best known result for long-range directed polymers. A second result proving geometric localization along a positive density subsequence is new to the general case. The proofs use a generalization of the approach introduced by the author with S. Chatterjee in a recent manuscript on the quenched endpoint distribution; this generalization allows one to weaken assumptions on the both the walk and the environment. The methods of this paper also give rise to a variational formula for free energy which is analogous to the one obtained in the simple random walk case.

Explore related subjects

Keep this discovery

BibTeXRIS

Erik Bates. 2017-08-11. Localization of directed polymers with general reference walk. https://doi.org/10.1214/18-ejp158

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