SearcharxivSearch

arXiv · 0704.0582

Continuous interfaces with disorder: Even strong pinning is too weak in 2 dimensions

Abstract

We consider statistical mechanics models of continuous height effective interfaces in the presence of a delta-pinning at height zero. There is a detailed mathematical understanding of the depinning transition in 2 dimensions without disorder. Then the variance of the interface height w.r.t. the Gibbs measure stays bounded uniformly in the volume for any positive pinning force and diverges like the logarithm of the pinning force when it tends to zero. How does the presence of a quenched disorder term in the Hamiltonian modify this transition? We show that an arbitarily weak random field term is enough to beat an arbitrarily strong delta-pinning in 2 dimensions and will cause delocalization. The proof is based on a rigorous lower bound for the overlap between local magnetizations and random fields in finite volume. In 2 dimensions it implies growth faster than the volume which is a contradiction to localization. We also derive a simple complementary inequality which shows that in higher dimensions the fraction of pinned sites converges to one when the pinning force tends to infinity.

Explore related subjects

Keep this discovery

BibTeXRIS

C. Kuelske, E. Orlandi. 2007-04-04. Continuous interfaces with disorder: Even strong pinning is too weak in 2 dimensions. https://arxiv.org/abs/0704.0582

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