Random Alpha PageRank

Internet Mathematics

Volumn 6, Issue 2, 2009, Pages 189-236

  Constantine, Paul G ^a   Gleich, David F ^a  

^a SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 81555211507     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2009.10129185     Document Type: Article

References (65)

1. Reid Andersen, Fan Chung, and Kevin Lang. “Local Graph Partitioning Using PageRank Vectors.” In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 475–486. Washington, DC: IEEE Computer Society, 2006.
2. A. Arasu, J. Novak, A. Tomkins, and J. Tomlin. “PageRank Computation and the Structure of the Web: Experiments and Algorithms.” In Poster Proceedings of the 11th International Conference on the World Wide Web. Available at http://www2002.org/CDROM/poster/173.pdf, 2002.
3. Søren Asmussen and Peter W. Glynn. Stochastic Simulation: Algorithms and Analysis. New York: Springer, 2007.
4. Konstantin Avrachenkov, Nelly Litvak, and Kim Son Pham. “Distribution of PageRank Mass among Principle [sic] Components of the Web.” In Algorithms and Models for the Web-Graph: 5th International Workshop, WAW 2007, San Diego, CA, USA, December 11–12, 2007, Proceedings, Lecture Notes in Computer Science 4863, edited by Anthony Bonato and Fan Chung Graham, pp. 16–28. New York: Springer, 2007.
5. Ricardo Baeza-Yates, Paolo Boldi, and Carlos Castillo. “Generalizing PageRank: Damping Functions for Link-Based Ranking Algorithms.” In Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 308–315. New York: ACM Press, 2006.
6. Luca Becchetti, Carlos Castillo, Debora Donato, Ricardo Baeza-Yates, and Stefano Leonardi. “Link Analysis for Web Spam Detection.” ACM Trans. Web 2:1 (2008), 1–42.
7. Pavel Berkhin, Usama M. Fayyad, Pabhakar Raghavan, and Andrew Tomkins. “User-Sensitive PageRank.” United States Patent Application 20080010281, 2008.
8. Paolo Boldi. “TotalRank: Ranking without Damping.” In Special Interest Tracks and Posters of the 14th International Conference on World Wide Web, pp. 898–899. New York: ACM Press, 2005.
9. Paolo Boldi and Sebastiano Vigna. “TheWebgraph Framework I: Compression Techniques.” In Proceedings of the 13th International Conference on the World Wide Web, pp. 595–602. New York: ACM Press, 2004.
10. Paolo Boldi and Sebastiano Vigna. “Codes for the World Wide Web.” Internet Mathematics 2:4 (2005), 407–429.
11. Paolo Boldi, Bruno Codenotti, Massimo Santini, and Sebastiano Vigna. “UbiCrawler: A Scalable Fully Distributed Web Crawler.” Software: Practice & Experience 34 (2004), 711–726.
12. Paolo Boldi, Massimo Santini, and Sebastiano Vigna. “PageRank as a Function of the Damping Factor.” In Proceedings of the 14th International Conference on the World Wide Web. New York: ACM Press, 2005.
13. Paolo Boldi, Roberto Posenato, Massimo Santini, and Sebastiano Vigna. “Traps and Pitfalls of Topic-Biased PageRank.” In Algorithms and Models for the Web-Graph: Fourth International Workshop, WAW 2006, Banff, Canada, November 30–December 1, 2006. Revised Papers, Lecture Notes in Computer Science 4936, pp. 107–116. New York: Springer, 2007.
14. Paolo Boldi, Massimo Santini, and Sebastiano Vigna. “PageRank: Functional Dependencies.” ACM Trans. Inf. Syst. 27:4 (2009), 1–23.
15. Carlos Castillo, Debora Donato, Luca Becchetti, Paolo Boldi, Stefano Leonardi, Massimo Santini, and Sebastiano Vigna. “A Reference Collection for Web Spam.” SIGIR Forum 40:2 (2006), 11–24.
16. Lara D. Catledge and James E. Pitkow. “Characterizing Browsing Strategies in the World-Wide Web.” Computer Networks and ISDN Systems 27:6 (1995), 1065–1073.
17. Tony F. Chan, Gene H. Golub, and Randall J. LeVeque. “Algorithms for Computing the Sample Variance: Analysis and Recommendations.” The American Statistician 37:3 (1983), 242–247.
18. P. Chen, H. Xie, S. Maslov, and S. Redner. “Finding Scientific Gems with Google’s PageRank Algorithm.” Journal of Informetrics 1:1 (2007), 8–15.
19. M. Christie, S. Subbey, and M. Sambridge. “Prediction under Uncertainty in Reservoir Modeling.” Journal of Petroleum Science and Engineering 44:1–2 (2004), 143–153.
20. Paul G. Constantine and David F. Gleich. “Using Polynomial Chaos to Compute the Influence of Multiple Random Surfers in the PageRank Model.” In Algorithms and Models for the Web-Graph: 5th International Workshop, WAW 2007, San Diego, CA, USA, December 11–12, 2007, Proceedings, Lecture Notes in Computer Science 4863, edited by Anthony Bonato and Fan Chung Graham, pp. 82–95. New York: Springer, 2007.
21. Paul G. Constantine, David F. Gleich, and Gianluca Iaccarino. “Spectral Methods for Parameterized Matrix Equations.” SIAM Journal on Matrix Analysis and Applications, to appear.
22. Cuil. “Cuil FAQs (Item 10).” Available at http://www.cuil.com/info/faqs/, 2009.
23. P. J. Davis and P. Rabinowitz. Methods of Numerical Integration. New York: Academic Press, 1984.
24. Gianna M. Del Corso, Antonio Gull´i, and Francesco Romani. “Fast PageRank Computation via a Sparse Linear System.” Internet Mathematics 2:3 (2005), 251–273.
25. Nadav Eiron, Kevin S. McCurley, and John A. Tomlin. “Ranking the Web Frontier.” In Proceedings of the 13th International Conference on the World Wide Web, pp. 309–318. New York: ACM Press, 2004.
26. Ayman Farahat, Thomas LoFaro, Joel C. Miller, Gregory Rae, and Lesley A.Ward. “Authority Rankings from HITS, PageRank, and SALSA: Existence, Uniqueness, and Effect of Initialization.” SIAM Journal on Scientific Computing 27:4 (2006), 1181–1201.
27. Valerio Freschi. “Protein Function Prediction from Interaction Networks Using a Random Walk Ranking Algorithm.” In Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, pp. 42–48. Los Alamitos, CA: IEEE Press, 2007.
28. Walter Gautschi. “OPQ: A Matlab Suite of Programs for Generating Orthogonal Polynomials and Related Quadrature Rules.” Available at http://www.cs.purdue.edu/archives/2002/wxg/codes/OPQ.html, 2002.
29. Orthogonal Polynomials: Computation and Approximation. Oxford: Oxford University Press, 2004.
30. R. G. Ghanem and J. Red-Horse. “Propagation of Uncertainty in Complex Physical Systems Using a Stochastic Finite Elements Approach.” Physica D 133 (1999), 137–144.
31. Andreas Glaser, Xiangtao Liu, and Vladimir Rokhlin. “A Fast Algorithm for the Calculation of the Roots of Special Functions.” SIAM Journal on Scientific Computing 29:4 (2007), 1420–1438.
32. David F. Gleich, Paul G. Constantine, Abraham Flaxman, and Asela Gunawardana. “Tracking the Random Surfer: Empirically Measured Teleportation Parameters in PageRank.” In Proceedings of the 19th International Conference on World Wide Web, pp. 381–390. New York: ACM Press, 2010.
33. David F. Gleich, Andrew P. Gray, Chen Greif, and Tracy Lau. “An Inner–Outer Iteration for PageRank.” SIAM Journal of Scientific Computing 32:1 (2010), 349–371.
34. Gene H. Golub and Chen Greif. “An Arnoldi-Type Algorithm for Computing PageRank.” BIT Numerical Mathematics 46:4 (2006), 759–771.
35. Gene H. Golub and John H. Welsch. “Calculation of Gauss Quadrature Rules.” Mathematics of Computation 23:106 (1969), 221–230.
36. Zoltán Gyöngyi, Hector Garcia-Molina, and Jan Pedersen. “Combating Web Spam with TrustRank.” In Proceedings of the 30th International Conference on Very Large Databases, pp. 576–587. Toronto: VLDB Endowment, 2004.
37. Roger A. Horn and Stefano Serra-Capizzano. “A General Setting for the Parametric Google Matrix.” Internet Mathematics 3:4 (2007), 385–411.
38. Bernardo A. Huberman, Peter L. T. Pirolli, James E. Pitkow, and Rajan M. Lukose. “Strong Regularities in World Wide Web Surfing.” Science 280:5360 (1998), 95–97.
39. Ilse C. F. Ipsen and Teresa M. Selee. “PageRank Computation, with Special Attention to Dangling Nodes.” SIAM Journal on Matrix Analysis and Applications 29:4 (2007), 1281–1296.
40. S. D. Kamvar, T. H. Haveliwala, C. D. Manning, and G. H. Golub. “Extrapolation Methods for Accelerating PageRank Computations.” In Proceedings of the 12th International Conference on the World Wide Web, pp. 261–270. New York: ACM Press, 2003.
41. Chinmay Karande, Kumar Chellapilla, and Reid Andersen. “Speeding Up Algorithms on Compressed Web Graphs.” In WSDM’09: Proceedings of the Second ACM International Conference on Web Search and Data Mining, pp. 272–281. New York: ACM Press, 2009.
42. Leo Katz. “A New Status Index Derived from Sociometric Analysis.” Psychometrika 18:1 (1953), 39–43.
43. Google’s PageRank and Beyond: The Science of Search Engine Rankings. Princeton: Princeton University Press, 2006.
44. Chris P. Lee, Gene H. Golub, and Stefanos A. Zenios. “A Two-Stage Algorithm for Computing PageRank and Multistage Generalizations.” Internet Mathematics 4:4 (2007), 299–327.
45. Yiqin Lin, Xinghua Shi, and Yimin Wei.” “On Computing PageRank via Lumping the Google Matrix.” Journal of Computational and Applied Mathematics 224:2 (2009), 702–708.
46. Yuting Liu, Bin Gao, Tie-Yan Liu, Ying Zhang, Zhiming Ma, Shuyuan He, and Hang Li. “BrowseRank: Letting Web Users Vote for Page Importance.” In SIGIR’08: Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 451–458. New York: ACM Press, 2008.
47. Lionel Mathelin, M. Yousuff Hussaini, and Thomas A. Zang. “Stochastic Approaches to Uncertainty Quantifcation in CFD Simulations.” Numer. Algorithms 38 (2005), 209–236.
48. Carl D. Meyer. Matrix Analysis and Applied Linear Algebra. Philadelphia: SIAM, 2000.
49. Cleve B. Moler. Numerical Computing with Matlab. Philadelphia: SIAM, 2004.
50. Julie L. Morrison, Rainer Breitling, Desmond J. Higham, and David R. Gilbert. “GeneRank: Using Search Engine Technology for the Analysis of Microarray Experiments.” BMC Bioinformatics 6:1 (2005), 233.
51. Marc A. Najork, Hugo Zaragoza, and Michael J. Taylor. “HITS on the Web: How Does It Compare?” In Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 471–478. New York: ACM Press, 2007.
52. Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. “The PageRank Citation Ranking: Bringing Order to the Web.” Techinical report, Stanford University, 1999.
53. Stefano Serra-Capizzano. “Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation.” SIAM Journal on Matrix Analysis and Applications 27:2 (2005), 305–312.
54. Rohit Singh, Jinbo Xu, and Bonnie Berger. “Pairwise Global Alignment of Protein Interaction Networks by Matching Neighborhood Topology.” In Research in Computational Molecular Biology: 11th Annual International Conference, RECOMB 2007, Oakland, CA, USA, April 21–25, 2007, Proceedings, Lecture Notes in Computer Science 4453, pp. 16–31. New York: Springer, 2007.
55. Mike Thelwall. “A Free Database of University Web Links: Data Collection Issues.” International Journal of Scientometrics, Informetrics and Bibliometrics 6/7:1 (2003), paper 2.
56. Lloyd N. Trefethen. “Is Gauss Quadrature Better Than Clenshaw–Curtis?” SIAM Review 50:1 (2008), 67–87.
57. L. N. Trefethen, N. Hale, R. B. Platte, T. A. Driscoll, and R. Pachón. “Chebfun Version 3.” Available at http://www.maths.ox.ac.uk/chebfun/, 2009.
58. Various. “Wikipedia XML Database Dump from April 2, 2007.” Accessed from http://en.wikipedia.org/wiki/Wikipedia:Database download, 2008.
59. Minhua Wang. “A Significant Improvement to Clever Algorithm in Hyperlinked Environment.” In Paper Proceedings of the 11th International Conference on World Wide Web. Available at http://www2002.org/CDROM/poster/171.pdf, 2002.
60. Ryan W. White and Steven M. Drucker. “Investigating Behavioral Variability in Web Search.” In Proceedings of the 16th International Conference on World Wide Web, pp. 21–30. New York: ACM Press, 2007.
61. Ian H.Witten and Eibe Frank. Data Mining: Practical Machine Learning Tools and Techniques. San Francisco: Morgan Kaufmann, 2005.
62. Gui-Rong Xue, Hua-Jun Zeng, Zheng Chen, Wei-Ying Ma, Hong Jiang Zhang, and Chao-Jun Lu. “User Access Pattern Enhanced Small Web Search.” Poster presented at the 12th International Conference on World Wide Web, Budapest, Hungary, May 20–24, 2003.
63. Hui Zhang, Ashish Goel, Ramesh Govindan, Kahn Mason, and Benjamin Van Roy. “Making Eigenvector-Based Reputation Systems Robust to Collusion.” In Algorithms and Models for the Web-Graph: Third International Workshop, WAW 2004, Rome, Italy, October 16, 2004, Proceeedings, Lecture Notes in Computer Science 3243, pp. 92–104. New York: Springer, 2004.
64. Dengyong Zhou, Jiayuan Huang, and Bernhard Schölkopf. “Learning from Labeled and Unlabeled Data on a Directed Graph.” In ICML’05: Proceedings of the 22nd International Conference on Machine Learning, pp. 1036–1043. New York: ACM Press, 2005.
65. Daniel Zwillinger, Steven G. Krantz, and Kenneth H. Rosen, editors. Standard Mathematical Tables and Formulae. Boca Raton, FL: CRC Press, 1996.