Random walks on deterministic scale-free networks: Exact results

We study the random walk problem on a class of deterministic scale-free networks displaying a degree sequence for hubs scaling as a power law with an exponent _ =log 3/ log 2. We find exact results concerning different first-passage phenomena and, in particular, we calculate the probability of first return to the main hub. These results allow to derive the exact analytic expression for the mean time to first reach the main hub, whose leading behavior is given by __V1−1/_, where V denotes the size of the structure, and the mean is over a set of starting points distributed uniformly over all the other sites of the graph. Interestingly, the process turns out to be particularly efficient. We also discuss the thermodynamic limit of the structure and some local topological properties.