"Spectrally gapped" random walks on networks: a Mean First Passage Time formula
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....
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
SciPost
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/38d508ff284d4a79a3b1c6b3f62a6b31 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | 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. |
|---|