{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:19:52Z","timestamp":1743034792133,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027413"},{"type":"electronic","value":"9783642027420"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-02742-0_23","type":"book-chapter","created":{"date-parts":[[2011,4,12]],"date-time":"2011-04-12T10:44:40Z","timestamp":1302605080000},"page":"548-570","source":"Crossref","is-referenced-by-count":1,"title":["An Algebraic Multigrid Solution of Large Hierarchical Markovian Models Arising in Web Information Retrieval"],"prefix":"10.1007","author":[{"given":"Udo R.","family":"Krieger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","volume-title":"Modeling the Internet and the Web - Probabilistic Methods and Algorithms","author":"P. Baldi","year":"2003","unstructured":"Baldi, P., et al.: Modeling the Internet and the Web - Probabilistic Methods and Algorithms. John Wiley & Sons, Chichester (2003)"},{"key":"23_CR2","volume-title":"Nonnegative Matrices in the Mathematical Sciences","author":"A. Berman","year":"1979","unstructured":"Berman, A., Plemmons, R.J.: Nonnegative Matrices in the Mathematical Sciences. Academic Press, New York (1979)"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1145\/3828.214137","volume":"32","author":"W. Cao","year":"1985","unstructured":"Cao, W., Stewart, W.J.: Iterative aggregation\/disaggregation techniques for nearly uncoupled Markov chains. Journal of the ACM\u00a032, 702\u2013719 (1985)","journal-title":"Journal of the ACM"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0024-3795(82)90242-7","volume":"43","author":"F. Chatelin","year":"1982","unstructured":"Chatelin, F., Miranker, W.L.: Acceleration by aggregation of successive approximation methods. Linear Algebra and its Applications\u00a043, 17\u201347 (1982)","journal-title":"Linear Algebra and its Applications"},{"key":"23_CR5","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198515906.001.0001","volume-title":"Evolution of Networks","author":"S.N. Dorogovtsev","year":"2003","unstructured":"Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of Networks. Oxford University Press, New York (2003)"},{"issue":"2","key":"23_CR6","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1137\/0725026","volume":"25","author":"C.C. Douglas","year":"1988","unstructured":"Douglas, C.C., Miranker, W.L.: Constructive interference in parallel algorithms. SIAM J. Numer. Analysis\u00a025(2), 376\u2013398 (1988)","journal-title":"SIAM J. Numer. Analysis"},{"key":"23_CR7","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1996","unstructured":"Golub, G.H., van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins, Baltimore (1996)","edition":"3"},{"key":"23_CR8","unstructured":"Kumar, S.\u00a0D., et al.: Exploiting the block structure of the Web for computing PageRank. Stanford University Technical Report (2003), \n                      http:\/\/citeseer.ist.psu.edu\/kamvar03exploiting.html"},{"key":"23_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-01354-9","volume-title":"Iterative L\u00f6sung gro\u00dfer schwachbesetzter Gleichungssysteme","author":"W. Hackbusch","year":"1991","unstructured":"Hackbusch, W.: Iterative L\u00f6sung gro\u00dfer schwachbesetzter Gleichungssysteme. Teubner, Stuttgart (1991)"},{"issue":"4","key":"23_CR10","doi-asserted-by":"publisher","first-page":"952","DOI":"10.1137\/0724062","volume":"24","author":"M. Haviv","year":"1987","unstructured":"Haviv, M.: Aggregation\/disaggregation methods for computing the stationary distribution of a Markov chain. SIAM J. Numer. Analysis\u00a024(4), 952\u2013966 (1987)","journal-title":"SIAM J. Numer. Analysis"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Horton, G., Leutenegger, S.: A multilevel solution algorithm for steady-state Markov chains. In: Proc. SIGMETRICS 1994, Nashville, May 16-20 (1994)","DOI":"10.1145\/183018.183040"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Kammenhuber, N., Luxenburger, J., Feldmann, A., Weikum, G.: Web search clickstreams. In: Internet Measurement Conference 2006, pp. 245\u2013250 (2006)","DOI":"10.1145\/1177080.1177110"},{"issue":"11","key":"23_CR13","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1016\/j.comnet.2005.07.009","volume":"50","author":"S.A. Krashakov","year":"2006","unstructured":"Krashakov, S.A., Teslyuk, A.B., Shchur, L.N.: On the universality of rank distributions of website popularity. Computer Networks\u00a050(11), 1769\u20131780 (2006)","journal-title":"Computer Networks"},{"issue":"9","key":"23_CR14","doi-asserted-by":"publisher","first-page":"1630","DOI":"10.1109\/49.62851","volume":"8","author":"U.R. Krieger","year":"1990","unstructured":"Krieger, U.R., M\u00fcller-Clostermann, B., Sczittnick, M.: Modeling and analysis of communication systems based on computational methods for Markov chains. IEEE Journal on Selected Areas in Communications\u00a08(9), 1630\u20131648 (1990)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/0024-3795(95)00166-O","volume":"223\/224","author":"U.R. Krieger","year":"1995","unstructured":"Krieger, U.R.: On a two-level multigrid solution method for finite Markov chains. Linear Algebra and its Applications\u00a0223\/224, 415\u2013438 (1995)","journal-title":"Linear Algebra and its Applications"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-1-4615-2241-6_23","volume-title":"Computations with Markov Chains","author":"U.R. Krieger","year":"1995","unstructured":"Krieger, U.R.: Numerical solution of large finite Markov chains by algebraic multigrid techniques. In: Stewart, W.J. (ed.) Computations with Markov Chains, pp. 403\u2013424. Kluwer, Boston (1995)"},{"key":"23_CR17","doi-asserted-by":"crossref","DOI":"10.1515\/9781400830329","volume-title":"Google\u2019s Pagerank and Beyond: The Science of Search Engine Rankings","author":"A.N. Langville","year":"2006","unstructured":"Langville, A.N., Meyer, C.D.: Google\u2019s Pagerank and Beyond: The Science of Search Engine Rankings. Princeton University Press, Princeton (2006)"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/382979.383041","volume":"19","author":"R. Lempel","year":"2001","unstructured":"Lempel, R., Moran, S.: SALSA: the stochastic approach for link-structure analysis. ACM Trans. Information Systems\u00a019, 131\u2013160 (2001)","journal-title":"ACM Trans. Information Systems"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0024-3795(83)90157-X","volume":"51","author":"J. Mandel","year":"1983","unstructured":"Mandel, J., Sekerka, B.: A local convergence proof for the iterative aggregation method. Linear Algebra and its Applications\u00a051, 163\u2013172 (1983)","journal-title":"Linear Algebra and its Applications"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Ng, A.Y., et al.: Stable algorithms for link analysis. In: Proc. 24th Ann. Int. ACM SIGIR Conf., pp. 258\u2013266 (2001)","DOI":"10.1145\/383952.384003"},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/0024-3795(84)90222-2","volume":"58","author":"H. Schneider","year":"1984","unstructured":"Schneider, H.: Theorems on M-splittings of a singular M-matrix which depend on graph structure. Linear Algebra and its Applications\u00a058, 407\u2013424 (1984)","journal-title":"Linear Algebra and its Applications"},{"key":"23_CR22","first-page":"63","volume-title":"Numerical Solution of Markov Chains","author":"P.J. Schweitzer","year":"1991","unstructured":"Schweitzer, P.J.: A survey of aggregation-disaggregation in large Markov chains. In: Stewart, W.J. (ed.) Numerical Solution of Markov Chains, pp. 63\u201388. Marcel Dekker, New York (1991)"},{"key":"23_CR23","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0096-3003(86)90003-2","volume":"18","author":"P.J. Schweitzer","year":"1986","unstructured":"Schweitzer, P.J., Kindle, K.W.: An iterative aggregation-disaggregation algorithm for solving linear equations. Applied Mathematics and Computation\u00a018, 313\u2013353 (1986)","journal-title":"Applied Mathematics and Computation"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Wang, Q., et al.: Improving link analysis through considering hosts and blocks. In: Proc. IEEE\/WIC\/ACM Int. Conference on Web Intelligence 2006 (2006)","DOI":"10.1109\/WI.2006.97"}],"container-title":["Lecture Notes in Computer Science","Network Performance Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02742-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T12:06:50Z","timestamp":1714133210000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-02742-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642027413","9783642027420"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02742-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}