Bibliography

[1] Gnutella website. http://www.gnutella.com.

[2] Karl Aberer and Zoran Despotovic. Managing trust in a peer-to-peer information system. In Proceedings of the 10th International Conference on Information and Knowledge Management (ACM CIKM), 2001.

[3] Advogato’s Trust Metric (White Paper). http://www.advogato.org/trust-metric.html.

[4] A. C. Aitken. On Bernoulli’s numerical solution of algebraic equations. Proc. Roy. Soc. Edinburgh, 46:289-305, 1926.

[5] Amazon website. www.amazon.com.

[6] Amy Langville and Carl Meyer. Google’s PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, 2006.

[7] Arvind Arasu, Jasmine Novak, Andrew Tomkins, and John Tomlin. PageRank computation and the structure of the Web: Experiments and algorithms. In Proceedings of the Eleventh International World Wide Web Conference, Poster Track, 2002.

[8] Tuomas Aura, Pekka Nikander, and Jussipekka Leiwo. DoS-resistant authentication with client puzzles. In Eighth International Workshop on Security Protocols, 2000.

[9] T. Beth, M. Borcherding, and B. Klein. Valuation of trust in open networks. In Proceedings of the Third European Symposium on Research in Computer Security — ESORICS ’94, 1994.

[10] Patrick Vinograd Beverly Yang and Hector Garcia-Molina. Evaluating GUESS and non-forwarding peer-to-peer search. In ICDCS, 2004.

[11] Krishna Bharat, Bay-Wei Chang, Monika Henzinger, and Matthias Ruhl. Who links to whom: Mining linkage between Web sites. In Proceedings of the IEEE International Conference on Data Mining, November 2001.

[12] Krishna Bharat and Monika R. Henzinger. Improved algorithms for topic distillation in a hyperlinked environment. In Proceedings of the ACM-SIGIR, 1998.

[13] Andrei Broder, Ravi Kumar, Farzin Maghoul, Prabhakar Raghavan, Sridhar Rajagopalan, Raymie Stata, Andrew Tomkins, and Janet Wiener. Graph structure in the Web. In Proceedings of the Ninth International World Wide Web Conference, 2000.

[14] Captcha Project. http://www.captcha.net.

[15] Soumen Chakrabarti, Byron Dom, David Gibson, Jon Kleinberg, Prabhakar Raghavan, and Sridhar Rajagopalan. Automatic resource compilation by analyzing hyperlink structure and associated text. In Proceedings of the Seventh International World Wide Web Conference, 1998.

[16] Soumen Chakrabarti, Mukul M. Joshi, Kunal Punera, and David M. Pennock. The structure of broad topics on the Web. In Proceedings of the Eleventh International World Wide Web Conference, 2002.

[17] Soumen Chakrabarti, Martin van den Berg, and Byron Dom. Focused crawling: A new approach to topic-specific Web resource discovery. In Proceedings of the Eighth International World Wide Web Conference, 1999.

[18] Junghoo Cho and Hector Garcia-Molina. Parallel crawlers. In Proceedings of the Eleventh International World Wide Web Conference, 2002.

[19] Brian F. Cooper and Hector Garcia-Molina. Ad hoc, self-supervising peer-to- peer search networks. Stanford University Technical Report, 2003.

[20] Fabrizio Cornelli, Ernesto Damiani, Sabrina De Capitani Di Vimercati, Stefano Paraboschi, and Pierangda Samarati. Choosing reputable servents in a P2P network. In Proceedings of the 11th World Wide Web Conference, 2002.

[21] Arturo Crespo and Hector Garcia-Molina. Semantic overlay networks for P2P systems. Stanford University Technical Report, 2002.

[22] Arturo Crespo and Hector Garcia-Molina. Routing indices for P2P systems. In Proceedings of the 28th Conference on Distributed Computing Systems, July 2002.

[23] Neil Daswani and Hector Garcia-Molina. Query-flood DoS attacks in Gnutella. In ACM CCS, 2002.

[24] John R. Douceur. The Sybil attack. In First IPTPS, March 2002.

[25] eBay website. www.ebay.com.

[26] Wolfgang Nejdl et al. EDUTELLA: A P2P networking infrastructure based on RDF. In Proceedings of the Eleventh World Wide Web Conference, May 2002.

[27] Ronald Fagin, Ravi Kumar, and D. Sivakumar. Comparing top k lists. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2003.

[28] Michael J. Freedman and Radek Vingralek. Efficient P2P lookup for a distributed trie. In First International Workshop on P2P Systems, 2002.

[29] Gene H. Golub and Chen Greif. An Arnoldi-type algorithm for computing PageRank. BIT Numerical Mathematics, 46(4):759-771, 2006.

[30] Gene H. Golub and Charles F. Van Loan. Matrix Computations. Johns Hopkins University Press, 1996.

[31] Geoffrey R. Grimmett and David R. Stirzaker. Probability and Random Processes. Oxford University Press, 1989.

[32] Ramanathan Guha, Ravi Kumar, Prabhakar Raghavan, and Andrew Tomkins. Propagation of trust and distrust. In Proceedings of the Thirteenth International World Wide Web Conference, 2004.

[33] Taher H. Haveliwala. Efficient computation of PageRank. Stanford University Technical Report, 1999.

[34] Taher H. Haveliwala. Topic-sensitive PageRank. In Proceedings of the Eleventh International World Wide Web Conference, 2002.

[35] Taher H. Haveliwala and Sepandar D. Kamvar. The second eigenvalue of the Google matrix. Stanford University Technical Report, 2003.

[36] Jun Hirai, Siran Raghavan, Hector Garcia-Molina, and Andreas Paepcke. WebBase: A repository of web pages. In Proceedings of the Ninth International World Wide Web Conference, 2000.

[37] Marius Iosifescu. Finite Markov Processes and Their Applications. John Wiley, 1980.

[38] Dean L. Isaacson and Richard W. Madsen. Markov Chains: Theory and Applications, chapter IV, pages 126-127. John Wiley, 1976.

[39] Glen Jeh and Jennifer Widom. Scaling personalized web search. In Proceedings of the Twelfth International World Wide Web Conference, 2003.

[40] Sepandar D. Kamvar, Taher H. Haveliwala, Christopher D. Manning, and Gene H. Golub. Extrapolation methods for accelerating pagerank computations. In Proceedings of the Twelfth International World Wide Web Conference, 2003.

[41] Sepandar D. Kamvar, Mario T. Schlosser, and Hector Garcia-Molina. The EigenTrust algorithm for reputation management in P2P networks. In Proceedings of the Twelfth International World Wide Web Conference, 2003.

[42] Sepandar D. Kamvar, Mario T. Schlosser, and Hector Garcia-Molina. Incentives for combatting freeriding on p2p networks. In Euro-Par 2003, 2003.

[43] S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 220, 4598:671-680, 13 May 1983.

[44] J. Kleinberg, S. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. The Web as a graph: Measurements, models, and methods. In Proceedings of the International Conference on Combinatorics and Computing, 1999.

[45] Jon Kleinberg. Authoritative sources in a hyperlinked environment. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 1998.

[46] Robert R. Korfhage. Information Storage and Retrieval. John Wiley, 1997.

[47] Samuel Kotz and Norman L. Johnson. Encyclopedia of Statistical Sciences, chapter Kendall’s Tau, pages 367-369. John Wiley, 1993.

[48] Udo R. Krieger. Numerical solution of large finite Markov chains by algebraic multigrid techniques. In Proceedings of the 2nd International Workshop on the Numerical Solution of Markov Chains, 1995.

[49] Amy Langville and Carl Meyer. Deeper inside PageRank. Internet Mathematics, 2004.

[50] Qin Lv, Sylvia Ratsnasamy, and Scott Shenker. Can heterogeneity make Gnutella scalable? In First International Workshop on P2P Systems, 2002.

[51] D. F. McAllister, G. W. Stewart, and W. J. Stewart. On a Rayleigh-Ritz refinement technique for nearly uncoupled stochastic matrices. Linear Algebra and Its Applications, 60:1-25, 1984.

[52] Alberto Medina, Ibrahim Matta, and John Byers. On the origin of power laws in internet topologies. Technical report, Boston University Computer Science Department, April 2000.

[53] Marina Meila and Jianbo Shi. A random walks view of spectral segmentation. In AI and Statistics (AISTATS), 2001.

[54] Carl D. Meyer. Sensitivity of the stationary distribution of a Markov chain. SIAM Journal on Matrix Analysis and Applications, 15(3):715-728, 1994.

[55] Andrew Y. Ng, Alice X. Zheng, and Michael I. Jordan. Link analysis, eigenvectors and stability. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 903-910, 2001.

[56] Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. The PageRank citation ranking: Bringing order to the Web. Stanford Digital Libraries Working Paper, 1998.

[57] Pietro Perona and William T. Freeman. A factorization approach to grouping. In Proceedings EECV, 1998.

[58] Pierre-Jacques Courtois. Queueing and Computer System Applications. Academic Press, 1977.

[59] Davood Rafiei and Alberto O. Mendelzon. What is this page known for? Computing Web page reputations. In Proceedings of the Ninth International World Wide Web Conference, 2000.

[60] Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker. A scalable content-addressable network. In Proceedings of ACM SIGCOMM, 2001.

[61] Paul Resnick, Richard Zeckhauser, Eric Friedman, and Ko Kuwabara. Reputation systems. Communications of the ACM, 43(12):45-48, 2000.

[62] Matthew Richardson and Pedro Domingos. The intelligent surfer: Probabilistic combination of link and content information in PageRank. In Advances in Neural Information Processing Systems, volume 14. MIT Press, 2002.

[63] Matei Ripeanu and Ian Foster. Mapping the Gnutella network — macroscopic properties of large-scale P2P networks. IEEE Internet Computing Journal, 6(1), 2002.

[64] Stefan Saroiu, P. Krishna Gummadi, and Steven D. Gribble. A measurement study of peer-to-peer file sharing systems. In Proceedings of Multimedia Computing and Networking 2002 (MMCN ’02), 2002.

[65] Herbert A. Simon and Albert Ando. Aggregation of variables in dynamic systems. Econometrica, 29:111-138, 1961.

[66] Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, 2001.

[67] Qi Sun and Hector Garcia-Molina. SLIC: A selfish link-based incentive mechanism for unstructured peer-to-peer networks. In Proceedings of the 17th International Conference on Distributed Computing (DISC), 2003.

[68] Lloyd N. Trefethen and David Bau. Numerical Linear Algebra. SIAM, 1997.

[69] VBS.Gnutella Worm. http://securityresponse.symantec.com/avcenter/venc/ data/vbs.gnutella.html.

[70] Duncan J. Watts and Steven H. Strogatz. Collective dynamics of “small-world” networks. Nature, 393:440-442, 1998.

[71] Bryce Wilcox-O’Hearn. Experiences deploying a large-scale emergent network. In First International Workshop on P2P Systems, 2002.

[72] J. H. Wilkinson. The Algebraic Eigenvalue Problem. Oxford University Press, 1965.

[73] P. Wynn. On the convergence and stability of the epsilon algorithm. SIAM Journal of Numerical Analysis, 33:91-122, 1966.

[74] Beverly Yang and Hector Garcia-Molina. Improving efficiency of P2P search. In Proceedings of the 28th Conference on Distributed Computing Systems, July 2002.