Access time of an adaptive random walk on the world-wide Web

Details Access time of an adaptive random walk on the world-wide Web Access time of an adaptive random walk on the world-wide Web

2001-04-02

arxiv.org/abs/cond-mat/0104029v1

Physics

Condensed Matter

Statistical Mechanics

Revtex, 2 PostScript figures

Scientific paper

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 $\Delta q$ as a power $ \sim (\Delta q)^{-\theta}$. 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.

Affiliated with

Also associated with

No associations

Rating

Access time of an adaptive random walk on the world-wide Web does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Access time of an adaptive random walk on the world-wide Web, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Access time of an adaptive random walk on the world-wide Web will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-14956