Mean first-passage time for random walks on the T-graph

Abstract

For random walks on networks (graphs), it is a theoretical challenge to explicitly determine the mean first-passage time (MFPT) between two nodes averaged over all pairs. In this paper, we study the MFPT of random walks in the famous T-graph, linking this important quantity to the resistance distance in electronic networks. We obtain an exact formula for the MFPT that is confirmed by extensive numerical calculations. The interesting quantity is derived through the recurrence relations resulting from the self-similar structure of the T-graph. The obtained closed-form expression exhibits that the MFPT approximately increases as a power-law function of the number of nodes, with the exponent lying between 1 and 2. Our research may shed light on the deeper understanding of random walks on the T-graph.

Definitive version accepted for publication in New Journal of Physics

References in corpus (7)

• Exact mean first-passage time on the T-graph
• Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation
• Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
• Exact solution of mean geodesic distance for Vicsek fractals
• Trapping in complex networks
• Fractal scale-free networks resistant to disease spread
• Transition from fractal to non-fractal scalings in growing scale-free networks