SearcharxivSearch

arXiv · 0911.4293

Anomalous diffusion of distinguished particles in bead-spring networks

Abstract

We consider the anomalous sub-diffusion of a class of Gaussian processes that can be expressed in terms of sums of Ornstein-Uhlenbeck processes. As a generic class of processes, we introduce a single parameter such that for any $\nu \in (0,1)$ the process can be tuned to produce a mean-squared displacement with $\E{x^2(t)} \sim t^\nu$ for large $t$. The motivation for the specific structure of these sums of OU processes comes from the Rouse chain model from polymer kinetic theory. We generalize the model by studying the general dynamics of individual particles in networks of thermally fluctuating beads connected by Hookean springs. Such a set-up is similar to the study of Kac-Zwanzig heat bath models. Whereas the existing heat bath literature places its assumptions on the spectrum of the Laplacian matrix associated to the spring connection graph, we study explicit graph structures. In this setting we prove a notion of universality for the Rouse chain's well-known $\E{x^2(t)} \sim t^{1/2}$ scaling behavior. Subsequently we demonstrate the existence of other anomalous behavior by changing the dimension of the connection graph or by allowing repulsive forces among the beads.

Explore related subjects

Keep this discovery

BibTeXRIS

Scott A McKinley. 2009-11-22. Anomalous diffusion of distinguished particles in bead-spring networks. https://arxiv.org/abs/0911.4293

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