SearcharxivSearch

arXiv · 0711.4649

Hierarchical pinning models, quadratic maps and quenched disorder

Abstract

We consider a hierarchical model of polymer pinning in presence of quenched disorder, introduced by B. Derrida, V. Hakim and J. Vannimenius in 1992, which can be re-interpreted as an infinite dimensional dynamical system with random initial condition (the disorder). It is defined through a recurrence relation for the law of a random variable {R_n}_{n=1,2,...}, which in absence of disorder (i.e., when the initial condition is degenerate) reduces to a particular case of the well-known Logistic Map. The large-n limit of the sequence of random variables 2^{-n} log R_n, a non-random quantity which is naturally interpreted as a free energy, plays a central role in our analysis. The model depends on a parameter alpha>0, related to the geometry of the hierarchical lattice, and has a phase transition in the sense that the free energy is positive if the expectation of R_0 is larger than a certain threshold value, and it is zero otherwise. It was conjectured by Derrida et al. (1992) that disorder is relevant (respectively, irrelevant or marginally relevant) if 1/2 1/2 we find the correct scaling form (for weak disorder) of the critical point shift.

Explore related subjects

Keep this discovery

BibTeXRIS

Giambattista Giacomin, Hubert Lacoin, Fabio Lucio Toninelli. 2007-11-29. Hierarchical pinning models, quadratic maps and quenched disorder. https://doi.org/10.1007/s00440-009-0205-y

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