Link evolution: Analysis and algorithms

Internet Mathematics

Volumn 1, Issue 3, 2004, Pages 277-304

  Chien, Steve ^a   Dwork, Cynthia ^b   Kumar, Ravi ^c   Simon, Daniel R ^b   Sivakumar, D ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MICROSOFT RESEARCH   (United States)

^c IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84906214435     PISSN: 15427951     EISSN: 19449488     Source Type: Journal    
DOI: 10.1080/15427951.2004.10129090     Document Type: Article

References (19)

1. [Berman and Plemmons 94] A. Berman and R. J. Plemmons. Nonnegative Matrices in the Mathematical Sciences. Philadelphia: SIAM, 1994
2. [Brin and Page 98] S. Brin and L. Page. "The Anatomy of a Large-Scale Hypertextual (Web) Search Engine". Computer Networks 30:1-7 (1998) 107-117.
3. [Broder et al. 00] A. Broder, F. Maghoul, R. Kumar, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. "Graph Structure in the Web". Computer Networks 33:1-6 (2000), 309-320.
4. [Cho and Meyer 01] G. Cho and C. D. Meyer. "Comparison of Perturbation Bounds for the Stationary Distribution of a Markov Chain". Linear Algebra and Its Applications 335:1-3 (2001), 137-150.
5. [Cho and Meyer 00] G. Cho and C. D. Meyer. "Markov Chain Sensitivity Measured by Mean First Passage Times". Linear Algebra and Its Applications 316 (2000), 21-28.
6. [Dill et al. 02] S. Dill, R. Kumar, K. McCurley, S. Rajagopalan, D. Sivakumar, and A. Tomkins. "Self-Similarity in the Web". ACM Trans. Internet Techn. 2:3 (2002), 205-223.
7. [Heydon and Najork 99] A. Heydon and M. Najork. "Mercator: A Scalable, Extensible Web Crawler". World Wide Web 2:4 (1999), 219-229.
8. [Ipsen and Meyer 94] I. Ipsen and C. Meyer. "Uniform Stability of Markov Chains". SIAM Journal on Matrix Analysis and Applications 15:4 (1994), 1061-1074.
9. [Kemeny and Snell 60] J. Kemeny and J. L. Snell. Finite Markov Chains, New York: D. Van Nostrand Company, Inc., 1960.
10. [Kleinberg 99] J. Kleinberg. "Authoritative Source in a Hyperlinked Environment". J. ACM 46:5 (1999), 604-632.
11. [Kumar et al. 00] R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. "Stochastic Models for the Web Graph". In Proc. 41st IEEE Symposium on Foundations of Computer Science, pp. 57-65. Los Alamitos, CA: IEEE Computer Society, 2000.
12. [Langville and Meyer 02] A. N. Langville and C. D. Meyer. "Updating PageRank Using the Group Inverse and Stochastic Complementation". Technical Report, NCSU CRSC #CRSC-TR02-32, 2002.
13. [McCallum et al. 00] A. McCallum, K. Nigam, J. Rennie, and K. Seymore. "Automating the Construction of Internet Portals with Machine Learning". Information Retrieval Journal 3 (2000), 127-163.
14. [Meyer 75] C. D. Meyer, Jr. "The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains". SIAM Review 17:3 (1975), 443-464.
15. [Ng et al. 01a] A. Y. Ng, A. X. Zheng, and M. I. Jordan. "Stable Algorithms for Link Analysis". In Proc. 24th International Conference on Research and Development in Information Retrieval (SIGIR), pp. 258-266. New York: ACM Press, 2001.
16. [Ng et al. 01b] A. Y. Ng, A. X. Zheng, and M. I. Jordan. "Link Analysis, Eigenvectors, and Stability". In Proc. 17th International Joint Conference on Artificial Intelligence (IJCAI), pp. 903-910. San Francisco, CA: Morgan Kaufmann, 2001.
17. [Randall et al. 01] K. H. Randall, R. Stata, R. G. Wickremesinghe, and J. L. Wiener. "The Link Database: Fast Access to Graphs of the Web". Research Report 175, Compaq Systems Research Center, Palo Alto, CA, 2001.
18. [Schweitzer 68] P. J. Schweitzer. "Perturbation Theory and Finite Markov Chains". Journal of Applied Probability 5:3 (1968), 401-404.
19. [Stewart 94] W. J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton, NJ: Princeton University Press, 1994.