Papers
Topics
Authors
Recent
Search
2000 character limit reached

Subordinated diffusion and CTRW asymptotics

Published 18 Jul 2010 in cond-mat.stat-mech, math-ph, and math.MP | (1007.3022v3)

Abstract: Anomalous transport is usually described either by models of continuous time random walks (CTRW) or, otherwise by fractional Fokker-Planck equations (FFPE). The asymptotic relation between properly scaled CTRW and fractional diffusion process has been worked out via various approaches widely discussed in literature. Here, we focus on a correspondence between CTRWs and time and space fractional diffusion equation stemming from two different methods aimed to accurately approximate anomalous diffusion processes. One of them is the Monte Carlo simulation of uncoupled CTRW with a L\'evy $\alpha$-stable distribution of jumps in space and a one-parameter Mittag-Leffler distribution of waiting times. The other is based on a discretized form of a subordinated Langevin equation in which the physical time defined via the number of subsequent steps of motion is itself a random variable. Both approaches are tested for their numerical performance and verified with known analytical solutions for the Green function of a space-time fractional diffusion equation. The comparison demonstrates trade off between precision of constructed solutions and computational costs. The method based on the subordinated Langevin equation leads to a higher accuracy of results, while the CTRW framework with a Mittag-Leffler distribution of waiting times provides efficiently an approximate fundamental solution to the FFPE and converges to the probability density function of the subordinated process in a long-time limit.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.