SearcharxivSearch

arXiv · math/0511561

Random walk models and probabilistic techniques for inhomogeneous polymer chains

Abstract

Modeling of polymer chains has received a lot of attention in mathematics. In fact, probabilistic models that naturally arise in statistical mechanics have been widely studied by mathematicians for the very challenging and novel problems that they pose. The physical situation that we consider in this thesis is that of a polymer in the proximity of an interface between two selective solvents, in the case when the interaction of the monomers with the solvents and the interface may vary from monomer to monomer (inhomogeneous polymer). In interesting cases thee is a phase transition between a state in which the polymer sticks very close to the interface (localized regime) and a state in which it wanders away from it (delocalized regime). The mechanism underlying such a transition is an energy/entropy competition. Our task has been to study random walk models of polymer chains with the purpose of understanding this competition in a deep and quantitative way. Despite the fact that the definition of these models is extremely elementary, their analysis is not simple at all, and several interesting questions are still open. In this Ph.D. thesis we present new results that answer some of these questions. The analysis performed has required the application of a wide range of techniques, including large deviations, concentration inequalities, renewal theory, fluctuation theory for random walks. A numerical and statistical study has been performed too. Finally we prove a local limit theorem for random walks conditioned to stay positive.

Explore related subjects

Keep this discovery

BibTeXRIS

Francesco Caravenna. 2005-11-24. Random walk models and probabilistic techniques for inhomogeneous polymer chains. https://arxiv.org/abs/math/0511561

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