"Spectrally gapped" random walks on networks: a Mean First Passage Time formula

Abstract

We derive an approximate but explicit formula for the Mean First Passage Time of a random walker between a source and a target node of a directed and weighted network. The formula does not require any matrix inversion, and it takes as only input the transition probabilities into the target node. It is derived from the calculation of the average resolvent of a deformed ensemble of random sub-stochastic matrices $H=⟨H⟩+\delta H$, with $⟨H⟩$ rank-$1$ and non-negative. The accuracy of the formula depends on the spectral gap of the reduced transition matrix, and it is tested numerically on several instances of (weighted) networks away from the high sparsity regime, with an excellent agreement.

20 pages, 4 figures. Clarifications and appendices added

References in corpus (13)

• First-passage times in complex scale-invariant media
• Scaling theory of transport in complex networks
• Random walks and search in time-varying networks
• Exact mean first-passage time on the T-graph
• Random walks on weighted networks
• Exploring Complex Networks through Random Walks
• On the localization transition in symmetric random matrices
• Random walks on complex trees
• Scale Free Networks from Self-Organisation
• Trapping in complex networks
• Ring structures and mean first passage time in networks
• Return times of random walk on generalized random graphs
• Origin of the hub spectral dimension in scale-free networks