{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T22:07:06Z","timestamp":1777500426553,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642212857","type":"print"},{"value":"9783642212864","type":"electronic"}],"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-21286-4_5","type":"book-chapter","created":{"date-parts":[[2011,6,7]],"date-time":"2011-06-07T01:39:29Z","timestamp":1307410769000},"page":"50-61","source":"Crossref","is-referenced-by-count":30,"title":["Quick Detection of Top-k Personalized PageRank Lists"],"prefix":"10.1007","author":[{"given":"Konstantin","family":"Avrachenkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nelly","family":"Litvak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danil","family":"Nemirovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elena","family":"Smirnova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marina","family":"Sokol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F., Lang, K.: Local graph partitioning using pagerank vectors. In: Proceedings of FOCS 2006, pp. 475\u2013486 (2006)","DOI":"10.1109\/FOCS.2006.44"},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1137\/050643799","volume":"45","author":"K. Avrachenkov","year":"2007","unstructured":"Avrachenkov, K., Litvak, N., Nemirovsky, D., Osipova, N.: Monte Carlo methods in PageRank computation: When one iteration is sufficient. SIAM Journal on Numerical Analysis\u00a045(2), 890\u2013904 (2007)","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Avrachenkov, K., Litvak, N., Nemirovsky, D., Smirnova, E., Sokol, M.: Monte Carlo Methods for Top-k Personalized PageRank Lists and Name Disambiguation, INRIA Research Report no.7367 (2010)","DOI":"10.1007\/978-3-642-21286-4_5"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Avrachenkov, K., Dobrynin, V., Nemirovsky, D., Pham, S.K., Smirnova, E.: PageRank Based Clustering of Hypertext Document Collections. In: Proceedings of ACM SIGIR 2008, pp. 873\u2013874 (2008)","DOI":"10.1145\/1390334.1390549"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Bahmani, B., Chowdhury, A., Goel, A.: Fast Incremental and Personalized PageRank. In: Proceedings of VLDB Endow. (2010)","DOI":"10.14778\/1929861.1929864"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Barakat, C., Iannaccone, G., Diot, C.: Ranking flows from sampled traffic. In: Proceedings of CoNEXT 2005 (2005)","DOI":"10.1145\/1095921.1095947"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1080\/15427951.2006.10129116","volume":"3","author":"P. Berkhin","year":"2006","unstructured":"Berkhin, P.: Bookmark-Coloring Algorithm for Personalized PageRank Computing. Internet Mathematics\u00a03, 41\u201362 (2006)","journal-title":"Internet Mathematics"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The WebGraph framework I: Compression techniques. In: Proceedings of the 13th International World Wide Web Conference (WWW 2004), pp. 595\u2013601 (2004)","DOI":"10.1145\/988672.988752"},{"key":"5_CR9","unstructured":"Breyer, L.A.: Markovian Page Ranking distributions: Some theory and simulations, Technical Report (2002), http:\/\/www.lbreyer.com\/preprints.html"},{"key":"5_CR10","unstructured":"Brin, S., Page, L., Motwami, R., Winograd, T.: The PageRank citation ranking: bringing order to the Web, Stanford University Technical Report (1998)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Chakrabarti, S.: Dynamic Personalized PageRank in entity-relation graphs. In: Proceedings of WWW 2007 (2007)","DOI":"10.1145\/1242572.1242650"},{"key":"5_CR12","unstructured":"Corrado, C.J.: The exact joint distribution for the multinomial maximum and minimum and the exact distribution for the multinomial range, SSRN Research Report (2007)"},{"issue":"3","key":"5_CR13","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1080\/15427951.2005.10129104","volume":"2","author":"D. Fogaras","year":"2005","unstructured":"Fogaras, D., R\u00e1cz, B., Csalog\u00e1ny, K., Sarl\u00f3s, T.: Towards scaling fully personalized Pagerank: Algorithms, lower bounds, and experiments. Internet Mathematics\u00a02(3), 333\u2013358 (2005)","journal-title":"Internet Mathematics"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1214\/07-PS092","volume":"4","author":"A. Gnedin","year":"2007","unstructured":"Gnedin, A., Hansen, B., Pitman, J.: Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws. Probability Survyes\u00a04, 146\u2013171 (2007)","journal-title":"Probability Survyes"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Haveliwala, T.: Topic-Sensitive PageRank. In: Proceedings of WWW 2002 (2002)","DOI":"10.1145\/511446.511513"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Scaling personalized web search. In: Proceedings of WWW 2003 (2003)","DOI":"10.1145\/775152.775191"},{"key":"5_CR17","volume-title":"Discrete Multivariate Distributions","author":"K.L. Johnson","year":"1997","unstructured":"Johnson, K.L., Kotz, S., Balakrishnan, N.: Discrete Multivariate Distributions. Wiley, New York (1997)"},{"key":"5_CR18","volume-title":"Finite Markov Chains","author":"J. Kemeny","year":"1976","unstructured":"Kemeny, J., Snell, J.: Finite Markov Chains. Springer, Heidelberg (1976)"},{"key":"5_CR19","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":"5_CR20","doi-asserted-by":"crossref","unstructured":"Liben-Nowell, D., Kleinberg, J.: The link prediction problem for social networks. In: Proceedings of CIKM 2003 (2003)","DOI":"10.1145\/956863.956972"},{"key":"5_CR21","unstructured":"Smirnova, E., Avrachenkov, K., Trousse, B.: Using Web Graph Structure for Person Name Disambiguation. In: Proceedings of CLEF\/WEPS 2010 (2010)"},{"issue":"1","key":"5_CR22","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1111\/j.2517-6161.1992.tb01875.x","volume":"54","author":"K. Tanabe","year":"1992","unstructured":"Tanabe, K., Sagae, M.: An exact Cholesky Decomposition and the generalized inverse of the variance-covariance matrix of the multinomial distribution, with applications. Journal of the Royal Statistical Society (Series B)\u00a054(1), 211\u2013219 (1992)","journal-title":"Journal of the Royal Statistical Society (Series B)"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1186\/1752-0509-3-112","volume":"3","author":"K. Voevodski","year":"2009","unstructured":"Voevodski, K., Teng, S.H., Xia, Y.: Spectral affinity in protein networks. BMC Systems Biology\u00a03, 112 (2009)","journal-title":"BMC Systems Biology"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Zlatic, V., Bozicevic, M., Stefancic, H., Domazet, M.: Wikipedias: Collaborative web-based encyclopedias as complex networks. Phys. Rev. E\u00a074 (2006)","DOI":"10.1103\/PhysRevE.74.016115"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21286-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T00:33:06Z","timestamp":1741221186000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21286-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212857","9783642212864"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21286-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}