SearcharxivSearch

arXiv · math/0304366

Localization-delocalization phenomena for random interfaces

Abstract

We consider d-dimensional random surface models which for d=1 are the standard (tied-down) random walks (considered as a random ``string''). In higher dimensions, the one-dimensional (discrete) time parameter of the random walk is replaced by the d-dimensional lattice \Z^d, or a finite subset of it. The random surface is represented by real-valued random variables ϕ_i, where i is in \Z^d. A class of natural generalizations of the standard random walk are gradient models whose laws are (formally) expressed as P(dϕ) = 1/Z \exp[-\sum_{|i-j|=1}V(ϕ_i-ϕ_j)] \prod_i dϕ_i, V:\R -> R^+ convex, and with some growth conditions. Such surfaces have been introduced in theoretical physics as (simplified) models for random interfaces separating different phases. Of particular interest are localization-delocalization phenomena, for instance for a surface interacting with a wall by attracting or repulsive interactions, or both together. Another example are so-called heteropolymers which have a noise-induced interaction. Recently, there had been developments of new probabilistic tools for such problems. Among them are: o Random walk representations of Helffer-Sjöstrand type, o Multiscale analysis, o Connections with random trapping problems and large deviations We give a survey of some of these developments.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Erwin Bolthausen. 2003-04-24. Localization-delocalization phenomena for random interfaces. https://arxiv.org/abs/math/0304366

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