"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.

arXiv comment20 pages, 4 figures. Clarifications and appendices added

References in corpus (33)

• Random walks and diffusion on networks
• First-passage times in complex scale-invariant media
• Scaling theory of transport in complex networks
• Random walks on graphs: ideas, techniques and results
• Random walks and search in time-varying networks
• Global mean first-passage times of random walks on complex networks
• Biased random walks on complex networks: the role of local navigation rules
• First passage time for random walks in heterogeneous networks
• Exploring complex networks by walking on them
• Exact mean first-passage time on the T-graph
• Random walks on weighted networks
• First Passage Properties of the Erdos-Renyi Random Graph
• Exploring Complex Networks through Random Walks
• Random Walks on deterministic Scale-Free networks: Exact results
• Mean-field diffusive dynamics on weighted networks
• On the localization transition in symmetric random matrices
• Random walks in weighted networks with a perfect trap: An application of Laplacian spectra
• Random walks on complex trees
• Rotational invariant estimator for general noisy matrices
• Scale Free Networks from Self-Organisation
• Explicit determination of mean first-passage time for random walks on deterministic uniform recursive trees
• Trapping in complex networks
• Asymptotic analysis of first passage time in complex networks
• Ring structures and mean first passage time in networks
• Return times of random walk on generalized random graphs
• Scale-free networks as an epiphenomenon of memory
• Correlation Functions, Mean First Passage Times and the Kemeny Constant
• A fast and stable test to check if a weakly diagonally dominant matrix is a nonsingular M-matrix
• Origin of the hub spectral dimension in scale-free networks
• Return probabilities and hitting times of random walks on sparse Erdos-Renyi graphs
• Second largest Eigenpair Statistics for Sparse Graphs
• Breakdown of random matrix universality in Markov models
• The distribution of first hitting times of random walks on directed Erdős-Rényi networks