SearcharxivSearch

arXiv · 0709.1629

Disordered pinning models and copolymers: beyond annealed bounds

Abstract

We consider a general model of a disordered copolymer with adsorption. This includes, as particular cases, a generalization of the copolymer at a selective interface introduced by Garel et al. [Europhys. Lett. 8 (1989) 9--13], pinning and wetting models in various dimensions, and the Poland--Scheraga model of DNA denaturation. We prove a new variational upper bound for the free energy via an estimation of noninteger moments of the partition function. As an application, we show that for strong disorder the quenched critical point differs from the annealed one, for example, if the disorder distribution is Gaussian. In particular, for pinning models with loop exponent $0<α<1/2$ this implies the existence of a transition from weak to strong disorder. For the copolymer model, under a (restrictive) condition on the law of the underlying renewal, we show that the critical point coincides with the one predicted via renormalization group arguments in the theoretical physics literature. A stronger result holds for a "reduced wetting model" introduced by Bodineau and Giacomin [J. Statist. Phys. 117 (2004) 801--818]: without restrictions on the law of the underlying renewal, the critical point coincides with the corresponding renormalization group prediction.

Explore related subjects

Keep this discovery

BibTeXRIS

Fabio Lucio Toninelli. 2008-08-22. Disordered pinning models and copolymers: beyond annealed bounds. https://doi.org/10.1214/07-aap496

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