Access time of an adaptive random walk on the world-wide Web
| dc.creator | Tadic, Bosiljka | |
| dc.date | 2001-04-02 | |
| dc.date.accessioned | 2026-07-07T02:40:57Z | |
| dc.date.available | 2026-07-07T02:40:57Z | |
| dc.description | We introduce and simulate the random walk that adapts move strategies according to local node preferences on a directed graph. We consider graphs with double-hierarchical connectivity and variable wiring diagram in the universality class of the world-wide Web. The ensemble of walkers reveals the structure of local subgraphs with dominant promoters and attractors of links. The average access time decays with the distance in hierarchy $Δq$ as a power $<t_{aw}> \sim (Δq)^{-θ}$. The access to highly connected nodes is orders of magnitude shorter compared to the standard random walk, suggesting the adaptive walk as an efficient message-passing algorithm on this class of graphs. | |
| dc.description | Revtex, 2 PostScript figures | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0104029 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0104029 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/17561 | |
| dc.subject | Statistical Mechanics | |
| dc.title | Access time of an adaptive random walk on the world-wide Web | |
| dc.type | text |