Random Walk with Memory on Complex Networks
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2019
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909386850435072 |
|---|---|
| author | Basnarkov, Lasko Mirchev, Miroslav Kocarev, Ljupco |
| author_facet | Basnarkov, Lasko Mirchev, Miroslav Kocarev, Ljupco |
| contents | We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs of nodes, for a random walk with a memory of one step. We have analyzed one particular model of random walk, where the transition probabilities depend on the number of paths to the second neighbors. The numerical experiments on paradigmatic complex networks verify the validity of the theoretical expressions, and also indicate that the flattening of the stationary occupation probability accompanies a nearly optimal random search. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1907_08222 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | Random Walk with Memory on Complex Networks Basnarkov, Lasko Mirchev, Miroslav Kocarev, Ljupco Physics and Society Statistical Mechanics Social and Information Networks We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs of nodes, for a random walk with a memory of one step. We have analyzed one particular model of random walk, where the transition probabilities depend on the number of paths to the second neighbors. The numerical experiments on paradigmatic complex networks verify the validity of the theoretical expressions, and also indicate that the flattening of the stationary occupation probability accompanies a nearly optimal random search. |
| title | Random Walk with Memory on Complex Networks |
| topic | Physics and Society Statistical Mechanics Social and Information Networks |
| url | https://arxiv.org/abs/1907.08222 |