{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:49:02Z","timestamp":1725860942097},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319423449"},{"type":"electronic","value":"9783319423456"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-42345-6_3","type":"book-chapter","created":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T09:11:03Z","timestamp":1468228263000},"page":"27-38","source":"Crossref","is-referenced-by-count":2,"title":["Comparison of Random Walk Based Techniques for Estimating Network Averages"],"prefix":"10.1007","author":[{"given":"Konstantin","family":"Avrachenkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vivek S.","family":"Borkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arun","family":"Kadavankandy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jithin K.","family":"Sreedharan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,12]]},"reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1137\/S0363012999361974","volume":"40","author":"J Abounadi","year":"2001","unstructured":"Abounadi, J., Bertsekas, D., Borkar, V.S.: Learning algorithms for markov decision processes with average cost. SIAM J. Control Optim. 40(3), 681\u2013698 (2001)","journal-title":"SIAM J. Control Optim."},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/978-3-642-18009-5_10","volume-title":"Algorithms and Models for the Web-Graph","author":"K Avrachenkov","year":"2010","unstructured":"Avrachenkov, K., Ribeiro, B., Towsley, D.: Improving random walk estimation accuracy with uniform restarts. In: Kumar, R., Sivakumar, D. (eds.) WAW 2010. LNCS, vol. 6516, pp. 98\u2013109. Springer, Heidelberg (2010)"},{"key":"3_CR3","volume-title":"Probability and Measure","author":"P Billingsley","year":"2008","unstructured":"Billingsley, P.: Probability and Measure. Wiley, New York (2008)"},{"key":"3_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-93-86279-38-5","volume-title":"Stochastic Approximation","author":"VS Borkar","year":"2008","unstructured":"Borkar, V.S.: Stochastic Approximation. Cambridge University Press, Cambridge (2008)"},{"issue":"4","key":"3_CR5","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1109\/JSTSP.2014.2320229","volume":"8","author":"VS Borkar","year":"2014","unstructured":"Borkar, V.S., Makhijani, R., Sundaresan, R.: Asynchronous gossip for averaging and spectral ranking. IEEE J. Sel. Top. Sig. Process. 8(4), 703\u2013716 (2014)","journal-title":"IEEE J. Sel. Top. Sig. Process."},{"key":"3_CR6","volume-title":"Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queue","author":"P Br\u00e9maud","year":"2013","unstructured":"Br\u00e9maud, P.: Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queue. Springer, New York (2013)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Dasgupta, A., Kumar, R., Sarlos, T.: On estimating the average degree. In: Proceedings of the WWW, pp. 795\u2013806 (2014)","DOI":"10.1145\/2566486.2568019"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Gjoka, M., Kurant, M., Butts, C.T., Markopoulou, A.: Walking in facebook: a case study of unbiased sampling of osns. In: Proceedings of the IEEE INFOCOM, pp. 1\u20139 (2010)","DOI":"10.1109\/INFCOM.2010.5462078"},{"issue":"17","key":"3_CR9","doi-asserted-by":"crossref","first-page":"2202","DOI":"10.1002\/sim.3613","volume":"28","author":"S Goel","year":"2009","unstructured":"Goel, S., Salganik, M.J.: Respondent-driven sampling as Markov chain Monte Carlo. Stat. Med. 28(17), 2202\u20132229 (2009)","journal-title":"Stat. Med."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Faloutsos, C.: Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD, pp. 631\u2013636 (2006)","DOI":"10.1145\/1150402.1150479"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Maiya, A.S., Berger-Wolf, T.Y.: Sampling community structure. In: Proceedings of the WWW, pp. 701\u2013710 (2010)","DOI":"10.1145\/1772690.1772762"},{"issue":"6","key":"3_CR12","doi-asserted-by":"crossref","first-page":"678","DOI":"10.14778\/2735703.2735707","volume":"8","author":"A Nazi","year":"2015","unstructured":"Nazi, A., Zhou, Z., Thirumuruganathan, S., Zhang, N., Das, G.: Walk, not wait: faster sampling over online social networks. Proc. VLDB Endowment 8(6), 678\u2013689 (2015)","journal-title":"Proc. VLDB Endowment"},{"issue":"2","key":"3_CR13","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1111\/j.1751-5823.2002.tb00361.x","volume":"70","author":"E Nummelin","year":"2002","unstructured":"Nummelin, E.: MC\u2019s for MCMC\u2019ists. Int. Stat. Rev. 70(2), 215\u2013240 (2002)","journal-title":"Int. Stat. Rev."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Ribeiro, B., Towsley, D.: Estimating and sampling graphs with multidimensional random walks. In: Proceedings of the 10th ACM SIGCOMM, pp. 390\u2013403 (2010)","DOI":"10.1145\/1879141.1879192"},{"key":"3_CR15","volume-title":"Monte Carlo Statistical Methods","author":"C Robert","year":"2013","unstructured":"Robert, C., Casella, G.: Monte Carlo Statistical Methods. Springer Science & Business Media, New York (2013)"},{"key":"3_CR16","volume-title":"Applied Probability Models with Optimization Applications","author":"SM Ross","year":"2013","unstructured":"Ross, S.M.: Applied Probability Models with Optimization Applications. Courier Corporation, Chelmsford (2013)"},{"issue":"1","key":"3_CR17","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1111\/j.0081-1750.2004.00152.x","volume":"34","author":"MJ Salganik","year":"2004","unstructured":"Salganik, M.J., Heckathorn, D.D.: Sampling and estimation in hidden populations using respondent-driven sampling. Sociol. Methodol. 34(1), 193\u2013240 (2004)","journal-title":"Sociol. Methodol."},{"issue":"1","key":"3_CR18","first-page":"79","volume":"24","author":"E Volz","year":"2008","unstructured":"Volz, E., Heckathorn, D.D.: Probability based estimation theory for respondent driven sampling. J. Off. Stat. 24(1), 79 (2008)","journal-title":"J. Off. Stat."}],"container-title":["Lecture Notes in Computer Science","Computational Social Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42345-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T20:22:33Z","timestamp":1568146953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42345-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319423449","9783319423456"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42345-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}