{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:58:47Z","timestamp":1760597927601,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":62,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,1,20]],"date-time":"2020-01-20T00:00:00Z","timestamp":1579478400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1617577,DMS-1830274"],"award-info":[{"award-number":["CCF-1617577,DMS-1830274"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF19-1-0057,MURI"],"award-info":[{"award-number":["W911NF19-1-0057,MURI"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008536","name":"Amazon Web Services","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100008536","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,1,20]]},"DOI":"10.1145\/3336191.3371823","type":"proceedings-article","created":{"date-parts":[[2020,1,22]],"date-time":"2020-01-22T19:08:16Z","timestamp":1579720096000},"page":"295-303","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Retrieving Top Weighted Triangles in Graphs"],"prefix":"10.1145","author":[{"given":"Raunak","family":"Kumar","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"given":"Paul","family":"Liu","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"given":"Moses","family":"Charikar","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"given":"Austin R.","family":"Benson","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2020,1,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Nesreen K. Ahmed Nick Duffield Jennifer Neville and Ramana Kompella. 2014. Graph sample and hold: a framework for big-graph analytics. In KDD .  Nesreen K. Ahmed Nick Duffield Jennifer Neville and Ramana Kompella. 2014. Graph sample and hold: a framework for big-graph analytics. In KDD .","DOI":"10.1145\/2623330.2623757"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523189"},{"key":"e_1_3_2_1_3_1","volume-title":"Marathe","author":"Arifuzzaman Shaikh","year":"2013","unstructured":"Shaikh Arifuzzaman , Maleq Khan , and Madhav V . Marathe . 2013 . PATRIC: a parallel algorithm for counting triangles in massive networks. In ICDM . 529--538. Shaikh Arifuzzaman, Maleq Khan, and Madhav V. Marathe. 2013. PATRIC: a parallel algorithm for counting triangles in massive networks. In ICDM . 529--538."},{"key":"e_1_3_2_1_4_1","volume-title":"Workshop on Large-scale Data Mining: Theory and Applications .","author":"Avron Haim","year":"2010","unstructured":"Haim Avron . 2010 . Counting triangles in large graphs using randomized matrix trace estimation . In Workshop on Large-scale Data Mining: Theory and Applications . Haim Avron. 2010. Counting triangles in large graphs using randomized matrix trace estimation. In Workshop on Large-scale Data Mining: Theory and Applications ."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0400087101"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1800683115"},{"key":"e_1_3_2_1_7_1","volume-title":"Science","volume":"353","author":"Benson Austin R.","year":"2016","unstructured":"Austin R. Benson , David F. Gleich , and Jure Leskovec . 2016 . Higher-order organization of complex networks . Science , Vol. 353 , 6295 (2016), 163--166. Austin R. Benson, David F. Gleich, and Jure Leskovec. 2016. Higher-order organization of complex networks. Science , Vol. 353, 6295 (2016), 163--166."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2015.1037030"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.056119"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018732"},{"key":"e_1_3_2_1_12_1","volume-title":"Secondhand brokerage: Evidence on the importance of local structure for managers, bankers, and analysts. AMJ","author":"Burt Ronald S","year":"2007","unstructured":"Ronald S Burt . 2007. Secondhand brokerage: Evidence on the importance of local structure for managers, bankers, and analysts. AMJ ( 2007 ). Ronald S Burt. 2007. Secondhand brokerage: Evidence on the importance of local structure for managers, bankers, and analysts. AMJ (2007)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Shumo Chu and James Cheng. 2011. Triangle listing in massive networks and its applications. In KDD. 672--680.  Shumo Chu and James Cheng. 2011. Triangle listing in massive networks and its applications. In KDD. 672--680.","DOI":"10.1145\/2020408.2020513"},{"key":"e_1_3_2_1_15_1","volume-title":"Testing multitheoretical, multilevel hypotheses about organizational networks: An analytic framework and empirical example","author":"Contractor Noshir S","year":"2006","unstructured":"Noshir S Contractor , Stanley Wasserman , and Katherine Faust . 2006. Testing multitheoretical, multilevel hypotheses about organizational networks: An analytic framework and empirical example . Academy of Management Review ( 2006 ). Noshir S Contractor, Stanley Wasserman, and Katherine Faust. 2006. Testing multitheoretical, multilevel hypotheses about organizational networks: An analytic framework and empirical example. Academy of Management Review (2006)."},{"key":"e_1_3_2_1_16_1","volume-title":"Oana Denisa Balalau, and Mauro Sozio","author":"Danisch Maximilien","year":"2018","unstructured":"Maximilien Danisch , Oana Denisa Balalau, and Mauro Sozio . 2018 . Listing k-cliques in Sparse Real-World Graphs. In WWW. 589--598. Maximilien Danisch, Oana Denisa Balalau, and Mauro Sozio. 2018. Listing k-cliques in Sparse Real-World Graphs. In WWW. 589--598."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Nurcan Durak Ali Pinar Tamara G Kolda and C Seshadhri. 2012. Degree relations of triangles in real-world networks and graph models. In CIKM . 1712--1716.  Nurcan Durak Ali Pinar Tamara G Kolda and C Seshadhri. 2012. Degree relations of triangles in real-world networks and graph models. In CIKM . 1712--1716.","DOI":"10.1145\/2396761.2398503"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1054389"},{"key":"e_1_3_2_1_19_1","volume-title":"Tsin","author":"Etemadi Roohollah","year":"2016","unstructured":"Roohollah Etemadi , Jianguo Lu , and Yung H . Tsin . 2016 . Efficient Estimation of Triangles in Very Large Graphs. In CIKM. 1251--1260. Roohollah Etemadi, Jianguo Lu, and Yung H. Tsin. 2016. Efficient Estimation of Triangles in Very Large Graphs. In CIKM. 1251--1260."},{"key":"e_1_3_2_1_20_1","series-title":"SIAM Rev. (2018)","volume-title":"Configuring Random Graph Models with Fixed Degree Sequences","author":"Fosdick Bailey K.","unstructured":"Bailey K. Fosdick , Daniel B. Larremore , Joel Nishimura , and Johan Ugander . 2018. Configuring Random Graph Models with Fixed Degree Sequences . SIAM Rev. (2018) . Bailey K. Fosdick, Daniel B. Larremore, Joel Nishimura, and Johan Ugander. 2018. Configuring Random Graph Models with Fixed Degree Sequences. SIAM Rev. (2018)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"David F Gleich and C Seshadhri. 2012. Vertex neighborhoods low conductance cuts and good seeds for local community methods. In KDD . 597--605.  David F Gleich and C Seshadhri. 2012. Vertex neighborhoods low conductance cuts and good seeds for local community methods. In KDD . 597--605.","DOI":"10.1145\/2339530.2339628"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1226"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Keith Henderson Brian Gallagher Tina Eliassi-Rad Hanghang Tong Sugato Basu Leman Akoglu Danai Koutra Christos Faloutsos and Lei Li. 2012. RolX: structural role extraction & mining in large graphs. In KDD .  Keith Henderson Brian Gallagher Tina Eliassi-Rad Hanghang Tong Sugato Basu Leman Akoglu Danai Koutra Christos Faloutsos and Lei Li. 2012. RolX: structural role extraction & mining in large graphs. In KDD .","DOI":"10.2172\/1111134"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Jack Hessel Chenhao Tan and Lillian Lee. 2016. Science AskScience and BadScience: On the Coexistence of Highly Related Communities. In ICWSM. 171--180.  Jack Hessel Chenhao Tan and Lillian Lee. 2016. Science AskScience and BadScience: On the Coexistence of Highly Related Communities. In ICWSM. 171--180.","DOI":"10.1609\/icwsm.v10i1.14739"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Shweta Jain and C. Seshadhri. 2017. A Fast and Provable Method for Estimating Clique Counts Using Tur\u00e1 n's Theorem. In WWW . 441--449.  Shweta Jain and C. Seshadhri. 2017. A Fast and Provable Method for Estimating Clique Counts Using Tur\u00e1 n's Theorem. In WWW . 441--449.","DOI":"10.1145\/3038912.3052636"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741101"},{"key":"e_1_3_2_1_27_1","volume-title":"Benson","author":"Jia Junteng","year":"2019","unstructured":"Junteng Jia , Michael T. Schaub , Santiago Segarra , and Austin R . Benson . 2019 . Graph-based Semi-Supervised & Active Learning for Edge Flows. In KDD . Junteng Jia, Michael T. Schaub, Santiago Segarra, and Austin R. Benson. 2019. Graph-based Semi-Supervised & Active Learning for Edge Flows. In KDD ."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2012.625260"},{"key":"e_1_3_2_1_29_1","volume-title":"Retrieving Top Weighted Triangles in Graphs. arXiv:1910.00692","author":"Kumar Raunak","year":"2019","unstructured":"Raunak Kumar , Paul Liu , Moses Charikar , and Austin R Benson . 2019. Retrieving Top Weighted Triangles in Graphs. arXiv:1910.00692 ( 2019 ). Raunak Kumar, Paul Liu, Moses Charikar, and Austin R Benson. 2019. Retrieving Top Weighted Triangles in Graphs. arXiv:1910.00692 (2019)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.07.017"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1287\/orsc.1050.0173"},{"key":"e_1_3_2_1_32_1","volume-title":"Austin R. Benson, and Moses Charikar","author":"Liu Paul","year":"2019","unstructured":"Paul Liu , Austin R. Benson, and Moses Charikar . 2019 . Sampling Methods for Counting Temporal Motifs. In WSDM. 294--302. Paul Liu, Austin R. Benson, and Moses Charikar. 2019. Sampling Methods for Counting Temporal Motifs. In WSDM. 294--302."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Priya Mahadevan Calvin Hubble Dmitri Krioukov Bradley Huffaker and Amin Vahdat. 2007. Orbis: rescaling degree correlations to generate annotated internet topologies. In ACM SIGCOMM Computer Communication Review .  Priya Mahadevan Calvin Hubble Dmitri Krioukov Bradley Huffaker and Amin Vahdat. 2007. Orbis: rescaling degree correlations to generate annotated internet topologies. In ACM SIGCOMM Computer Communication Review .","DOI":"10.1145\/1282380.1282417"},{"key":"e_1_3_2_1_34_1","volume-title":"Superfamilies of Evolved and Designed Networks. Science","author":"Milo Ron","year":"2004","unstructured":"Ron Milo , Shalev Itzkovitz , Nadav Kashtan , Reuven Levitt , Shai Shen-Orr , Inbal Ayzenshtat , Michal Sheffer , and Uri Alon . 2004. Superfamilies of Evolved and Designed Networks. Science ( 2004 ). Ron Milo, Shalev Itzkovitz, Nadav Kashtan, Reuven Levitt, Shai Shen-Orr, Inbal Ayzenshtat, Michal Sheffer, and Uri Alon. 2004. Superfamilies of Evolved and Designed Networks. Science (2004)."},{"key":"e_1_3_2_1_35_1","volume-title":"Science","volume":"298","author":"Milo Ron","year":"2002","unstructured":"Ron Milo , Shai Shen-Orr , Shalev Itzkovitz , Nadav Kashtan , Dmitri Chklovskii , and Uri Alon . 2002 . Network motifs: simple building blocks of complex networks . Science , Vol. 298 , 5594 (2002), 824--827. Ron Milo, Shai Shen-Orr, Shalev Itzkovitz, Nadav Kashtan, Dmitri Chklovskii, and Uri Alon. 2002. Network motifs: simple building blocks of complex networks. Science , Vol. 298, 5594 (2002), 824--827."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Jukka-Pekka Onnela Jari Saram\"aki J\u00e1nos Kert\u00e9sz and Kimmo Kaski. 2005 a. Characterizing Motifs in Weighted Complex Networks. In AIP.  Jukka-Pekka Onnela Jari Saram\"aki J\u00e1nos Kert\u00e9sz and Kimmo Kaski. 2005 a. Characterizing Motifs in Weighted Complex Networks. In AIP.","DOI":"10.1103\/PhysRevE.71.065103"},{"key":"e_1_3_2_1_37_1","volume-title":"2005 b. Intensity and coherence of motifs in weighted complex networks. PRE","author":"Onnela Jukka-Pekka","year":"2005","unstructured":"Jukka-Pekka Onnela , Jari Saram\"aki, J\u00e1nos Kert\u00e9sz , and Kimmo Kaski . 2005 b. Intensity and coherence of motifs in weighted complex networks. PRE ( 2005 ). Jukka-Pekka Onnela, Jari Saram\"aki, J\u00e1nos Kert\u00e9sz, and Kimmo Kaski. 2005 b. Intensity and coherence of motifs in weighted complex networks. PRE (2005)."},{"key":"e_1_3_2_1_38_1","volume-title":"Clustering in weighted networks. Social networks","author":"Opsahl Tore","year":"2009","unstructured":"Tore Opsahl and Pietro Panzarasa . 2009. Clustering in weighted networks. Social networks , Vol. 31 , 2 ( 2009 ), 155--163. Tore Opsahl and Pietro Panzarasa. 2009. Clustering in weighted networks. Social networks , Vol. 31, 2 (2009), 155--163."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.12.007"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl301"},{"volume-title":"Approximate triangle counting algorithms on multi-cores","author":"Rahman Mahmudur","key":"e_1_3_2_1_41_1","unstructured":"Mahmudur Rahman and Mohammad Al Hasan . 2013. Approximate triangle counting algorithms on multi-cores . In IEEE Big Data . 127--133. Mahmudur Rahman and Mohammad Al Hasan. 2013. Approximate triangle counting algorithms on multi-cores. In IEEE Big Data . 127--133."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Mahmudur Rahman and Mohammad Al Hasan. 2014. Sampling Triples from Restricted Networks using MCMC Strategy. In CIKM . 1519--1528.  Mahmudur Rahman and Mohammad Al Hasan. 2014. Sampling Triples from Restricted Networks using MCMC Strategy. In CIKM . 1519--1528.","DOI":"10.1145\/2661829.2662075"},{"key":"e_1_3_2_1_43_1","first-page":"2","article-title":"An introduction to exponential random graph $p^ast$ models for social networks","volume":"29","author":"Robins Garry","year":"2007","unstructured":"Garry Robins , Pip Pattison , Yuval Kalish , and Dean Lusher . 2007 . An introduction to exponential random graph $p^ast$ models for social networks . Social Networks , Vol. 29 , 2 (May 2007), 173--191. Garry Robins, Pip Pattison, Yuval Kalish, and Dean Lusher. 2007. An introduction to exponential random graph $p^ast$ models for social networks. Social Networks , Vol. 29, 2 (May 2007), 173--191.","journal-title":"Social Networks"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Pablo Robles Sebastian Moreno and Jennifer Neville. 2016. Sampling of attributed networks from hierarchical generative models. In KDD . 1155--1164.  Pablo Robles Sebastian Moreno and Jennifer Neville. 2016. Sampling of attributed networks from hierarchical generative models. In KDD . 1155--1164.","DOI":"10.1145\/2939672.2939808"},{"key":"e_1_3_2_1_45_1","volume-title":"The blessing of transitivity in sparse and stochastic networks. arXiv","author":"Rohe Karl","year":"2013","unstructured":"Karl Rohe and Tai Qin . 2013. The blessing of transitivity in sparse and stochastic networks. arXiv ( 2013 ). Karl Rohe and Tai Qin. 2013. The blessing of transitivity in sparse and stochastic networks. arXiv (2013)."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2349913"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00108"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11224"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"crossref","unstructured":"Arnab Sinha Zhihong Shen Yang Song Hao Ma Darrin Eide Bo-June (Paul) Hsu and Kuansan Wang. 2015. An Overview of Microsoft Academic Service (MAS) and Applications. In WWW textquotesingle15 Companion .  Arnab Sinha Zhihong Shen Yang Song Hao Ma Darrin Eide Bo-June (Paul) Hsu and Kuansan Wang. 2015. An Overview of Microsoft Academic Service (MAS) and Applications. In WWW textquotesingle15 Companion .","DOI":"10.1145\/2740908.2742839"},{"key":"e_1_3_2_1_50_1","unstructured":"Hossein Azari Soufiani and Edo Airoldi. 2012. Graphlet decomposition of a weighted network. In AISTATS. 54--63.  Hossein Azari Soufiani and Edo Airoldi. 2012. Graphlet decomposition of a weighted network. In AISTATS. 54--63."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3059194"},{"key":"e_1_3_2_1_52_1","volume-title":"Tiered sampling: An efficient method for approximate counting sparse motifs in massive graph streams","author":"Stefani Lorenzo De","year":"2017","unstructured":"Lorenzo De Stefani , Erisa Terolli , and Eli Upfal . 2017b. Tiered sampling: An efficient method for approximate counting sparse motifs in massive graph streams . In IEEE BigData 2017 . 776--786. Lorenzo De Stefani, Erisa Terolli, and Eli Upfal. 2017b. Tiered sampling: An efficient method for approximate counting sparse motifs in massive graph streams. In IEEE BigData 2017. 776--786."},{"key":"e_1_3_2_1_53_1","unstructured":"Siddharth Suri and Sergei Vassilvitskii. 2011. Counting triangles and the curse of the last reducer. In WWW. 607--614.  Siddharth Suri and Sergei Vassilvitskii. 2011. Counting triangles and the curse of the last reducer. In WWW. 607--614."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"crossref","unstructured":"Jie Tang Jing Zhang Limin Yao Juanzi Li Li Zhang and Zhong Su. 2008. ArnetMiner. In KDD .  Jie Tang Jing Zhang Limin Yao Juanzi Li Li Zhang and Zhong Su. 2008. ArnetMiner. In KDD .","DOI":"10.1145\/1401890.1402008"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Charalampos E. Tsourakakis. 2008. Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws. In ICDM . 608--617.  Charalampos E. Tsourakakis. 2008. Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws. In ICDM . 608--617.","DOI":"10.1109\/ICDM.2008.72"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"crossref","unstructured":"Charalampos E Tsourakakis U Kang Gary L Miller and Christos Faloutsos. 2009. Doulion: counting triangles in massive graphs with a coin. In KDD .  Charalampos E Tsourakakis U Kang Gary L Miller and Christos Faloutsos. 2009. Doulion: counting triangles in massive graphs with a coin. In KDD .","DOI":"10.1145\/1557019.1557111"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00245"},{"volume-title":"ICDM","author":"Ata Turk Duru T\u00fc","key":"e_1_3_2_1_58_1","unstructured":"Duru T\u00fc rkoglu and Ata Turk . 2017. Edge-Based Wedge Sampling to Estimate Triangle Counts in Very Large Graphs . In ICDM . IEEE , 455--464. Duru T\u00fc rkoglu and Ata Turk. 2017. Edge-Based Wedge Sampling to Estimate Triangle Counts in Very Large Graphs. In ICDM . IEEE, 455--464."},{"volume-title":"Social network analysis: Methods and applications","author":"Wasserman Stanley","key":"e_1_3_2_1_59_1","unstructured":"Stanley Wasserman and Katherine Faust . 1994. Social network analysis: Methods and applications . Vol. 8 . Cambridge university press . Stanley Wasserman and Katherine Faust. 1994. Social network analysis: Methods and applications. Vol. 8. Cambridge university press."},{"key":"e_1_3_2_1_60_1","volume-title":"Anne Van Devender, and Noshir Contractor","author":"Welles Brooke Foucault","year":"2010","unstructured":"Brooke Foucault Welles , Anne Van Devender, and Noshir Contractor . 2010 . Is a \u201cfriend\u201d a friend? Investigating the structure of friendship networks in virtual worlds. In CHI. 4027--4032. Brooke Foucault Welles, Anne Van Devender, and Noshir Contractor. 2010. Is a \u201cfriend\u201d a friend? Investigating the structure of friendship networks in virtual worlds. In CHI. 4027--4032."},{"key":"e_1_3_2_1_61_1","unstructured":"Ellery Wulczyn and Dario Taraborelli. 2017. Wikipedia Clickstream.  Ellery Wulczyn and Dario Taraborelli. 2017. Wikipedia Clickstream."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2260354"},{"key":"e_1_3_2_1_63_1","volume-title":"Austin R. Benson, and Jure Leskovec","author":"Yin Hao","year":"2019","unstructured":"Hao Yin , Austin R. Benson, and Jure Leskovec . 2019 . The Local Closure Coefficient: A New Perspective On Network Clustering. In WSDM . 303--311. Hao Yin, Austin R. Benson, and Jure Leskovec. 2019. The Local Closure Coefficient: A New Perspective On Network Clustering. In WSDM . 303--311."}],"event":{"name":"WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Houston TX USA","acronym":"WSDM '20"},"container-title":["Proceedings of the 13th International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3336191.3371823","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3336191.3371823","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3336191.3371823","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:14Z","timestamp":1750202594000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3336191.3371823"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,20]]},"references-count":62,"alternative-id":["10.1145\/3336191.3371823","10.1145\/3336191"],"URL":"https:\/\/doi.org\/10.1145\/3336191.3371823","relation":{},"subject":[],"published":{"date-parts":[[2020,1,20]]},"assertion":[{"value":"2020-01-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}