{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T22:07:13Z","timestamp":1777500433471,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642180088","type":"print"},{"value":"9783642180095","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-18009-5_10","type":"book-chapter","created":{"date-parts":[[2010,12,2]],"date-time":"2010-12-02T10:31:28Z","timestamp":1291285888000},"page":"98-109","source":"Crossref","is-referenced-by-count":52,"title":["Improving Random Walk Estimation Accuracy with Uniform Restarts"],"prefix":"10.1007","author":[{"given":"Konstantin","family":"Avrachenkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Ribeiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Don","family":"Towsley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Aldous, D., Fill, J.A.: Reversible Markov Chains and Random Walks on Graphs. Book in preparation (1995), http:\/\/www.stat.berkeley.edu\/~aldous"},{"key":"10_CR2","unstructured":"Avrachenkov, K.: Analytic perturbation theory and its applications. PhD Thesis, University of South Australia (1999)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Avrachenkov, K., Ribeiro, B., Towsley, D.: Improving random walk search and estimation accuracy with uniform restarts. Tech. rep., INRIA Research Report no. 7394 (2010), http:\/\/hal.inria.fr","DOI":"10.1007\/978-3-642-18009-5_10"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.L. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science\u00a0286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"10_CR5","volume-title":"Analytic perturbation theory for matrices and operators","author":"H. Baumgartel","year":"1985","unstructured":"Baumgartel, H.: Analytic perturbation theory for matrices and operators. Birkhauser, Basel (1985)"},{"issue":"6","key":"10_CR6","doi-asserted-by":"publisher","first-page":"1499","DOI":"10.1016\/j.comnet.2006.08.004","volume":"51","author":"N. Bisnik","year":"2007","unstructured":"Bisnik, N., Abouzeid, A.A.: Optimizing random walk search algorithms in p2p networks. Computer Networks\u00a051(6), 1499\u20131514 (2007)","journal-title":"Computer Networks"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1215\/S0012-7094-52-01910-8","volume":"19","author":"A. Brauer","year":"1952","unstructured":"Brauer, A.: Limits for the characteristic roots of a matrix, iv: Applications to stochastic matrices. Duke Math. J.\u00a019, 75\u201391 (1952)","journal-title":"Duke Math. J."},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-540-95995-3_7","volume-title":"Algorithms and Models for the Web-Graph","author":"M. Bressan","year":"2009","unstructured":"Bressan, M., Peserico, E.: Choose the damping, choose the ranking? In: Avrachenkov, K., Donato, D., Litvak, N. (eds.) WAW 2009. LNCS, vol.\u00a05427, pp. 76\u201389. Springer, Heidelberg (2009)"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S. Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems\u00a030, 107\u2013117 (1998)","journal-title":"Computer Networks and ISDN Systems"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Gauvin, W., Ribeiro, B., Liu, B., Towsley, D., Wang, J.: Measurement and gender-specific analysis of user publishing characteristics on myspace. IEEE Network Special Issue on Online Social Networks (2010)","DOI":"10.1109\/MNET.2010.5578917"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Gkantsidis, C., Mihail, M.: Hybrid search schemes for unstructured peer-to-peer networks. In: Proceedings of IEEE INFOCOM, pp. 1526\u20131537 (2005)","DOI":"10.1109\/INFCOM.2005.1498436"},{"issue":"3","key":"10_CR12","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.peva.2005.01.002","volume":"63","author":"C. Gkantsidis","year":"2006","unstructured":"Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks: algorithms and evaluation. Perform. Eval.\u00a063(3), 241\u2013263 (2006)","journal-title":"Perform. Eval."},{"key":"10_CR13","unstructured":"Haveliwala, T., Kamvar, S.: The second eigenvalue of the Google matrix. Tech. Rep. Stanford (2003), http:\/\/ilpubs.stanford.edu:8090\/582\/"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Konrath, M.A., Barcellos, M.P., Mansilha, R.B.: Attacking a swarm with a band of liars: evaluating the impact of attacks on bittorrent. In: Proc. of the IEEE International Conference on Peer-to-Peer Computing, pp. 37\u201344 (2007)","DOI":"10.1109\/P2P.2007.14"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Statistical properties of community structure in large social and information networks. In: Proc. of the WWW, pp. 695\u2013704 (2008)","DOI":"10.1145\/1367497.1367591"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-540-95995-3_8","volume-title":"Algorithms and Models for the Web-Graph","author":"N. Litvak","year":"2009","unstructured":"Litvak, N., Scheinhardt, W., Volkovich, Y., Zwart, B.: Characterization of tail dependence for in-degree and pagerank. In: Avrachenkov, K., Donato, D., Litvak, N. (eds.) WAW 2009. LNCS, vol.\u00a05427, pp. 90\u2013103. Springer, Heidelberg (2009)"},{"key":"10_CR17","first-page":"1","volume":"2","author":"L. Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz, L.: Random walks on graphs: a survey. Combinatorics\u00a02, 1\u201346 (1993)","journal-title":"Combinatorics"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1002\/rsa.3240040402","volume":"4","author":"L. Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz, L., Simonovits, M.: Random walks in a convex body and an improved volume algorithm. Random Struct. Alg.\u00a04, 359\u2013412 (1993)","journal-title":"Random Struct. Alg."},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proc. of the 16th International Conference on Supercomputing, pp. 84\u201395 (2002)","DOI":"10.1145\/514191.514206"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and Analysis of Online Social Networks. In: Proc. of the IMC (October 2007)","DOI":"10.1145\/1298306.1298311"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Ribeiro, B., Towsley, D.: Estimating and sampling graphs with multidimensional random walks. In: Proc. of the ACM SIGCOMM IMC (October 2010)","DOI":"10.1145\/1879141.1879192"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1017\/S0963548300000390","volume":"1","author":"A. Sinclair","year":"1992","unstructured":"Sinclair, A.: Improved bounds for mixing rates of Markov chains and multicommodity flow. Combinatorics, Probability and Computing\u00a01, 351\u2013370 (1992)","journal-title":"Combinatorics, Probability and Computing"},{"key":"10_CR23","unstructured":"Twitter (2010), http:\/\/twitter.com"},{"key":"10_CR24","unstructured":"Volz, E., Heckathorn, D.D.: Probability based estimation theory for Respondent-Driven Sampling. Journal of Official Statistics (2008)"}],"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-18009-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:07:21Z","timestamp":1559833641000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18009-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642180088","9783642180095"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18009-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}