Access time of an adaptive random walk on the world-wide Web
Tadic, Bosiljka
Original · EN
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 <taw> (Δ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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.