{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T02:43:52Z","timestamp":1767235432429},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319267838"},{"type":"electronic","value":"9783319267845"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26784-5_12","type":"book-chapter","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T10:07:47Z","timestamp":1449655667000},"page":"151-163","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["PageRank in Undirected Random Graphs"],"prefix":"10.1007","author":[{"given":"Konstantin","family":"Avrachenkov","sequence":"first","affiliation":[]},{"given":"Arun","family":"Kadavankandy","sequence":"additional","affiliation":[]},{"given":"Liudmila","family":"Ostroumova Prokhorenkova","sequence":"additional","affiliation":[]},{"given":"Andrei","family":"Raigorodskii","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,9]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F., Lang, K.: Local graph partitioning using pagerank vectors. In: Proceedings of IEEE FOCS (2006)","DOI":"10.1109\/FOCS.2006.44"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Avrachenkov, K., Cottatellucci, L., Kadavankandy, A.: Spectral properties of random matrices for stochastic block model. In Proceedings of WiOpt Workshop PhysComNet (2015)","DOI":"10.1109\/WIOPT.2015.7151116"},{"key":"12_CR3","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, pp. 873\u2013874 (2008)","DOI":"10.1145\/1390334.1390549"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Avrachenkov, K., Gon\u00e7alves, P., Mishenin, A., Sokol, M.: Generalized optimization framework for graph-based semi-supervised learning. In: Proceedings of SIAM Conference on Data Mining, vol. 9 (2012)","DOI":"10.1137\/1.9781611972825.83"},{"issue":"2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1080\/15427951.2006.10129120","volume":"3","author":"K Avrachenkov","year":"2006","unstructured":"Avrachenkov, K., Lebedev, D.: PageRank of scale-free growing networks. Internet Math. 3(2), 207\u2013231 (2006)","journal-title":"Internet Math."},{"key":"12_CR6","unstructured":"Bhatia, R.: Matrix analysis. Springer Sci. Bus. Media 169, (2013)"},{"key":"12_CR7","volume-title":"Probability and measure","author":"P Billingsley","year":"2008","unstructured":"Billingsley, P.: Probability and measure. Wiley, New York (2008)"},{"key":"12_CR8","unstructured":"Boudin, F.: A comparison of centrality measures for graph-based keyphrase extraction. In: Proceedings of the International Joint Conference on Natural Language Processing (IJCNLP) (2013)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/978-3-319-13123-8_10","volume-title":"Algorithms and Models for the Web Graph","author":"N Chen","year":"2014","unstructured":"Chen, N., Litvak, N., Olvera-Cravioto, M.: Pagerank in scale-free random graphs. In: Bonato, A., Graham, F.C., Pra\u0142at, P. (eds.) WAW 2014. LNCS, vol. 8882, pp. 120\u2013131. Springer, Heidelberg (2014)"},{"key":"12_CR10","unstructured":"Chen, N., Litvak, N., Olvera-Cravioto, M.: Ranking algorithms on directed configuration networks (2014). Preprint arXiv:1409.7443"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-95995-3_6","volume-title":"Algorithms and Models for the Web-Graph","author":"F Chung","year":"2009","unstructured":"Chung, F.: A local graph partitioning algorithm using heat kernel pagerank. In: Avrachenkov, K., Donato, D., Litvak, N. (eds.) WAW 2009. LNCS, vol. 5427, pp. 62\u201375. Springer, Heidelberg (2009)"},{"key":"12_CR12","volume-title":"Spectral Graph Theory","author":"F Chung","year":"1997","unstructured":"Chung, F.: Spectral Graph Theory. American Mathematical Soc, Providence (1997)"},{"issue":"25","key":"12_CR13","doi-asserted-by":"publisher","first-page":"15879","DOI":"10.1073\/pnas.252631999","volume":"99","author":"F Chung","year":"2002","unstructured":"Chung, F., Lu, L.: The average distances in random graphs with given expected degrees. PNAS 99(25), 15879\u201315882 (2002)","journal-title":"PNAS"},{"issue":"11","key":"12_CR14","doi-asserted-by":"publisher","first-page":"6313","DOI":"10.1073\/pnas.0937490100","volume":"100","author":"F Chung","year":"2003","unstructured":"Chung, F., Lu, L., Vu, V.: Spectra of random graphs with given expected degrees. PNAS 100(11), 6313\u20136318 (2003)","journal-title":"PNAS"},{"issue":"1","key":"12_CR15","doi-asserted-by":"crossref","first-page":"215","DOI":"10.37236\/702","volume":"18","author":"F Chung","year":"2011","unstructured":"Chung, F., Radcliffe, M.: On the spectra of general random graphs. Electron. J. Comb. 18(1), 215 (2011)","journal-title":"Electron. J. Comb."},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Ding, C., He, X., Husbands, P., Zha, H., Simon, H.D.: PageRank. In: Proceedings of ACM SIGIR HITS and a Unified Framework for Link Analysis (2002)","DOI":"10.1137\/1.9781611972733.24"},{"key":"12_CR17","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs. Publicationes Math. Debrecen 6, 290\u2013297 (1959)","journal-title":"Publicationes Math. Debrecen"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-78808-9_6","volume-title":"Algorithms and Models for the Web-Graph","author":"S Fortunato","year":"2008","unstructured":"Fortunato, S., Bogu\u00f1\u00e1, M., Flammini, A., Menczer, F.: Approximating pagerank from in-degree. In: Aiello, W., Broder, A., Janssen, J., Milios, E.E. (eds.) WAW 2006. LNCS, vol. 4936, pp. 59\u201371. Springer, Heidelberg (2008)"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Gkorou, D., Vinko, T., Pouwelse, J., Epema, D.: Leveraging node properties in random walks for robust reputations in decentralized networks. In: Proceedings of IEEE Peer-to-Peer Computing (P2P) (2013)","DOI":"10.1109\/P2P.2013.6688708"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Haveliwala, T.H.: Topic-sensitive pagerank. In: Proceedings of WWW, pp. 517\u2013526 (2002)","DOI":"10.1145\/511511.511513"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: The eigentrust algorithm for reputation management in p2p networks. In: Proceedings of WWW (2003)","DOI":"10.1145\/775152.775242"},{"issue":"3","key":"12_CR22","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1080\/15427951.2004.10129091","volume":"1","author":"AN Langville","year":"2004","unstructured":"Langville, A.N., Meyer, C.D.: Deeper inside pagerank. Internet Math. 1(3), 335\u2013380 (2004)","journal-title":"Internet Math."},{"issue":"2\u20133","key":"12_CR23","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1080\/15427951.2007.10129293","volume":"4","author":"N Litvak","year":"2007","unstructured":"Litvak, N., Scheinhardt, W.R., Volkovich, Y.: In-degree and pagerank: why do they follow similar power laws? Internet Math. 4(2\u20133), 175\u2013198 (2007)","journal-title":"Internet Math."},{"key":"12_CR24","volume-title":"Markov chains and mixing times","author":"DA Levin","year":"2009","unstructured":"Levin, D.A., Peres, Y., Wilmer, E.L.: Markov chains and mixing times. American Mathematical Soc, Providence (2009)"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Moler, C., Moler, K.: Numerical Computing with MATLAB. SIAM (2003)","DOI":"10.1137\/1.9780898717952"},{"key":"12_CR26","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: Pagerank: bringing order to the web. Stanford Digital Libraries Working Paper, v. 72 (1997)"},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"036107","DOI":"10.1103\/PhysRevE.78.036107","volume":"78","author":"N Perra","year":"2008","unstructured":"Perra, N., Fortunato, S.: Spectral centrality measures in complex networks. Phys. Rev. E 78, 036107 (2008)","journal-title":"Phys. Rev. E"},{"issue":"1\u20133","key":"12_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/0400000010","volume":"7","author":"S Vadhan","year":"2012","unstructured":"Vadhan, S.: Pseudorandomness. Found. Trends Theoret. Comput. Sci. 7(1\u20133), 1\u2013336 (2012)","journal-title":"Found. Trends Theoret. Comput. Sci."},{"issue":"2","key":"12_CR29","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1239\/aap\/1275055243","volume":"42","author":"Y Volkovich","year":"2010","unstructured":"Volkovich, Y., Litvak, N.: Asymptotic analysis for personalized web search. Adv. Appl. Prob. 42(2), 577\u2013604 (2010)","journal-title":"Adv. Appl. Prob."},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Yeh, E., Ramage, D., Manning, C.D., Agirre, E., Soroa, A.: WikiWalk: random walks on Wikipedia for semantic relatedness. In: Proceedings of the Workshop on Graph-based Methods for Natural Language Processing (2009)","DOI":"10.3115\/1708124.1708133"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26784-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T02:59:51Z","timestamp":1692154791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26784-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319267838","9783319267845"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26784-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}