{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:19Z","timestamp":1772164039325,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,11]],"date-time":"2012-06-11T00:00:00Z","timestamp":1339372800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,6,11]]},"DOI":"10.1145\/2254756.2254795","type":"proceedings-article","created":{"date-parts":[[2012,6,11]],"date-time":"2012-06-11T09:03:31Z","timestamp":1339405411000},"page":"319-330","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":53,"title":["Beyond random walk and metropolis-hastings samplers"],"prefix":"10.1145","author":[{"given":"Chul-Ho","family":"Lee","sequence":"first","affiliation":[{"name":"North Carolina State University, Raleigh, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Xu","sequence":"additional","affiliation":[{"name":"North Carolina State University, Raleigh, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Do Young","family":"Eun","sequence":"additional","affiliation":[{"name":"North Carolina State University, Raleigh, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data\/.  Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data\/."},{"key":"e_1_3_2_1_2_1","unstructured":"D. Aldous and J. Fill. Reversible Markov Chains and Random Walks on Graphs. monograph in preparation.  D. Aldous and J. Fill. Reversible Markov Chains and Random Walks on Graphs. monograph in preparation."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0219199707002551"},{"key":"e_1_3_2_1_4_1","volume-title":"Probability and measure theory","author":"Ash R. B.","year":"2000","unstructured":"R. B. Ash and C. A. Doleans-Dade . Probability and measure theory . Academic Press , second edition, 2000 . R. B. Ash and C. A. Doleans-Dade. Probability and measure theory. Academic Press, second edition, 2000."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18009-5_10"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1215\/ijm\/1258059470"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873716"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144503423264"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301315"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1019487508"},{"key":"e_1_3_2_1_11_1","volume-title":"A vanilla Rao-Blackwellization of Metropolis-Hastings algorithms. Annals of Statistics}, 39(1):261--277","author":"Douc R.","year":"2011","unstructured":"R. Douc and C. P. Robert . A vanilla Rao-Blackwellization of Metropolis-Hastings algorithms. Annals of Statistics}, 39(1):261--277 , 2011 . R. Douc and C. P. Robert. A vanilla Rao-Blackwellization of Metropolis-Hastings algorithms. Annals of Statistics}, 39(1):261--277, 2011."},{"key":"e_1_3_2_1_12_1","article-title":"Practical recommendations on crawling online social networks","author":"Gjoka M.","year":"2011","unstructured":"M. Gjoka , M. Kurant , C. T. Butts , and A. Markopoulou . Practical recommendations on crawling online social networks . IEEE JSAC , 2011 . M. Gjoka, M. Kurant, C. T. Butts, and A. Markopoulou. Practical recommendations on crawling online social networks. IEEE JSAC, 2011.","journal-title":"IEEE JSAC"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/sim.3613"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/88.4.1035"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687710"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/57.1.97"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.10.020"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1214\/154957804100000051"},{"key":"e_1_3_2_1_19_1","volume-title":"Fast gossip via nonreversible random walk","author":"Jung K.","year":"2006","unstructured":"K. Jung and D. Shah . Fast gossip via nonreversible random walk . In IEEE ITW , 2006 . K. Jung and D. Shah. Fast gossip via nonreversible random walk. In IEEE ITW, 2006."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993744.1993773"},{"key":"e_1_3_2_1_21_1","volume-title":"Dept. of ECE","author":"Lee C.-H.","year":"2012","unstructured":"C.-H. Lee , X. Xu , and D. Y. Eun . Beyond random walk and Metropolis-Hastings samplers: Why you should not backtrack for unbiased graph sampling. Technical report , Dept. of ECE , North Carolina State University , April 2012 . C.-H. Lee, X. Xu, and D. Y. Eun. Beyond random walk and Metropolis-Hastings samplers: Why you should not backtrack for unbiased graph sampling. Technical report, Dept. of ECE, North Carolina State University, April 2012."},{"key":"e_1_3_2_1_22_1","volume-title":"Markov chains and mixing times","author":"Levin D. A.","year":"2009","unstructured":"D. A. Levin , Y. Peres , and E. L. Wilmer . Markov chains and mixing times . American Mathematical Society , 2009 . D. A. Levin, Y. Peres, and E. L. Wilmer. Markov chains and mixing times. American Mathematical Society, 2009."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557655"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jspi.2007.05.030"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","DOI":"10.2172\/4390578","volume-title":"Equation of state calculations by fast computing machines. Journal of Chemical Physics}, 21(6):1087--1092","author":"Metropolis N.","year":"1953","unstructured":"N. Metropolis , A. W. Rosenbluth , M. N. Rosenbluth , A. H. Teller , and E. Teller . Equation of state calculations by fast computing machines. Journal of Chemical Physics}, 21(6):1087--1092 , 1953 . N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller. Equation of state calculations by fast computing machines. Journal of Chemical Physics}, 21(6):1087--1092, 1953."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1015346319"},{"key":"e_1_3_2_1_27_1","volume-title":"No. 0406, Dept. of Statistics","author":"Neal R. M.","year":"2004","unstructured":"R. M. Neal . Improving asymptotic variance of MCMC estimators: non-reversible chains are better. Technical report , No. 0406, Dept. of Statistics , University of Toronto , July 2004 . R. M. Neal. Improving asymptotic variance of MCMC estimators: non-reversible chains are better. Technical report, No. 0406, Dept. of Statistics, University of Toronto, July 2004."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/60.3.607"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062215"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879192"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1214\/154957804100000024"},{"key":"e_1_3_2_1_32_1","volume-title":"Stochastic processes","author":"Ross S. M.","year":"1996","unstructured":"S. M. Ross . Stochastic processes . John Wiley & Son , second edition, 1996 . S. M. Ross. Stochastic processes. John Wiley & Son, second edition, 1996."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.0081-1750.2004.00152.x"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.2001730"},{"key":"e_1_3_2_1_35_1","volume-title":"An extension of the metropolis algorithm. Communications in Statistics -- Theory and Methods, 34(3):585--596","author":"Wu S. S.","year":"2005","unstructured":"S. S. Wu and M. T. Wells . An extension of the metropolis algorithm. Communications in Statistics -- Theory and Methods, 34(3):585--596 , 2005 . S. S. Wu and M. T. Wells. An extension of the metropolis algorithm. Communications in Statistics -- Theory and Methods, 34(3):585--596, 2005."}],"event":{"name":"SIGMETRICS '12: ACM SIGMETRICS\/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems","location":"London England, UK","acronym":"SIGMETRICS '12","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation","IFIP International Federation for Information Processing"]},"container-title":["Proceedings of the 12th ACM SIGMETRICS\/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2254756.2254795","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2254756.2254795","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:20:50Z","timestamp":1750224050000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2254756.2254795"}},"subtitle":["why you should not backtrack for unbiased graph sampling"],"short-title":[],"issued":{"date-parts":[[2012,6,11]]},"references-count":35,"alternative-id":["10.1145\/2254756.2254795","10.1145\/2254756"],"URL":"https:\/\/doi.org\/10.1145\/2254756.2254795","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2318857.2254795","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2012,6,11]]},"assertion":[{"value":"2012-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}