{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T15:40:44Z","timestamp":1775576444068,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,8,21]],"date-time":"2011-08-21T00:00:00Z","timestamp":1313884800000},"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":[[2011,8,21]]},"DOI":"10.1145\/2020408.2020431","type":"proceedings-article","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T15:22:45Z","timestamp":1314804165000},"page":"105-113","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":75,"title":["Benefits of bias"],"prefix":"10.1145","author":[{"given":"Arun S.","family":"Maiya","sequence":"first","affiliation":[{"name":"University of Illinois at Chicago, Chicago, IL, USA"}]},{"given":"Tanya Y.","family":"Berger-Wolf","sequence":"additional","affiliation":[{"name":"University of Illinois at Chicago, Chicago, IL, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,8,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060693"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.046135"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830252.1830253"},{"key":"e_1_3_2_1_4_1","volume-title":"Reconsidering the Foundations of Network Sampling. In WIN '10: Proceedings of the 2nd Workshop on Information in Networks","author":"Ahmed N. K.","year":"2010"},{"issue":"5439","key":"e_1_3_2_1_5_1","first-page":"509","volume":"286","author":"Barabasi A.-L.","year":"1999","journal-title":"Emergence of Scaling in Random Networks. Science"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.056122"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30216-2_14"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1774088.1774314"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00108-1"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0012948"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00012580"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"R. Cohen S. Havlin and D. ben Avraham. Efficient Immunization Strategies for Computer Networks and Populations. arXiv:cond-mat\/0207387v3 Dec. 2003. R. Cohen S. Havlin and D. ben Avraham. Efficient Immunization Strategies for Computer Networks and Populations. arXiv:cond-mat\/0207387v3 Dec. 2003.","DOI":"10.1103\/PhysRevLett.91.247901"},{"key":"e_1_3_2_1_14_1","unstructured":"T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. Introduction to Algorithms. McGraw-Hill Science \/ Engineering \/ Math 2nd edition Dec. 2003. T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. Introduction to Algorithms. McGraw-Hill Science \/ Engineering \/ Math 2nd edition Dec. 2003."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00012-1"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1086\/229693"},{"key":"e_1_3_2_1_18_1","unstructured":"S. Fortunato. Community detection in graphs. arXiv:0906.0612v2 {physics.soc-ph} Jan. 2010. S. Fortunato. Community detection in graphs. arXiv:0906.0612v2 {physics.soc-ph} Jan. 2010."},{"key":"e_1_3_2_1_19_1","volume-title":"Cambridge University Press","author":"Frank O.","year":"2005"},{"key":"e_1_3_2_1_20_1","unstructured":"M. Gjoka M. Kurant C. T. Butts and A. Markopoulou. A Walk in Facebook: Uniform Sampling of Users in Online Social Networks. arXiv e-print (arXiv:0906.0060v3) Feb. 2011. M. Gjoka M. Kurant C. T. Butts and A. Markopoulou. A Walk in Facebook: Uniform Sampling of Users in Online Social Networks. arXiv e-print (arXiv:0906.0060v3) Feb. 2011."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.81.046106"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(00)00055-4"},{"key":"e_1_3_2_1_23_1","first-page":"43","author":"Hoory S.","year":"2006","journal-title":"Expander Graphs and Their Applications. Bull. Amer. Math. Soc"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1777879.1777885"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.124"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/990308.990313"},{"key":"e_1_3_2_1_27_1","volume-title":"Complex Networks and Decentralized Search Algorithms. In International Congress of Mathematicians (ICM)","author":"Kleinberg J.","year":"2006"},{"key":"e_1_3_2_1_28_1","volume-title":"Springer","author":"Kolaczyk E. D.","year":"2009"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2007.06.004"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"M. Kurant A. Markopoulou and P. Thiran. On the bias of BFS. Arxiv e-print (arXiv:1004.1729v1) Apr. 2010. M. Kurant A. Markopoulou and P. Thiran. On the bias of BFS. Arxiv e-print (arXiv:1004.1729v1) Apr. 2010.","DOI":"10.1109\/ITC.2010.5608727"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208685"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.73.016102"},{"key":"e_1_3_2_1_33_1","unstructured":"J. Leskovec. Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data\/. J. Leskovec. Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data\/."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_3_2_1_37_1","unstructured":"L. Lovasz. Random Walks on Graphs: A Survey. Combinatorics: Paul Erdos is 80 || 1994. L. Lovasz. Random Walks on Graphs: A Survey. Combinatorics: Paul Erdos is 80 || 1994."},{"key":"e_1_3_2_1_38_1","unstructured":"L. Lovasz. Very large graphs. arXiv:0902.0132v1 {math.CO} Feb. 2009. L. Lovasz. Very large graphs. arXiv:0902.0132v1 {math.CO} Feb. 2009."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871471"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772762"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.371965"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646063"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0501179102"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.2001730"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.54"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146847.1146872"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"crossref","unstructured":"E. W. Zuckerman and J. T. Jost. What Makes You Think You're so Popular? Self-Evaluation Maintenance and the Subjective Side of the \"Friendship Paradox\". Social Psychology Quarterly 64(3) 2001. E. W. Zuckerman and J. T. Jost. What Makes You Think You're so Popular? Self-Evaluation Maintenance and the Subjective Side of the \"Friendship Paradox\". Social Psychology Quarterly 64(3) 2001.","DOI":"10.2307\/3090112"}],"event":{"name":"KDD '11: The 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"San Diego California USA","acronym":"KDD '11","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2020408.2020431","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2020408.2020431","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:15Z","timestamp":1750240095000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2020408.2020431"}},"subtitle":["towards better characterization of network sampling"],"short-title":[],"issued":{"date-parts":[[2011,8,21]]},"references-count":51,"alternative-id":["10.1145\/2020408.2020431","10.1145\/2020408"],"URL":"https:\/\/doi.org\/10.1145\/2020408.2020431","relation":{},"subject":[],"published":{"date-parts":[[2011,8,21]]},"assertion":[{"value":"2011-08-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}