R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. Stochastic models for the Web graph. Proc. 41st IEEE Symposium on Foundations of Computer Science, pp. 57--65, 2000.  Home/Search   Document Not in Database   Summary   Related Articles

....randomly added to the web graph to test how well we do in other situations. In each case, our results were similarly accurate while the costs of our updates were again very low. Our second set of experiments are conducted with random graphs that are designed to possess properties of the web graph [9]. Our goal in experimenting with synthetic graphs is to obtain a finer understanding of the robustness of our algorithms to various edge update scenarios. Specifically, we are interested in making a large number of edge additions (5 to 10 of the total number of edges) Here we observe that our ....

....of our experiments on random graphs designed to model the behavior of the web graph, and experiments where we made synthetic changes to a large graph carved out from a crawl of the Web. Specifically, for generating synthetic graphs, we use variants of the stochastic model proposed and studied by [9]. Before we present the model, we ll say a few words about why these experiments are interesting. With synthetic graphs and or synthetic changes, we have an opportunity to study variations in the parameters of interest. Specifically, we wish to obtain insights into the behavior of our ....

[Article contains additional citation context not shown here]

R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. Stochastic models for the Web graph. Proc. 41st IEEE Symposium on Foundations of Computer Science, pp. 57--65, 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC