Anomalous diffusion on random graphs
Soft Condensed Matter
2007-05-23 v1
Abstract
We show that anomalous diffusion can result when the steps of a random walk are not statistically independent. We present an algorithm that counts all the possible paths of particles diffusing on random graphs with arbitrary degree distribution. Using this to calculate the mean square displacement, we show that in sharp contrast to continua, random walks on random graphs can exhibit anomalous behavior and yet have well-defined and predictable properties.
Cite
@article{arxiv.cond-mat/0212506,
title = {Anomalous diffusion on random graphs},
author = {Joseph Snider and Clare C. Yu},
journal= {arXiv preprint arXiv:cond-mat/0212506},
year = {2007}
}
Comments
4 pages, 6 figures