Crawling on web graphs
- 19 May 2002
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 419-427
- https://doi.org/10.1145/509907.509970
Abstract
We consider a simple model of an agent (which we call a spider) moving between the nodes of a randomly growing web graph. It is presumed that the agent examines the page content of the node for some specific topic. In our model the spider makes a random walk on the existing set of vertices. We compare the success of the spider on web graphs of two distinct types. For a random graph web graph model, in which new vertices join edges to existing vertices uniformly at random, the expected...Keywords
This publication has 3 references indexed in Scilit:
- Measuring index quality using random walks on the WebComputer Networks, 1999
- Approximate counting, uniform generation and rapidly mixing Markov chainsInformation and Computation, 1989
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963