{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:31:24Z","timestamp":1772119884558,"version":"3.50.1"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030366865","type":"print"},{"value":"9783030366872","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T00:00:00Z","timestamp":1574726400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-36687-2_11","type":"book-chapter","created":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T12:39:57Z","timestamp":1576499997000},"page":"128-140","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Spread Sampling and Its Applications on\u00a0Graphs"],"prefix":"10.1007","author":[{"given":"Yu","family":"Wang","sequence":"first","affiliation":[]},{"given":"Bortik","family":"Bandyopadhyay","sequence":"additional","affiliation":[]},{"given":"Vedang","family":"Patel","sequence":"additional","affiliation":[]},{"given":"Aniket","family":"Chakrabarti","sequence":"additional","affiliation":[]},{"given":"David","family":"Sivakoff","sequence":"additional","affiliation":[]},{"given":"Srinivasan","family":"Parthasarathy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,26]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F., Lang, K.: Local graph partitioning using pagerank vectors. In: FOCS 2006, pp. 475\u2013486 (2006)","DOI":"10.1109\/FOCS.2006.44"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Backstrom, L., Kleinberg, J.: Network bucket testing. In: Proceedings of the 20th International Conference on World Wide Web, pp. 615\u2013624. ACM (2011)","DOI":"10.1145\/1963405.1963492"},{"issue":"10","key":"11_CR3","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.-L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech.: Theory Exp. 2008(10), P10008 (2008)","journal-title":"J. Stat. Mech.: Theory Exp."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Chiericetti, F., Dasgupta, A., Kumar, R., Lattanzi, S., Sarl\u00f3s, T.: On sampling nodes in a network. In: Proceedings of the 25th International Conference on World Wide Web, pp. 471\u2013481. International World Wide Web Conferences Steering Committee (2016)","DOI":"10.1145\/2872427.2883045"},{"issue":"6","key":"11_CR5","first-page":"726","volume":"57","author":"F Chung","year":"2010","unstructured":"Chung, F.: Graph theory in the information age. Not. AMS 57(6), 726\u2013732 (2010)","journal-title":"Not. AMS"},{"key":"11_CR6","unstructured":"Karrer,B., Eckles, D., Ugander, J.: Design and analysis of experiments in networks: reducing bias from interference (2014)"},{"issue":"3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"issue":"12","key":"11_CR8","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"11_CR9","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: 2010 Proceedings IEEE Infocom, pp. 1\u20139. IEEE (2010)","DOI":"10.1109\/INFCOM.2010.5462078"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Gui, H., Xu, Y., Bhasin, A., Han, J.: Network A\/B testing: from sampling to estimation. In: Proceedings of the 24th International Conference on World Wide Web, pp. 399\u2013409. ACM (2015)","DOI":"10.1145\/2736277.2741081"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1111\/j.1751-5823.2010.00109_2.x","volume":"78","author":"DJ Hand","year":"2010","unstructured":"Hand, D.J.: Statistical analysis of network data: methods and models by Eric D. Kolaczyk. Int. Stat. Rev. 78(1), 135\u2013135 (2010)","journal-title":"Int. Stat. Rev."},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1214\/08-AOAS221","volume":"4","author":"MS Handcock","year":"2010","unstructured":"Handcock, M.S., Gile, K.J.: Modeling social networks from sampled data. Ann. Appl. Stat. 4(1), 5 (2010)","journal-title":"Ann. Appl. Stat."},{"issue":"4","key":"11_CR13","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1214\/aoms\/1177731356","volume":"14","author":"MH Hansen","year":"1943","unstructured":"Hansen, M.H., Hurwitz, W.N.: On the theory of sampling from finite populations. Ann. Math. Stat. 14(4), 333\u2013362 (1943)","journal-title":"Ann. Math. Stat."},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Katzir, L., Liberty, E., Somekh, O.: Framework and algorithms for network bucket testing. In: Proceedings of the 21st International Conference on World Wide Web, WWW 2012, pp. 1029\u20131036. ACM, New York (2012)","DOI":"10.1145\/2187836.2187974"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Kloumann, I.M., Kleinberg, J.M.: Community membership identification from small seed sets. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1366\u20131375. ACM (2014)","DOI":"10.1145\/2623330.2623621"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Kohavi, R., Deng, A., Frasca, B., Walker, T., Xu, Y., Pohlmann, N.: Online controlled experiments at large scale. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2013, pp. 1168\u20131176. ACM, New York (2013)","DOI":"10.1145\/2487575.2488217"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Kohavi, R., Deng, A., Longbotham, R., Xu, Y.: Seven rules of thumb for web site experimenters. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2014, pp. 1857\u20131866. ACM, New York (2014)","DOI":"10.1145\/2623330.2623341"},{"issue":"3","key":"11_CR19","first-page":"28","volume":"10","author":"D Koutra","year":"2016","unstructured":"Koutra, D., Shah, N., Vogelstein, J.T., Gallagher, B., Faloutsos, C.: D elta C on: principled massive-graph similarity function with attribution. ACM Trans. Knowl. Discov. Data (TKDD) 10(3), 28 (2016)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Leskovec, J. Faloutsos, C.: Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 631\u2013636. ACM (2006)","DOI":"10.1145\/1150402.1150479"},{"issue":"1","key":"11_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2898361","volume":"8","author":"J Leskovec","year":"2016","unstructured":"Leskovec, J., Sosi\u010d, R.: SNAP: a general-purpose network analysis and graph-mining library. ACM Trans. Intell. Syst. Technol. (TIST) 8(1), 1 (2016)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"key":"11_CR22","volume-title":"Sampling: Design and Analysis","author":"S Lohr","year":"2009","unstructured":"Lohr, S.: Sampling: Design and Analysis. Nelson Education, Toronto (2009)"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Maiya, A.S., Berger-Wolf, T.Y.: Expansion and search in networks. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management, pp. 239\u2013248. ACM (2010)","DOI":"10.1145\/1871437.1871471"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Maiya, A.S., Berger-Wolf, T.Y.: Sampling community structure. In: Proceedings of the 19th International Conference on World Wide Web, pp. 701\u2013710. ACM (2010)","DOI":"10.1145\/1772690.1772762"},{"issue":"1","key":"11_CR25","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1146\/annurev.soc.27.1.415","volume":"27","author":"M McPherson","year":"2001","unstructured":"McPherson, M., Smith-Lovin, L., Cook, J.M.: Birds of a feather: homophily in social networks. Ann. Rev. Sociol. 27(1), 415\u2013444 (2001)","journal-title":"Ann. Rev. Sociol."},{"issue":"6","key":"11_CR26","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21(6), 1087\u20131092 (1953)","journal-title":"J. Chem. Phys."},{"key":"11_CR27","unstructured":"Middleton, J.A., Aronow, P.M.: Unbiased estimation of the average treatment effect in cluster-randomized experiments"},{"key":"11_CR28","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bringing order to the web. Technical report, Stanford InfoLab (1999)"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Ribeiro, B., Towsley, D.: Estimating and sampling graphs with multidimensional random walks. In: Proceedings of the 10th ACM SIGCOMM Conference on Internet Measurement, pp. 390\u2013403. ACM (2010)","DOI":"10.1145\/1879141.1879192"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Ruan, Y., Fuhry, D., Liang, J., Wang, Y., Parthasarathy, S.: Community discovery: simple and scalable approaches. In: User Community Discovery, pp. 23\u201354. Springer (2015)","DOI":"10.1007\/978-3-319-23835-7_2"},{"issue":"5","key":"11_CR31","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1037\/h0037350","volume":"66","author":"DB Rubin","year":"1974","unstructured":"Rubin, D.B.: Estimating causal effects of treatments in randomized and nonrandomized studies. J. Educ. Psychol. 66(5), 688 (1974)","journal-title":"J. Educ. Psychol."},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Saveski, M., Pouget-Abadie, J., Saint-Jacques, G., Duan, W., Ghosh, S., Xu, Y., Airoldi, E.M.: Detecting network effects: randomizing over randomized experiments. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1027\u20131035. ACM (2017)","DOI":"10.1145\/3097983.3098192"},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"Ugander, J., Karrer, B., Backstrom, L., Kleinberg, J.: Graph cluster randomization: network exposure to multiple universes. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2013, pp. 329\u2013337. ACM, New York (2013)","DOI":"10.1145\/2487575.2487695"},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"Wang, D., Li, Z., Xie, G.: Towards unbiased sampling of online social networks. In: 2011 IEEE International Conference on Communications (ICC), pp. 1\u20135. IEEE (2011)","DOI":"10.1109\/icc.2011.5963203"},{"key":"11_CR35","unstructured":"Wang, Y.: Revisiting network sampling. Ph.D. thesis, The Ohio State University (2019)"},{"key":"11_CR36","doi-asserted-by":"crossref","unstructured":"Wang, Y., Chakrabarti, A., Sivakoff, D., Parthasarathy, S.: Fast change point detection on dynamic social networks. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence, pp. 2992\u20132998. AAAI Press (2017)","DOI":"10.24963\/ijcai.2017\/417"},{"key":"11_CR37","doi-asserted-by":"crossref","unstructured":"Wang, Y., Chakrabarti, A., Sivakoff, D., Parthasarathy, S.: Hierarchical change point detection on dynamic networks. In: Proceedings of the 2017 ACM on Web Science Conference, pp. 171\u2013179. ACM (2017)","DOI":"10.1145\/3091478.3091493"},{"key":"11_CR38","doi-asserted-by":"crossref","unstructured":"Whang, J.J., Gleich, D.F., Dhillon, I.S.: Overlapping community detection using seed set expansion. In: CIKM, pp. 2099\u20132108. ACM (2013)","DOI":"10.1145\/2505515.2505535"},{"key":"11_CR39","unstructured":"Yang J., Leskovec, J.: Structure and overlaps of communities in networks. arXiv preprint \narXiv:1205.6228\n\n (2012)"}],"container-title":["Studies in Computational Intelligence","Complex Networks and Their Applications VIII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36687-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T12:41:30Z","timestamp":1576500090000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36687-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,26]]},"ISBN":["9783030366865","9783030366872"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36687-2_11","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"value":"1860-949X","type":"print"},{"value":"1860-9503","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,26]]},"assertion":[{"value":"26 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}