{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:13Z","timestamp":1750221313641,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,31]],"date-time":"2017-07-31T00:00:00Z","timestamp":1501459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1447634"],"award-info":[{"award-number":["IIS-1447634"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,31]]},"DOI":"10.1145\/3110025.3110027","type":"proceedings-article","created":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T14:40:22Z","timestamp":1510670422000},"page":"103-108","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Which friends are more popular than you?"],"prefix":"10.1145","author":[{"given":"James P.","family":"Bagrow","sequence":"first","affiliation":[{"name":"Mathematics & Statistics, Vermont Complex Systems Center, University of Vermont, Burlington, VT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher M.","family":"Danforth","sequence":"additional","affiliation":[{"name":"Mathematics & Statistics, Vermont Complex Systems Center, University of Vermont, Burlington, VT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lewis","family":"Mitchell","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, University of Adelaide, Adelaide, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1086\/229693"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00991287"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.2307\/2690083"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1086\/225469"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0140525X00032325"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_2_1_7_1","volume-title":"7th International AAAI Conference On Weblogs And Social Media (ICWSM)","author":"Hodas N. O.","year":"2013","unstructured":"N. O. Hodas, F. Kooti, and K. Lerman, \"Friendship paradox redux: Your friends are more interesting than you,\" in Proc. 7th International AAAI Conference On Weblogs And Social Media (ICWSM), 2013."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1083-6101.2007.00367.x"},{"key":"e_1_3_2_1_9_1","volume-title":"The anatomy of the Facebook social graph,\" arXiv preprint arXiv:1111.4503","author":"Ugander J.","year":"2011","unstructured":"J. Ugander, B. Karrer, L. Backstrom, and C. Marlow, \"The anatomy of the Facebook social graph,\" arXiv preprint arXiv:1111.4503, 2011."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0610245104"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0017680"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1038\/srep03997"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1027\/1614-0001\/a000048"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.2307\/3090112"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom-PASSAT.2012.129"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature06958"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1177170"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0037676"},{"key":"e_1_3_2_1_19_1","volume-title":"Human Behavior and the Principle of Least Effort: An Introduction to Human Ecology","author":"Zipf G. K.","year":"1949","unstructured":"G. K. Zipf, Human Behavior and the Principle of Least Effort: An Introduction to Human Ecology. Addison-Wesley, 1949."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1038\/srep02625"},{"volume-title":"A critical point for random graphs with a given degree sequence,\" Random structures & algorithms","author":"Molloy M.","key":"e_1_3_2_1_21_1","unstructured":"M. Molloy and B. Reed, \"A critical point for random graphs with a given degree sequence,\" Random structures & algorithms, vol. 6, no. 2--3, pp. 161--180, 1995."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548398003526"},{"key":"e_1_3_2_1_23_1","first-page":"11","volume-title":"Exploring network structure, dynamics, and function using NetworkX,\" in Proceedings of the 7th Python in Science Conferences (SciPy","author":"Schult D. A.","year":"2008","unstructured":"D. A. Schult and P. Swart, \"Exploring network structure, dynamics, and function using NetworkX,\" in Proceedings of the 7th Python in Science Conferences (SciPy 2008), vol. 2008, 2008, pp. 11--16."},{"key":"e_1_3_2_1_24_1","volume-title":"Infectious diseases of humans: dynamics and control","author":"Anderson R. M.","year":"1992","unstructured":"R. M. Anderson and R. M. May, Infectious diseases of humans: dynamics and control. Wiley Online Library, 1992, vol. 28."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1038\/srep04603"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0012948"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0092413"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.025102"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.chb.2015.01.024"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.1501158"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0040612"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.91.247901"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0092413"}],"event":{"name":"ASONAM '17: Advances in Social Networks Analysis and Mining 2017","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"],"location":"Sydney Australia","acronym":"ASONAM '17"},"container-title":["Proceedings of the 2017 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining 2017"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3110025.3110027","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3110025.3110027","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3110025.3110027","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:41Z","timestamp":1750212821000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3110025.3110027"}},"subtitle":["Contact strength and the friendship paradox in social networks"],"short-title":[],"issued":{"date-parts":[[2017,7,31]]},"references-count":34,"alternative-id":["10.1145\/3110025.3110027","10.1145\/3110025"],"URL":"https:\/\/doi.org\/10.1145\/3110025.3110027","relation":{},"subject":[],"published":{"date-parts":[[2017,7,31]]},"assertion":[{"value":"2017-07-31","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}