SearcharxivSearch

arXiv · 1110.5781

Hierarchical pinning model in correlated random environment

Abstract

We consider the hierarchical disordered pinning model studied in [9], which exhibits a localization/delocalization phase transition. In the case where the disorder is i.i.d. (independent and identically distributed), the question of relevance/irrelevance of disorder (i.e. whether disorder changes or not the critical properties with respect to the homogeneous case) is by now mathematically rather well understood [14,15]. Here we consider the case where randomness is spatially correlated and correlations respect the hierarchical structure of the model; in the non-hierarchical model our choice would correspond to a power-law decay of correlations. In terms of the critical exponent of the homogeneous model and of the correlation decay exponent, we identify three regions. In the first one (non-summable correlations) the phase transition disappears. In the second one (correlations decaying fast enough) the system behaves essentially like in the i.i.d. setting and the relevance/irrelevance criterion is not modified. Finally, there is a region where the presence of correlations changes the critical properties of the annealed system.

Explore related subjects

Keep this discovery

BibTeXRIS

Quentin Berger, Fabio Toninelli. 2011-10-26. Hierarchical pinning model in correlated random environment. https://arxiv.org/abs/1110.5781

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