Updating Markov chains with an eye on Google's PageRank

SIAM Journal on Matrix Analysis and Applications

Volumn 27, Issue 4, 2006, Pages 968-987

  Langville, Amy N ^a   Meyer, Carl D ^b  

^a Department of Teacher Education and Department of Sociology and Anthropology   (United States)

^b NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

Aggregation disaggregation; Google; Markov chains; PageRank; Stationary vector; Stochastic complementation; Updating

Indexed keywords

AGGREGATION/DISAGGREGATION; GOOGLE; PAGERANK; STATIONARY VECTORS; STOCHASTIC COMPLEMENTATION;

ALGORITHMS; ITERATIVE METHODS; NUMERICAL METHODS; PROBABILITY; PROBLEM SOLVING; SEARCH ENGINES;

MARKOV PROCESSES;

EID: 33750184660     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/040619028     Document Type: Conference Paper

References (38)

1. A.-L. BARABASI, Linked: The New Science of Networks, Plume, New York, 2003.
2. A.-L. BARABASI, R. ALBERT, AND H. JEONG, Scale-free characteristics of random networks: The topology of the World-Wide Web, Phys. A, 281 (2000), pp. 69-77.
3. S. BRIN AND L. PAGE, The anatomy of a large-scale hypertextual web search engine, Comput. Networks ISDN Systems, 33 (1998), pp. 107-117.
4. S. BRIN, L. PAGE, R. MOTWAMI, AND T. WINOGRAD, The PageRank Citation Ranking: Bringing Order to the Web, Technical report, Computer Science Department, Stanford University, Stanford, CA, 1998.
5. A. BRODER, R. KUMAR, F. MAGHOUL, P. RAGHAVAN, S. RAJAGOPALAN, R. STATA, A. TOMKINS, AND J. WIENER, Graph structure in the web, in Proceedings of the Ninth International World Wide Web Conference, 2000; available online at http://www9.org/w9cdrom/160/160.html.
6. S. CAMPBELL AND C. D. MEYER, Generalized Inverses of Linear Transformations, Pitman, San Francisco, 1979.
7. S. CHIEN, C. DWORK, R. KUMAR, AND D. SIVAKUMAR, Towards exploiting link evolution, in Proceedings of the Workshop on Algorithms and Models for the Web Graph, 2001.
8. G. E. CHO AND C. D. MEYER, Markov chain sensitivity measured by mean first passage times, Linear Algebra Appl., 313 (2000), pp. 21-28.
9. G. E. CHO AND C. D. MEYER, Comparison of perturbation bounds for the stationary distribution of a Markov chain, Linear Algebra Appl., 335 (2001), pp. 137-150.
10. D. DONATO, L. LAURA, S. LEONARDI, AND S. MILLOZZI, Large scale properties of the webgraph, Eur. Phys. J. B, 38 (2004), pp. 239-243.
11. R. E. FUNDERLIC AND C. D. MEYER, Sensitivity of the stationary distribution vector for an ergodic Markov chain, Linear Algebra Appl., 76 (1986), pp. 1-17.
12. R. E. FUNDERLIC AND R. J. PLEMMONS, Updating LU factorizations for computing stationary distributions, SIAM J. Alg. Disc. Meth., 7 (1986), pp. 30-42.
13. G. H. GOLUB AND C. F. V. LOAN, Matrix Computations, The Johns Hopkins University Press, Baltimore, 1996.
14. G. H. GOLUB AND C. D. MEYER, Using the QR factorization and group inversion to compute, differentiate, and estimate the sensitivity of stationary probabilities for Markov chains, SIAM J. Alg. Disc. Meth., 7 (1986), pp. 273-281.
15. R. A. HORN AND C. R. JOHNSON, Matrix Analysis, Cambridge University Press, Cambridge, UK, 1990.
16. J. J. HUNTER, Stationary distributions of perturbed Markov chains, Linear Algebra Appl., 82 (1986), pp. 201-214.
17. I. C. F. IPSEN AND S. KIRKLAND, Convergence analysis of an improved PageRank algorithm, Technical report CRSC-TR04-02, North Carolina State University, Raleigh, NC, 2004.
18. I. C. F. IPSEN AND C. D. MEYER, Uniform stability of Markov chains, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 1061-1074.
19. S. D. KAMVAR, T. H. HAVELIWALA, C. D. MANNING, AND G. H. GOLUB, Extrapolation methods for accelerating PageRank computations, in Proceedings of the Twelfth International World Wide Web Conference, 2003; available online at http://www2003.org/cdrom/index.html.
20. J. G. KEMENY AND L. J. SNELL, Finite Markov Chains, Van Nostrand, New York, 1960.
21. A. N. LANGVILLE AND C. D. MEYER, A survey of eigenvector methods for Web information retrieval, SIAM Rev., 47 (2005), pp. 135-161.
22. A. N. LANGVILLE AND C. D. MEYER, Google's PageRank and Beyond: The Science of Search Engine Rankings, Princeton University Press, Princeton, NJ, 2006.
23. C. D. MEYER JR., The role of the group generalized inverse in the theory of finite Markov chains, SIAM Rev., 17 (1975), pp. 443-464.
24. C. D. MEYER JR., The condition of a finite Markov chain and perturbation bounds for the limiting probabilities, SIAM J. Alg. Disc. Meth., 1 (1980), pp. 273-283.
25. C. D. MEYER, Analysis of finite Markov chains by group inversion techniques, in Recent Applications of Generalized Inverses, Res. Notes in Math. 66, S. L. Campbell, ed., Pitman, Boston, London, 1982, pp. 50-81.
26. C. D. MEYER, Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems, SIAM Rev., 31 (1989), pp. 240-272.
27. C. D. MEYER, The character of a finite Markov chain, in Linear Algebra, Markov Chains, and Queueing Models, IMA Vol. Math. Appl. 48, C. D. Meyer and R. J. Plemmons, eds., Springer-Verlag, New York, 1993, pp. 47-58.
28. C. D. MEYER, Sensitivity of the stationary distribution of a Markov chain, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 715-728.
29. C. D. MEYER, Matrix Analysis and Applied Linear Algebra, SIAM, Philadelphia, 2000.
30. C. D. MEYER AND R. J. PLEMMONS, Linear Algebra, Markov Chains, and Queueing Models, Springer-Verlag, New York, 1993.
31. C. D. MEYER AND J. M. SHOAF, Updating finite Markov chains by using techniques of group matrix inversion, J. Statist. Comput. Simulation, 11 (1980), pp. 163-181.
32. C. D. MEYER AND G. W. STEWART, Derivatives and perturbations of eigenvectors, SIAM J. Numer. Anal., 25 (1988), pp. 679-691.
33. C. MOLER, The world's largest matrix computation, MATLAB News and Notes, October (2002), pp. 12-13.
34. G. PANDURANGAN, P. RAGHAVAN, AND E. UPFAL, Using PageRank to characterize Web structure, in Computing and Combinatorics, Lecture Notes in Comput. Sci. 2387, Springer-Verlag, Berlin, 2002.
35. E. SENETA, Nonnegative Matrices and Markov Chains, Springer-Verlag, New York, 1981.
36. E. SENETA, Sensitivity analysis, ergodicity coefficients, and rank-one updates for finite Markov chains, in Numerical Solution of Markov Chains, W. J. Stewart, ed., Dekker, New York, 1991, pp. 121-129.
37. H. A. SIMON AND A. ANDO, Aggregation of variables in dynamic systems, Econometrica, 29 (1961), pp. 111-138.
38. W. J. STEWART, Introduction to the Numerical Solution of Markov Chains, Princeton University Press, Princeton, NJ, 1994.