메뉴 건너뛰기




Volumn 30, Issue 5, 2007, Pages 2235-2262

Multilevel adaptive aggregation for Markov chains, with application to web ranking

Author keywords

Adaptive aggregation; Markov chain; Multilevel method; Stationary probability vector; Web ranking

Indexed keywords

CHAINS; LINEAR SYSTEMS; MARKOV PROCESSES; MATRIX ALGEBRA; NUMERICAL METHODS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS; WEBSITES;

EID: 55349090995     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/070685142     Document Type: Article
Times cited : (56)

References (31)
  • 3
    • 0002438068 scopus 로고
    • Algebraic multigrid (AMG) for sparse matrix equations
    • D. J. Evans, ed, Cambridge University Press, Cambridge
    • A. BRANDT, S. F. MCCORMICK, AND J. W. RUGE, Algebraic multigrid (AMG) for sparse matrix equations, in Sparsity and Its Applications, D. J. Evans, ed., Cambridge University Press, Cambridge, 1984.
    • (1984) Sparsity and Its Applications
    • BRANDT, A.1    MCCORMICK, S.F.2    RUGE, J.W.3
  • 4
    • 6244278664 scopus 로고
    • Algebraic multigrid (AMG) for geodetic survey problems
    • Copper Mountain, CO, Elsevier, New York
    • J. RUGE, Algebraic multigrid (AMG) for geodetic survey problems, in Proceedings of the International Multigrid Conference, Copper Mountain, CO, Elsevier, New York, 1983.
    • (1983) Proceedings of the International Multigrid Conference
    • RUGE, J.1
  • 5
    • 0001633546 scopus 로고
    • Aggregation of variables in dynamic systems
    • H. A. SIMON AND A. ANDO, Aggregation of variables in dynamic systems, Econometrica, 29 (1961), pp. 111-138.
    • (1961) Econometrica , vol.29 , pp. 111-138
    • SIMON, H.A.1    ANDO, A.2
  • 6
    • 0004098998 scopus 로고
    • A Lumping Method for Numerical Calculations of Stationary Distributions of Markov Chains
    • B-18, Department of Information Sciences, Tokyo Institute of Technology
    • Y. TAKAHASHI, A Lumping Method for Numerical Calculations of Stationary Distributions of Markov Chains, Research Report B-18, Department of Information Sciences, Tokyo Institute of Technology, 1975.
    • (1975) Research Report
    • TAKAHASHI, Y.1
  • 7
    • 0000556573 scopus 로고
    • Iterative methods for computing stationary distributions of nearly completely decomposable Markov chains
    • J. R. KOURY, D. F. MCALLISTER, AND W. J. STEWART, Iterative methods for computing stationary distributions of nearly completely decomposable Markov chains, SIAM J. Alg. Discrete Methods, 5 (1984), pp. 164-186.
    • (1984) SIAM J. Alg. Discrete Methods , vol.5 , pp. 164-186
    • KOURY, J.R.1    MCALLISTER, D.F.2    STEWART, W.J.3
  • 8
    • 0022093129 scopus 로고
    • Iterative aggregation/disaggregation techniques for nearly uncoupled Markov chains
    • W. J. STEWART AND W. L. CAO, Iterative aggregation/disaggregation techniques for nearly uncoupled Markov chains, J. ACM, 32 (1985), pp. 702-719.
    • (1985) J. ACM , vol.32 , pp. 702-719
    • STEWART, W.J.1    CAO, W.L.2
  • 9
    • 38249039987 scopus 로고
    • An iterative aggregation-disaggregation algorithm for solving linear equations
    • P. J. SCHWEITZER AND K. W. KINDLE, An iterative aggregation-disaggregation algorithm for solving linear equations, Appl. Math. Comput., 18 (1986), pp. 313-354.
    • (1986) Appl. Math. Comput , vol.18 , pp. 313-354
    • SCHWEITZER, P.J.1    KINDLE, K.W.2
  • 10
    • 0025593240 scopus 로고
    • Modeling and analysis of communication systems based on computational methods for Markov chains
    • U. R. KRIEGER, B. MILLER-CLOSTERMANN, AND M. SCZITTNICK, Modeling and analysis of communication systems based on computational methods for Markov chains, IEEE J. Sel. Areas Comm., 8-9 (1990), pp. 1630-1648.
    • (1990) IEEE J. Sel. Areas Comm , vol.8-9 , pp. 1630-1648
    • KRIEGER, U.R.1    MILLER-CLOSTERMANN, B.2    SCZITTNICK, M.3
  • 12
    • 21844493797 scopus 로고
    • On a two-level multigrid solution method for finite Markov chains
    • U. R. KRIEGER, On a two-level multigrid solution method for finite Markov chains, Lineal-Algebra Appl., 223/224 (1995), pp. 415-438.
    • (1995) Lineal-Algebra Appl , vol.223-224 , pp. 415-438
    • KRIEGER, U.R.1
  • 13
    • 0032344877 scopus 로고    scopus 로고
    • Convergence analysis of an iterative aggregation/disaggregation method for computing stationary probability vectors of stochastic matrices
    • I. MAREK AND P. MAYER, Convergence analysis of an iterative aggregation/disaggregation method for computing stationary probability vectors of stochastic matrices, Numer. Lineal-Algebra Appl., 5 (1998), pp. 253-274.
    • (1998) Numer. Lineal-Algebra Appl , vol.5 , pp. 253-274
    • MAREK, I.1    MAYER, P.2
  • 14
    • 0033709988 scopus 로고    scopus 로고
    • Comparison of partitioning techniques for two-level iterative solvers on large, sparse Markov chains
    • T. DAYAR AND W. J. STEWART, Comparison of partitioning techniques for two-level iterative solvers on large, sparse Markov chains, SIAM J. Sci. Comput., 21 (2000), pp. 1691-1705.
    • (2000) SIAM J. Sci. Comput , vol.21 , pp. 1691-1705
    • DAYAR, T.1    STEWART, W.J.2
  • 15
    • 76049124858 scopus 로고    scopus 로고
    • Convergence theory of some classes of iterative aggregation/disaggregation methods for computing stationary probability vectors of stochastic matrices
    • I. MAREK AND P. MAYER, Convergence theory of some classes of iterative aggregation/disaggregation methods for computing stationary probability vectors of stochastic matrices, Linear Algebra Appl., 363 (2003), pp. 177-200.
    • (2003) Linear Algebra Appl , vol.363 , pp. 177-200
    • MAREK, I.1    MAYER, P.2
  • 16
    • 33750184660 scopus 로고    scopus 로고
    • Updating Markov chains with an eye on Google's PageRank
    • A. N. LANGVILLE AND C. D. MEYER, Updating Markov chains with an eye on Google's PageRank, SIAM J. Matrix Anal. Appl., 27 (2006), pp. 968-987.
    • (2006) SIAM J. Matrix Anal. Appl , vol.27 , pp. 968-987
    • LANGVILLE, A.N.1    MEYER, C.D.2
  • 18
    • 0028428645 scopus 로고
    • A Multi-Level Solution Algorithm for Steady-State Markov Chains
    • New York
    • G. HORTON AND S. T. LEUTENEGGER, A Multi-Level Solution Algorithm for Steady-State Markov Chains, ACM SIGMETRICS, New York, 1994, pp. 191-200.
    • (1994) ACM SIGMETRICS , pp. 191-200
    • HORTON, G.1    LEUTENEGGER, S.T.2
  • 19
    • 0037768309 scopus 로고
    • On the utility of the multi-level algorithm for the solution of nearly completely decomposable Markov chains
    • W. Stewart, ed, Kluwer, Norwell, MA
    • S. T. LEUTENEGGER AND G. HORTON, On the utility of the multi-level algorithm for the solution of nearly completely decomposable Markov chains, in Numerical Solution of Markov Chains, W. Stewart, ed., Kluwer, Norwell, MA, 1995, pp. 425-443.
    • (1995) Numerical Solution of Markov Chains , pp. 425-443
    • LEUTENEGGER, S.T.1    HORTON, G.2
  • 20
    • 0346729186 scopus 로고
    • Numerical solution of large finite Markov chains by algebraic multigrid techniques
    • W. Stewart, ed, Kluwer, Norwell, MA
    • U. R. KRIEGER, Numerical solution of large finite Markov chains by algebraic multigrid techniques, in Numerical Solution of Markov Chains, W. Stewart, ed., Kluwer, Norwell, MA, 1995, pp. 403-424.
    • (1995) Numerical Solution of Markov Chains , pp. 403-424
    • KRIEGER, U.R.1
  • 22
    • 33645345839 scopus 로고    scopus 로고
    • Reducing complexity in parallel algebraic multigrid preconditioned
    • H. DE STERCK, U. M. YANG, AND J. J. HEYS, Reducing complexity in parallel algebraic multigrid preconditioned, SIAM J. Matrix Anal. Appl., 27 (2006), pp. 1019-1039.
    • (2006) SIAM J. Matrix Anal. Appl , vol.27 , pp. 1019-1039
    • DE STERCK, H.1    YANG, U.M.2    HEYS, J.J.3
  • 23
    • 0003780986 scopus 로고    scopus 로고
    • The PageRank Citation Ranking: Bringing Order to the Web
    • Technical report 1999-0120, Computer Science Department, Stanford
    • L. PAGE, S. BRIN, R. MOTWANI, AND T. WINOGRAD, The PageRank Citation Ranking: Bringing Order to the Web, Technical report 1999-0120, Computer Science Department, Stanford, 1999.
    • (1999)
    • PAGE, L.1    BRIN, S.2    MOTWANI, R.3    WINOGRAD, T.4
  • 24
    • 0038589165 scopus 로고    scopus 로고
    • The anatomy of a large-scale hypertextual web search engine
    • S. BRIN AND L. PAGE, The anatomy of a large-scale hypertextual web search engine, Computer Networks and ISDN Systems, 33 (1998), pp. 107-117.
    • (1998) Computer Networks and ISDN Systems , vol.33 , pp. 107-117
    • BRIN, S.1    PAGE, L.2
  • 25
    • 17444429623 scopus 로고    scopus 로고
    • A survey of eigenvector methods for web information retrieval
    • A. N. LANGVILLE AND C. D. MEYER, A survey of eigenvector methods for web information retrieval, SIAM Rev., 47 (2005), pp. 135-161.
    • (2005) SIAM Rev , vol.47 , pp. 135-161
    • LANGVILLE, A.N.1    MEYER, C.D.2
  • 26
    • 84906232105 scopus 로고    scopus 로고
    • Deeper inside PageRank
    • A. N. LANGVILLE AND C. D. MEYER, Deeper inside PageRank, Internet Math., 1 (2005), pp. 335-380.
    • (2005) Internet Math , vol.1 , pp. 335-380
    • LANGVILLE, A.N.1    MEYER, C.D.2
  • 27
    • 2942519772 scopus 로고    scopus 로고
    • The Second Eigenvalue of the Google Matrix
    • Technical report 2003-0020, Computer Science Department, Stanford
    • T. H. HAVELIWALA AND S. D. KAMVAR, The Second Eigenvalue of the Google Matrix, Technical report 2003-0020, Computer Science Department, Stanford, 2003.
    • (2003)
    • HAVELIWALA, T.H.1    KAMVAR, S.D.2
  • 28
    • 48349144929 scopus 로고    scopus 로고
    • Stanford Web Matrix, http://nlp.Stanford.edu/~sdkamvar/data/stanford-web. tar.gz.
    • Stanford Web Matrix
  • 29
    • 0001927250 scopus 로고
    • Algebraic multigrid theory: The symmetric case
    • A. BRANDT, Algebraic multigrid theory: The symmetric case, Appl. Math. Comput., 19 (1986), pp. 23-56.
    • (1986) Appl. Math. Comput , vol.19 , pp. 23-56
    • BRANDT, A.1
  • 31
    • 55349101308 scopus 로고    scopus 로고
    • J. RUGE AND K. STUEBEN, Algebraic multigrid, in Multigrid Methods, S. F. McCormick, ed., Frontiers Appl. Math. 3, SIAM, Philadelphia, 1987, pp. 73-130.
    • J. RUGE AND K. STUEBEN, Algebraic multigrid, in Multigrid Methods, S. F. McCormick, ed., Frontiers Appl. Math. 3, SIAM, Philadelphia, 1987, pp. 73-130.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.