SciPost Physics

SciPost Phys. 11, 088 (2021) · published 4 November 2021

• doi: 10.21468/SciPostPhys.11.5.088
• pdf
• BiBTeX
• RIS
• Submissions/Reports
• 

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=\langle H\rangle +\delta H$, with $\langle H\rangle$ 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.

• Förster et al., Exact and approximate mean first passage times on trees and other necklace structures: a local equilibrium approach
  J. Phys. A: Math. Theor. 55, 115001 (2022) [Crossref]
• Bartolucci et al., Ranking influential nodes in networks from aggregate local information
  Phys. Rev. Research 5, 033123 (2023) [Crossref]
• Zaman et al., Study of mean-first-passage time and Kemeny’s constant of a random walk by normalized Laplacian matrices of a penta-chain network
  Eur. Phys. J. Plus 138, 770 (2023) [Crossref]
• Tishby et al., Analytical results for the distribution of first-passage times of random walks on random regular graphs
  J. Stat. Mech. 2022, 113403 (2022) [Crossref]
• Klishin et al., Exposure theory for learning complex networks with random walks
  10, cnac029 (2022) [Crossref]