Search arXivSearch

arXiv · 1107.2011

Overlaps and Pathwise Localization in the Anderson Polymer Model

Abstract

We consider large time behavior of typical paths under the Anderson polymer measure. If $P$ is the measure induced by rate $\kappa,$ simple, symmetric random walk on $Z^d$ started at $x,$ this measure is defined as $$ d\mu(X)={Z^{-1} \exp\{\beta\int_0^T dW_{X(s)}(s)\}dP(X) $$ where $\{W_x:x\in Z^d\}$ is a field of $iid$ standard, one-dimensional Brownian motions, $\beta>0, \kappa>0$ and $Z$ the normalizing constant. We establish that the polymer measure gives a macroscopic mass to a small neighborhood of a typical path as $T \to \infty$, for parameter values outside the perturbative regime of the random walk, giving a pathwise approach to polymer localization, in contrast with existing results. The localization becomes complete as $\frac{\beta^2}{\kappa}\to\infty$ in the sense that the mass grows to 1. The proof makes use of the overlap between two independent samples drawn under the Gibbs measure $\mu$, which can be estimated by the integration by parts formula for the Gaussian environment. Conditioning this measure on the number of jumps, we obtain a canonical measure which already shows scaling properties, thermodynamic limits, and decoupling of the parameters.

Explore related subjects

Keep this discovery

BibTeXRIS

Francis Comets, Michael Cranston. 2011-07-11. Overlaps and Pathwise Localization in the Anderson Polymer Model. https://arxiv.org/abs/1107.2011

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