Anomalous diffusion on random graphs

Simple item page
dc.creatorSnider, Joseph
dc.creatorYu, Clare C.
dc.date2002-12-20
dc.date.accessioned2026-07-07T02:48:51Z
dc.date.available2026-07-07T02:48:51Z
dc.descriptionWe 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.
dc.description4 pages, 6 figures
dc.identifierhttps://arxiv.org/abs/cond-mat/0212506
dc.identifierhttp://arxiv.org/abs/cond-mat/0212506
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/20572
dc.subjectSoft Condensed Matter
dc.titleAnomalous diffusion on random graphs
dc.typetext

Files

Collections

arXiv