{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:12Z","timestamp":1763467992315,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,11,1]],"date-time":"2010-11-01T00:00:00Z","timestamp":1288569600000},"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":[[2010,11]]},"DOI":"10.1145\/1879141.1879191","type":"proceedings-article","created":{"date-parts":[[2010,11,9]],"date-time":"2010-11-09T15:01:31Z","timestamp":1289314891000},"page":"383-389","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":120,"title":["Measuring the mixing time of social graphs"],"prefix":"10.1145","author":[{"given":"Abedelaziz","family":"Mohaisen","sequence":"first","affiliation":[{"name":"University of Minnesota, Minneapolis, MN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aaram","family":"Yun","sequence":"additional","affiliation":[{"name":"University of Minnesota, Minneapolis, MN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongdae","family":"Kim","sequence":"additional","affiliation":[{"name":"University of Minnesota, Minneapolis, MN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526784"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1288107.1288113"},{"key":"e_1_3_2_1_3_1","volume-title":"The 16th Annual Network & Distributed System Security Conference","author":"Danezis G.","year":"2009","unstructured":"G. Danezis and P. Mittal . SybilInfer: Detecting sybil nodes using social networks . In The 16th Annual Network & Distributed System Security Conference , 2009 . G. Danezis and P. Mittal. SybilInfer: Detecting sybil nodes using social networks. In The 16th Annual Network & Distributed System Security Conference, 2009."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/646334.687813"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of AMCIS","author":"Dwyer C.","year":"2007","unstructured":"C. Dwyer , S. Hiltz , and K. Passerini . Trust and privacy concern within social networking sites: A comparison of Facebook and MySpace . In Proceedings of AMCIS , 2007 . C. Dwyer, S. Hiltz, and K. Passerini. Trust and privacy concern within social networking sites: A comparison of Facebook and MySpace. In Proceedings of AMCIS, 2007."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62234"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/245108.245123"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772756"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_1_10_1","volume-title":"Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. CoRR,abs\/0810.1355","author":"Leskovec J.","year":"2008","unstructured":"J. Leskovec , K. J. Lang , A. Dasgupta , and M. W. Mahoney . Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. CoRR,abs\/0810.1355 , 2008 . J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. CoRR,abs\/0810.1355, 2008."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1435497.1435501"},{"key":"e_1_3_2_1_12_1","first-page":"3","volume-title":"7th USENIX Symposium on Network Design and Implementation","author":"Lesniewski-Lass C.","year":"2010","unstructured":"C. Lesniewski-Lass and M. F. Kaashoek . Whanau: A sybil-proof distributed hash table . In 7th USENIX Symposium on Network Design and Implementation , pages 3 -- 17 , 2010 . C. Lesniewski-Lass and M. F. Kaashoek. Whanau: A sybil-proof distributed hash table. In 7th USENIX Symposium on Network Design and Implementation, pages 3--17, 2010."},{"key":"e_1_3_2_1_13_1","first-page":"481","volume-title":"String Processing and Information Retrieval","author":"Ley M.","year":"2009","unstructured":"M. Ley . The DBLP computer science bibliography: Evolution, research issues, perspectives . In String Processing and Information Retrieval , pages 481 -- 486 . Springer , 2009 . M. Ley. The DBLP computer science bibliography: Evolution, research issues, perspectives. In String Processing and Information Retrieval, pages 481--486. Springer, 2009."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866407"},{"key":"e_1_3_2_1_16_1","volume-title":"Keep your friends close: Incorporating trust in social network-based Sybil defenses. Technical report","author":"Mohaisen A.","year":"2010","unstructured":"A. Mohaisen , N. Hopper , and Y. Kim . Keep your friends close: Incorporating trust in social network-based Sybil defenses. Technical report , University of Minnesota , 2010 . A. Mohaisen, N. Hopper, and Y. Kim. Keep your friends close: Incorporating trust in social network-based Sybil defenses. Technical report, University of Minnesota, 2010."},{"key":"e_1_3_2_1_17_1","volume-title":"Measuring the mixing time of social graphs. Technical report","author":"Mohaisen A.","year":"2010","unstructured":"A. Mohaisen , A. Yun , and Y. Kim . Measuring the mixing time of social graphs. Technical report , University of Minnesota , 2010 . A. Mohaisen, A. Yun, and Y. Kim. Measuring the mixing time of social graphs. Technical report, University of Minnesota, 2010."},{"key":"e_1_3_2_1_18_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/978-3-540-75551-7_16","volume-title":"Privacy Enhancing Technologies","author":"Nagaraja S.","year":"2007","unstructured":"S. Nagaraja . Anonymity in the wild: Mixes on unstructured networks . In N. Borisov and P. Golle, editors, Privacy Enhancing Technologies , volume 4776 of Lecture Notes in Computer Science , pages 254 -- 271 . Springer , 2007 . S. Nagaraja. Anonymity in the wild: Mixes on unstructured networks. In N. Borisov and P. Golle, editors, Privacy Enhancing Technologies, volume 4776 of Lecture Notes in Computer Science, pages 254--271. Springer, 2007."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1833515.1833583"},{"key":"e_1_3_2_1_20_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/978-3-540-39718-2_23","volume-title":"International Semantic Web Conference","author":"Richardson M.","year":"2003","unstructured":"M. Richardson , R. Agrawal , and P. Domingos . Trust management for the semantic web . In D. Fensel, K. P. Sycara, and J. Mylopoulos, editors, International Semantic Web Conference , volume 2870 of Lecture Notes in Computer Science , pages 351 -- 368 . Springer , 2003 . M. Richardson, R. Agrawal, and P. Domingos. Trust management for the semantic web. In D. Fensel, K. P. Sycara, and J. Mylopoulos, editors, International Semantic Web Conference, volume 2870 of Lecture Notes in Computer Science, pages 351--368. Springer, 2003."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300000390"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835755"},{"key":"e_1_3_2_1_23_1","volume-title":"USENIX NSDI","author":"Tran N.","year":"2009","unstructured":"N. Tran , B. Min , J. Li , and L. Subramanian . Sybil-resilient online content voting . In USENIX NSDI , 2009 . N. Tran, B. Min, J. Li, and L. Subramanian. Sybil-resilient online content voting. In USENIX NSDI, 2009."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653709"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592665.1592675"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851226"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1519065.1519089"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1368310.1368358"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.13"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159945"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.923723"}],"event":{"name":"IMC '10: Internet Measurement Conference","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation","SIGCOMM ACM Special Interest Group on Data Communication","USENIX Assoc USENIX Assoc"],"location":"Melbourne Australia","acronym":"IMC '10"},"container-title":["Proceedings of the 10th ACM SIGCOMM conference on Internet measurement"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1879141.1879191","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1879141.1879191","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:40Z","timestamp":1750249060000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1879141.1879191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11]]},"references-count":31,"alternative-id":["10.1145\/1879141.1879191","10.1145\/1879141"],"URL":"https:\/\/doi.org\/10.1145\/1879141.1879191","relation":{},"subject":[],"published":{"date-parts":[[2010,11]]},"assertion":[{"value":"2010-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}