Exact mean first-passage time on the T-graph
| dc.creator | Agliari, E. | |
| dc.date | 2008-02-15 | |
| dc.date.accessioned | 2026-07-07T09:21:14Z | |
| dc.date.available | 2026-07-07T09:21:14Z | |
| dc.description | We consider a simple random walk on the T-fractal and we calculate the exact mean time $τ^g$ to first reach the central node $i_0$. 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 $i_0$. By means of analytic techniques based on decimation procedures, we find the explicit expression for $τ^g$ as a function of the generation $g$ and of the volume $V$ 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. | |
| dc.description | 6 pages | |
| dc.identifier | https://arxiv.org/abs/0802.2248 | |
| dc.identifier | http://arxiv.org/abs/0802.2248 | |
| dc.identifier | Phys. Rev. E 77, 011128 (2008) | |
| dc.identifier | doi:10.1103/PhysRevE.77.011128 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/154951 | |
| dc.subject | Data Analysis, Statistics and Probability | |
| dc.title | Exact mean first-passage time on the T-graph | |
| dc.type | text |