{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:50:53Z","timestamp":1742939453179,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319240237"},{"type":"electronic","value":"9783319240244"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-24024-4_19","type":"book-chapter","created":{"date-parts":[[2015,9,4]],"date-time":"2015-09-04T08:00:10Z","timestamp":1441353610000},"page":"344-357","source":"Crossref","is-referenced-by-count":2,"title":["Random Surfing Without Teleportation"],"prefix":"10.1007","author":[{"given":"Athanasios N.","family":"Nikolakopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John D.","family":"Garofalakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,22]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-77004-6_2","volume-title":"Algorithms and Models for the Web-Graph","author":"K Avrachenkov","year":"2007","unstructured":"Avrachenkov, K., Litvak, N., Pham, K.S.: Distribution of pagerank mass among principle components of the web. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol. 4863, pp. 16\u201328. Springer, Heidelberg (2007)"},{"issue":"4","key":"19_CR2","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1080\/15427951.2006.10129134","volume":"3","author":"R Baeza-Yates","year":"2006","unstructured":"Baeza-Yates, R., Boldi, P., Castillo, C.: Generic damping functions for propagating importance in link-based ranking. Internet Math. 3(4), 445\u2013478 (2006). \n                      http:\/\/dx.doi.org\/10.1080\/15427951.2006.10129134","journal-title":"Internet Math."},{"key":"19_CR3","unstructured":"Boldi, P.: Totalrank: ranking without damping. In: Special Interest Tracks and Posters of the 14th International Conference on World Wide Web, WWW 2005, pp. 898\u2013899. ACM, New York (2005). \n                      http:\/\/doi.acm.org\/10.1145\/1062745.1062787"},{"key":"19_CR4","unstructured":"Boldi, P., Santini, M., Vigna, S.: A deeper investigation of pagerank as a function of the damping factor. In: Frommer, A., Mahoney, M.W., Szyld, D.B. (eds.) Web Information Retrieval and Linear Algebra Algorithms, 11-16 February 2007, Dagstuhl Seminar Proceedings, vol. 07071, Internationales Begegnungs- und Forschungszentrum f\u00fcr Informatik (IBFI), Schloss Dagstuhl, Germany (2007). \n                      http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2007\/1072"},{"issue":"4","key":"19_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1629096.1629097","volume":"27","author":"P Boldi","year":"2009","unstructured":"Boldi, P., Santini, M., Vigna, S.: Pagerank: functional dependencies. ACM Trans. Inf. Syst. 27(4), 1\u201323 (2009). \n                      http:\/\/doi.acm.org\/10.1145\/1629096.1629097","journal-title":"ACM Trans. Inf. Syst."},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1080\/15427951.2009.10129185","volume":"6","author":"PG Constantine","year":"2009","unstructured":"Constantine, P.G., Gleich, D.F.: Random alpha pagerank. Internet Math. 6(2), 189\u2013236 (2009). \n                      http:\/\/dx.doi.org\/10.1080\/15427951.2009.10129185","journal-title":"Internet Math."},{"issue":"6","key":"19_CR7","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1145\/3812.3814","volume":"28","author":"PJ Courtois","year":"1985","unstructured":"Courtois, P.J.: On time and space decomposition of complex structures. Commun. ACM 28(6), 590\u2013603 (1985). \n                      http:\/\/doi.acm.org\/10.1145\/988672.988714","journal-title":"Commun. ACM"},{"key":"19_CR8","unstructured":"Eiron, N., McCurley, K.S., Tomlin, J.A.: Ranking the web frontier. In: Proceedings of the 13th International Conference on World Wide Web, WWW 2004, pp. 309\u2013318. ACM, New York (2004). \n                      http:\/\/doi.acm.org\/10.1145\/988672.988714"},{"key":"19_CR9","volume-title":"\u00dceber matrizen aus positiven elementen i and ii","author":"G Frobenius","year":"1908","unstructured":"Frobenius, G.: \u00dceber matrizen aus positiven elementen i and ii. Sitzungsber. Preuss. Akad. Wiss, Berlin (1908)"},{"key":"19_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411","volume-title":"Matrix Analysis","author":"RA Horn","year":"2012","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (2012)"},{"key":"19_CR11","unstructured":"Kamvar, S., Haveliwala, T.: The condition number of the pagerank problem (2003)"},{"key":"19_CR12","volume-title":"Google\u2019s PageRank and Beyond: The Science of Search Engine Rankings","author":"AN Langville","year":"2011","unstructured":"Langville, A.N., Meyer, C.D.: Google\u2019s PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, Princeton (2011)"},{"key":"19_CR13","unstructured":"Nikolakopoulos, A.N., Garofalakis, J.D.: NCDawareRank: a novel ranking method that exploits the decomposable structure of the web. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, WSDM 2013, pp. 143\u2013152. ACM, New York (2013). \n                      http:\/\/doi.acm.org\/10.1145\/2433396.2433415"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Nikolakopoulos, A.N., Garofalakis, J.D.: NCDREC: a decomposability inspired framework for top-n recommendation. In: 2014 IEEE\/WIC\/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT), Warsaw, Poland, 11\u201314 August 2014 - Volume II, pp. 183\u2013190. IEEE (2014). \n                      http:\/\/dx.doi.org\/10.1109\/WI-IAT.2014.32","DOI":"10.1109\/WI-IAT.2014.32"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.neucom.2014.09.082","volume":"163","author":"AN Nikolakopoulos","year":"2015","unstructured":"Nikolakopoulos, A.N., Kouneli, M.A., Garofalakis, J.D.: Hierarchical itemspace rank: exploiting hierarchy to alleviate sparsity in ranking-based recommendation. Neurocomputing 163, 126\u2013136 (2015). \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0925231215002180","journal-title":"Neurocomputing"},{"key":"19_CR16","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bringing order to the web (1999)"},{"issue":"2","key":"19_CR17","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/BF01449896","volume":"64","author":"O Perron","year":"1907","unstructured":"Perron, O.: Zur theorie der matrices. Mathematische Annalen 64(2), 248\u2013263 (1907)","journal-title":"Mathematische Annalen"},{"key":"19_CR18","series-title":"Springer Series in Statistics","volume-title":"Non-negative matrices and markov chains","author":"E Seneta","year":"2006","unstructured":"Seneta, E.: Non-negative matrices and markov chains. Springer Series in Statistics. Springer, New York (2006)"},{"key":"19_CR19","volume-title":"The Sciences of the Artificial","author":"HA Simon","year":"1996","unstructured":"Simon, H.A.: The Sciences of the Artificial, vol. 136. MIT press, Cambridge (1996)"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"111","DOI":"10.2307\/1909285","volume":"29","author":"HA Simon","year":"1961","unstructured":"Simon, H.A., Ando, A.: Aggregation of variables in dynamic systems. Econometrica J. Econometric Soc. 29, 111\u2013138 (1961)","journal-title":"Econometrica J. Econometric Soc."}],"container-title":["Lecture Notes in Computer Science","Algorithms, Probability, Networks, and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24024-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T17:51:12Z","timestamp":1559238672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24024-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319240237","9783319240244"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24024-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}