Abstract
We consider a simple random walk on the T-fractal and we calculate the exact mean time to first reach the central node . The mean is performed over the set of possible walks from a given origin and over the set of starting points uniformly distributed throughout the sites of the graph, except . By means of analytic techniques based on decimation procedures, we find the explicit expression for as a function of the generation and of the volume of the underlying fractal. Our results agree with the asymptotic ones already known for diffusion on the T-fractal and, more generally, they are consistent with the standard laws describing diffusion on low-dimensional structures.
- Received 15 October 2007
DOI:https://doi.org/10.1103/PhysRevE.77.011128
©2008 American Physical Society