"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....
Saved in:
| Main Author: | |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
SciPost
2021
|
| Subjects: | |
| Online Access: | https://doaj.org/article/38d508ff284d4a79a3b1c6b3f62a6b31 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|