{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:31:04Z","timestamp":1760596264716},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2015,2]]},"abstract":"<jats:p>In this paper, we introduce a novel, general purpose, technique for faster sampling of nodes over an online social network. Specifically, unlike traditional random walks which wait for the convergence of sampling distribution to a predetermined target distribution - a waiting process that incurs a high query cost - we develop WALK-ESTIMATE, which starts with a much shorter random walk, and then proactively estimate the sampling probability for the node taken before using acceptance-rejection sampling to adjust the sampling probability to the predetermined target distribution. We present a novel backward random walk technique which provides provably unbiased estimations for the sampling probability, and demonstrate the superiority of WALK-ESTIMATE over traditional random walks through theoretical analysis and extensive experiments over real world online social networks.<\/jats:p>","DOI":"10.14778\/2735703.2735707","type":"journal-article","created":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T15:37:52Z","timestamp":1431445072000},"page":"678-689","source":"Crossref","is-referenced-by-count":23,"title":["Walk, not wait"],"prefix":"10.14778","volume":"8","author":[{"given":"Azade","family":"Nazi","sequence":"first","affiliation":[{"name":"University of Texas at Arlington"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuojie","family":"Zhou","sequence":"additional","affiliation":[{"name":"George Washington University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saravanan","family":"Thirumuruganathan","sequence":"additional","affiliation":[{"name":"University of Texas at Arlington"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nan","family":"Zhang","sequence":"additional","affiliation":[{"name":"George Washington University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gautam","family":"Das","sequence":"additional","affiliation":[{"name":"University of Texas at Arlington"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,2]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1117454.1117457"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378557"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2380718.2380723"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-004-0002-2"},{"key":"e_1_2_1_6_1","first-page":"90","author":"Cohen R.","year":"2003","unstructured":"R. Cohen and S. Havlin . Scale-Free Networks Are Ultrasmall. Phys. Rev. Lett. , 90 , 2003 . R. Cohen and S. Havlin. Scale-Free Networks Are Ultrasmall. Phys. Rev. Lett., 90, 2003.","journal-title":"Scale-Free Networks Are Ultrasmall. Phys. Rev. Lett."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1996.10476956"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247550"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1177011137"},{"key":"e_1_2_1_10_1","volume-title":"Markov Chain Monte Carlo In Practice","author":"Gilks W. R.","year":"1999","unstructured":"W. R. Gilks . Markov Chain Monte Carlo In Practice . Chapman and Hall\/CRC , 1999 . W. R. Gilks. Markov Chain Monte Carlo In Practice. Chapman and Hall\/CRC, 1999."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1833515.1833840"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62234"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2000172.2000178"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335325"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993744.1993773"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254756.2254795"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1090\/mbk\/058"},{"key":"e_1_2_1_21_1","volume-title":"Paul Erdos is Eighty, 2(1):1--46","author":"Lov\u00e1sz L.","year":"1993","unstructured":"L. Lov\u00e1sz . Random walks on graphs: A survey. Combinatorics , Paul Erdos is Eighty, 2(1):1--46 , 1993 . L. Lov\u00e1sz. Random walks on graphs: A survey. Combinatorics, Paul Erdos is Eighty, 2(1):1--46, 1993."},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511626630","volume-title":"Markov Chains and Stochastic Stability","author":"Meyn S.","year":"2009","unstructured":"S. Meyn and R. L. Tweedie . Markov Chains and Stochastic Stability . Cambridge University Press , 2 nd edition, 2009 . S. Meyn and R. L. Tweedie. Markov Chains and Stochastic Stability. Cambridge University Press, 2nd edition, 2009.","edition":"2"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879191"},{"key":"e_1_2_1_25_1","volume-title":"Walk, not wait: Faster sampling over online social networks. CoRR, abs\/1410.7833","author":"Nazi A.","year":"2014","unstructured":"A. Nazi , Z. Zhou , S. Thirumuruganathan , N. Zhang , and G. Das . Walk, not wait: Faster sampling over online social networks. CoRR, abs\/1410.7833 , 2014 . A. Nazi, Z. Zhou, S. Thirumuruganathan, N. Zhang, and G. Das. Walk, not wait: Faster sampling over online social networks. CoRR, abs\/1410.7833, 2014."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879192"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195540"},{"key":"e_1_2_1_28_1","volume-title":"MIT","author":"Shyu E.","year":"2013","unstructured":"E. Shyu . Diameter bounds and eigenvalues. Technical report , MIT , 2013 . E. Shyu. Diameter bounds and eigenvalues. Technical report, MIT, 2013."},{"key":"e_1_2_1_29_1","volume-title":"Proc. of the VLDB Endowment (VLDB)","author":"Zhang N.","year":"2011","unstructured":"N. Zhang and G. Das . Exploration of deep web repositories . In Proc. of the VLDB Endowment (VLDB) , Tutorial , 2011 . N. Zhang and G. Das. Exploration of deep web repositories. In Proc. of the VLDB Endowment (VLDB), Tutorial, 2011."},{"key":"e_1_2_1_30_1","volume-title":"ICDE","author":"Zhou Z.","year":"2013","unstructured":"Z. Zhou , N. Zhang , Z. Gong , and G. Das . Faster random walks by rewiring online social networks on-the-fly . ICDE , 2013 . Z. Zhou, N. Zhang, Z. Gong, and G. Das. Faster random walks by rewiring online social networks on-the-fly. ICDE, 2013."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2735703.2735707","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:32:59Z","timestamp":1672223579000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2735703.2735707"}},"subtitle":["faster sampling over online social networks"],"short-title":[],"issued":{"date-parts":[[2015,2]]},"references-count":29,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["10.14778\/2735703.2735707"],"URL":"https:\/\/doi.org\/10.14778\/2735703.2735707","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2015,2]]}}}