{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:49Z","timestamp":1740109309982,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,2,14]],"date-time":"2018-02-14T00:00:00Z","timestamp":1518566400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,2,14]],"date-time":"2018-02-14T00:00:00Z","timestamp":1518566400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Ministry of Education and China Mobile Joint Research Fund Program","award":["MCM20150506","MCM20160311"],"award-info":[{"award-number":["MCM20150506","MCM20160311"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61103240","61103241"],"award-info":[{"award-number":["61103240","61103241"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61221063","91118005"],"award-info":[{"award-number":["61221063","91118005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61221063","U1301254"],"award-info":[{"award-number":["61221063","U1301254"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"863 High Tech Development Plan","award":["2012AA011003"],"award-info":[{"award-number":["2012AA011003"]}]},{"name":"111 International Collaboration Program of China"},{"name":"the Application Foundation Research Program of SuZhou","award":["SYG201311"],"award-info":[{"award-number":["SYG201311"]}]},{"name":"the Prospective Research Project on Future Networks of Jiangsu Future Networks Innovation Institute"},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["MURI W911NF-08-1-0233"],"award-info":[{"award-number":["MURI W911NF-08-1-0233"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005423","name":"Association of Research Libraries","doi-asserted-by":"publisher","award":["W911NF-09-2-0053"],"award-info":[{"award-number":["W911NF-09-2-0053"]}],"id":[{"id":"10.13039\/100005423","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100001641","name":"Glaucoma Research Foundation","doi-asserted-by":"publisher","award":["415013"],"award-info":[{"award-number":["415013"]}],"id":[{"id":"10.13039\/100001641","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s10115-018-1167-0","type":"journal-article","created":{"date-parts":[[2018,2,14]],"date-time":"2018-02-14T15:40:03Z","timestamp":1518622803000},"page":"701-728","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Practical characterization of large networks using neighborhood information"],"prefix":"10.1007","volume":"58","author":[{"given":"Pinghui","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junzhou","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Ribeiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John C. S.","family":"Lui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Don","family":"Towsley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohong","family":"Guan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,14]]},"reference":[{"key":"1167_CR1","doi-asserted-by":"crossref","unstructured":"Leskovec J, Faloutsos C (2006) Sampling from large graphs. In: SIGKDD, pp 631\u2013636","DOI":"10.1145\/1150402.1150479"},{"key":"1167_CR2","doi-asserted-by":"crossref","unstructured":"Hubler C et al (2008) Metropolis algorithms for representative subgraph sampling. In: ICDM, pp 283\u2013292","DOI":"10.1109\/ICDM.2008.124"},{"key":"1167_CR3","doi-asserted-by":"crossref","unstructured":"Maiya AS, Berger-Wolf TY (2011) Benefits of bias: towards better characterization of network sampling. In: SIGKDD, pp 105\u2013113","DOI":"10.1145\/2020408.2020431"},{"issue":"2","key":"1167_CR4","first-page":"7:1","volume":"8","author":"NK Ahmed","year":"2012","unstructured":"Ahmed NK et al (2012) Network sampling: from static to streaming graphs. TKDD 8(2):7:1\u20137:56","journal-title":"TKDD"},{"key":"1167_CR5","doi-asserted-by":"crossref","unstructured":"Dasgupta A et al (2012) Social sampling. In: SIGKDD, pp 235\u2013243","DOI":"10.1145\/2339530.2339572"},{"key":"1167_CR6","doi-asserted-by":"crossref","unstructured":"Ribeiro B, Towsley D (2010) Estimating and sampling graphs with multidimensional random walks. In: IMC, pp 390\u2013403","DOI":"10.1145\/1879141.1879192"},{"key":"1167_CR7","doi-asserted-by":"crossref","unstructured":"Gjoka M et al (2010) Walking in Facebook: a case study of unbiased sampling of OSNs. In: INFOCOM, pp 2498\u20132506","DOI":"10.1109\/INFCOM.2010.5462078"},{"key":"1167_CR8","doi-asserted-by":"crossref","unstructured":"Ribeiro B, Towsley D (2012) On the estimation accuracy of degree distributions from graph sampling. In: CDC, pp 1\u20136","DOI":"10.1109\/CDC.2012.6425857"},{"key":"1167_CR9","doi-asserted-by":"crossref","unstructured":"Avrachenkov K et al (2010) Improving random walk estimation accuracy with uniform restarts. In: WAW, pp 98\u2013109","DOI":"10.1007\/978-3-642-18009-5_10"},{"issue":"4","key":"1167_CR10","doi-asserted-by":"publisher","first-page":"543","DOI":"10.2307\/2527652","volume":"15","author":"FA Graybill","year":"1959","unstructured":"Graybill FA, Deal RB (1959) Combining unbiased estimators. Biometrics 15(4):543\u2013550","journal-title":"Biometrics"},{"key":"1167_CR11","first-page":"1","volume":"2","author":"L Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz L (1993) Random walks on graphs: a survey. Combinatorics 2:1\u201346","journal-title":"Combinatorics"},{"key":"1167_CR12","unstructured":"Ribeiro B et al (2010) Multiple random walks to uncover short paths in power law networks. In: INFOCOM NetSciCom, pp 1\u20136"},{"key":"1167_CR13","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1214\/154957804100000024","volume":"1","author":"GO Roberts","year":"2004","unstructured":"Roberts GO, Rosenthal JS (2004) General state space Markov chains and MCMC algorithms. Probab Surv 1:20\u201371","journal-title":"Probab Surv"},{"key":"1167_CR14","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1214\/154957804100000051","volume":"1","author":"GL Jones","year":"2004","unstructured":"Jones GL (2004) On the Markov chain central limit theorem. Probab Surv 1:299\u2013320","journal-title":"Probab Surv"},{"key":"1167_CR15","doi-asserted-by":"crossref","unstructured":"Kurant M et al (2011) Walking on a graph with a magnifying glass: stratified sampling via weighted random walks. In: SIGMETRICS, pp 281\u2013292","DOI":"10.1145\/1993744.1993773"},{"key":"1167_CR16","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1080\/01621459.1952.10483446","volume":"47","author":"DG Horvitz","year":"1952","unstructured":"Horvitz DG, Thompson DJ (1952) A generalization of sampling without replacement from a finite universe. JASA 47:663\u2013685","journal-title":"JASA"},{"key":"1167_CR17","doi-asserted-by":"crossref","unstructured":"Lee CH et al (2012) Beyond random walk and Metropolis\u2013Hastings samplers: Why you should not backtrack for unbiased graph sampling. In: SIGMETRICS\/Performance, pp 319\u2013330","DOI":"10.1145\/2254756.2254795"},{"key":"1167_CR18","doi-asserted-by":"crossref","unstructured":"Lim Y et al (2011) Online estimating the $$k$$ central nodes of a network. In: NSW, pp 1\u20136","DOI":"10.1109\/NSW.2011.6004633"},{"key":"1167_CR19","doi-asserted-by":"crossref","unstructured":"Cooper C et al (2012) A fast algorithm to find all high degree vertices in power law graphs. In: WWW LSNA, pp 1007\u20131016","DOI":"10.1145\/2187980.2188235"},{"key":"1167_CR20","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1145\/174130.174131","volume":"40","author":"D Coppersmith","year":"1993","unstructured":"Coppersmith D et al (1993) Random walks on weighted graphs, and applications to on-line algorithms (extended). J ACM 40:421\u2013453","journal-title":"J ACM"},{"key":"1167_CR21","doi-asserted-by":"crossref","unstructured":"Maiya AS, Berger-Wolf TY (2010) Online sampling of high centrality individuals in social networks. In: PAKDD, pp 91\u201398","DOI":"10.1007\/978-3-642-13657-3_12"},{"key":"1167_CR22","doi-asserted-by":"crossref","unstructured":"Maiya AS, Berger-Wolf TY (2011) Benefits of bias: towards better characterization of network sampling. In: SIGKDD, pp 105\u2013113","DOI":"10.1145\/2020408.2020431"},{"key":"1167_CR23","doi-asserted-by":"crossref","unstructured":"Hui P et al (2008) BUBBLE Rap: social-based forwarding in delay tolerant networks. In: MobiHoc, pp 241\u2013250","DOI":"10.1145\/1374618.1374652"},{"key":"1167_CR24","doi-asserted-by":"crossref","unstructured":"Ribeiro B et al (2012) Multiple random walks to uncover short paths in power law networks. In: Infocom NetSciCom, pp 1\u20136","DOI":"10.1109\/INFCOMW.2012.6193500"},{"key":"1167_CR25","unstructured":"Wang P et al (2012) Sampling contents distributed over graphs. Technical Report TR-1201, Xi\u2019an Jiaotong University"},{"key":"1167_CR26","doi-asserted-by":"crossref","unstructured":"Mislove A et al (2007) Measurement and analysis of online social networks. In: IMC, pp 29\u201342","DOI":"10.1145\/1298306.1298311"},{"key":"1167_CR27","doi-asserted-by":"crossref","unstructured":"Richardson M et al (2003) Trust management for the semantic web. In: ISWC, pp 351\u2013368","DOI":"10.1007\/978-3-540-39718-2_23"},{"issue":"1","key":"1167_CR28","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec J et al (2009) Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math 6(1):29\u2013123","journal-title":"Internet Math"},{"key":"1167_CR29","doi-asserted-by":"crossref","unstructured":"Ribeiro B et al (2012) Sampling directed graphs with random walks. In: INFOCOM, pp 1692\u20131700","DOI":"10.1109\/INFCOM.2012.6195540"},{"key":"1167_CR30","doi-asserted-by":"crossref","unstructured":"Kurant M et al (2011) Walking on a graph with a magnifying glass: stratified sampling via weighted random walks. In: SIGMETRICS, pp 241\u2013252","DOI":"10.1145\/1993744.1993773"},{"issue":"9","key":"1167_CR31","first-page":"1799","volume":"29","author":"M Kurant","year":"2011","unstructured":"Kurant M et al (2011) Towards unbiased BFS sampling. JSAC 29(9):1799\u20131809","journal-title":"JSAC"},{"issue":"1","key":"1167_CR32","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1525\/sp.2002.49.1.11","volume":"49","author":"DD Heckathorn","year":"2002","unstructured":"Heckathorn DD (2002) Respondent-driven sampling II: deriving valid population estimates from chain-referral samples of hidden populations. Soc Probl 49(1):11\u201334","journal-title":"Soc Probl"},{"issue":"1","key":"1167_CR33","first-page":"11","volume":"49","author":"MJ Salganik","year":"2004","unstructured":"Salganik MJ, Heckathorn DD (2004) Sampling and estimation in hidden populations using respondent-driven sampling. Sociol Methodol 49(1):11\u201334","journal-title":"Sociol Methodol"},{"issue":"2","key":"1167_CR34","first-page":"377","volume":"17","author":"D Stutzbach","year":"2009","unstructured":"Stutzbach D et al (2009) On unbiased sampling for unstructured peer-to-peer networks. TON 17(2):377\u2013390","journal-title":"TON"},{"key":"1167_CR35","doi-asserted-by":"crossref","unstructured":"Rasti AH et al (2009) Respondent-driven sampling for characterizing unstructured overlays. In: INFOCOM Mini-conference, pp 2701\u20132705","DOI":"10.1109\/INFCOM.2009.5062215"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-018-1167-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-018-1167-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-018-1167-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T08:07:15Z","timestamp":1589443635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-018-1167-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,14]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["1167"],"URL":"https:\/\/doi.org\/10.1007\/s10115-018-1167-0","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2018,2,14]]},"assertion":[{"value":"12 January 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}