SearcharxivSearch

arXiv · 0907.5076

The weak coupling limit of disordered copolymer models

Abstract

A copolymer is a chain of repetitive units (monomers) that are almost identical, but they differ in their degree of affinity for certain solvents. This difference leads to striking phenomena when the polymer fluctuates in a nonhomogeneous medium, for example, made of two solvents separated by an interface. One may observe, for instance, the localization of the polymer at the interface between the two solvents. A discrete model of such system, based on the simple symmetric random walk on $\mathbb {Z}$, has been investigated in [Bolthausen and den Hollander, Ann. Probab. 25 (1997), 1334-1366], notably in the weak polymer-solvent coupling limit, where the convergence of the discrete model toward a continuum model, based on Brownian motion, has been established. This result is remarkable because it strongly suggests a universal feature of copolymer models. In this work, we prove that this is indeed the case. More precisely, we determine the weak coupling limit for a general class of discrete copolymer models, obtaining as limits a one-parameter [$\alpha \in(0,1)$] family of continuum models, based on $\alpha$-stable regenerative sets.

Explore related subjects

Keep this discovery

BibTeXRIS

Francesco Caravenna, Giambattista Giacomin. 2009-07-29. The weak coupling limit of disordered copolymer models. https://doi.org/10.1214/10-aop546

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