{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:40:38Z","timestamp":1764783638723,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1109\/infocom.2014.6848229","type":"proceedings-article","created":{"date-parts":[[2014,7,29]],"date-time":"2014-07-29T11:18:13Z","timestamp":1406632693000},"page":"2795-2803","source":"Crossref","is-referenced-by-count":27,"title":["A general framework of hybrid graph sampling for complex network analysis"],"prefix":"10.1109","author":[{"given":"Xin","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chul-Ho","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Do Young","family":"Eun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"The PageRank Citation Ranking Bringing Order to the Web","year":"1999","author":"page","key":"19"},{"key":"17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3124-8","author":"bre?maud","year":"1999","journal-title":"Markov Chains Gibbs Fields Monte Carlo Simulation and Queues"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"15","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1214\/154957804100000051","article-title":"On the Markov chain central limit theorem","volume":"1","author":"jones","year":"2004","journal-title":"Probability Surveys"},{"key":"16","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1214\/154957804100000024","article-title":"General state space Markov chains and MCMC algorithms","volume":"1","author":"roberts","year":"2004","journal-title":"Probability Surveys"},{"key":"13","article-title":"Albatross sampling: Robust and effective hybrid vetex sampling for social graphs","author":"jin","year":"2011","journal-title":"ACM HotPlanet"},{"journal-title":"Convex optimization","year":"2010","author":"boyd","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195540"},{"key":"12","article-title":"Improving random walk estimation accuracy with uniform restarts","author":"avrachenkov","year":"2010","journal-title":"WAW"},{"journal-title":"Reversible Markov Chains and Random Walks on Graphs","year":"0","author":"aldous","key":"21"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879191"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-06-01126-8"},{"journal-title":"Advanced Digital Signal Processing and Noise Reduction","year":"2000","author":"vaseghi","key":"24"},{"journal-title":"Stanford Large Network Dataset Collection","year":"0","key":"25"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879192"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848229"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.2478\/s11533-011-0113-0"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970739"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462078"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544873"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963489"},{"key":"7","doi-asserted-by":"crossref","DOI":"10.1145\/2254756.2254795","article-title":"Beyond random walk and metropolishastings samplers: Why you should not backtrack for unbiased graph sampling","author":"lee","year":"2012","journal-title":"ACM SIGMETRICS\/Performance"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111011"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062215"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.2001730"},{"key":"9","article-title":"Output space sampling for graph patterns","author":"hasan","year":"2009","journal-title":"VLDB"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/57.1.97"}],"event":{"name":"IEEE INFOCOM 2014 - IEEE Conference on Computer Communications","start":{"date-parts":[[2014,4,27]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2014,5,2]]}},"container-title":["IEEE INFOCOM 2014 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6839150\/6847911\/06848229.pdf?arnumber=6848229","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T05:02:49Z","timestamp":1565672569000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6848229\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/infocom.2014.6848229","relation":{},"subject":[],"published":{"date-parts":[[2014,4]]}}}