Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · math/0507178

A renewal theory approach to periodic copolymers with adsorption

Francesco Caravenna·Giambattista Giacomin·Lorenzo Zambotti
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider a general model of a heterogeneous polymer chain fluctuating in the proximity of an interface between two selective solvents. The heterogeneous character of the model comes from the fact that the monomer units interact with the solvents and with the interface according to some charges that they carry. The charges repeat themselves along the chain in a periodic fashion. The main question concerning this model is whether the polymer remains tightly close to the interface, a phenomenon called localization, or whether there is a marked preference for one of the two solvents, thus yielding a delocalization phenomenon. In this paper, we present an approach that yields sharp estimates for the partition function of the model in all regimes (localized, delocalized and critical). This, in turn, makes possible a precise pathwise description of the polymer measure, obtaining the full scaling limits of the model. A key point is the closeness of the polymer measure to suitable Markov renewal processes, Markov renewal theory being one of the central mathematical tools of our analysis.

Explore related subjects

math.PRmath-phmath.MP

Keep this discovery

BibTeXRIS

Francesco Caravenna, Giambattista Giacomin, Lorenzo Zambotti. 2007-10-24. A renewal theory approach to periodic copolymers with adsorption. https://doi.org/10.1214/105051607000000159

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗