{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T20:28:48Z","timestamp":1792787328473,"version":"4.5.0"},"reference-count":64,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"name":"Packard Fellowship"},{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1352121"],"award-info":[{"award-number":["DMS-1352121"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1524062"],"award-info":[{"award-number":["CCF-1524062"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1319080"],"award-info":[{"award-number":["CCF-1319080"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1740850"],"award-info":[{"award-number":["CCF-1740850"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2020,1]]},"abstract":"<jats:p>We propose a new distribution-free model of social networks. Our definitions are motivated by one of the most universal signatures of social networks, triadic closure---the property that pairs of vertices with common neighbors tend to be adjacent. Our most basic definition is that of a $c$-closed graph, where for every pair of vertices $u,v$ with at least $c$ common neighbors, $u$ and $v$ are adjacent. We study the classic problem of enumerating all maximal cliques, an important task in social network analysis. We prove that this problem is fixed-parameter tractable with respect to $c$ on $c$-closed graphs. Our results carry over to weakly $c$-closed graphs, which only require a vertex deletion ordering that avoids pairs of nonadjacent vertices with $c$ common neighbors. Numerical experiments show that well-studied social networks with thousands of vertices tend to be weakly $c$-closed for modest values of $c$.<\/jats:p>","DOI":"10.1137\/18m1210459","type":"journal-article","created":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T14:20:55Z","timestamp":1587997255000},"page":"448-464","source":"Crossref","is-referenced-by-count":29,"title":["Finding Cliques in Social Networks: A New Distribution-Free Model"],"prefix":"10.1137","volume":"49","author":[{"given":"Jacob","family":"Fox","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tim","family":"Roughgarden","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C.","family":"Seshadhri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fan","family":"Wei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicole","family":"Wein","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2020,4,27]]},"reference":[{"key":"atypb2","first-page":"201","author":"Bhaskara E. C. A.","year":"2010","journal-title":"New York"},{"key":"atypb3","unstructured":"A. Abraham and R. Sandler,\n                      An Introduction to Finite Projective Planes\n                      , Dover, Mineola, NY, 2015."},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1038\/35019019"},{"key":"atypb5","unstructured":"N. Alon, S. Arora, R. Manokaran, D. Moshkovitz, and O. Weinstein,\n                      Inapproximability of Densest $\\kappa$-Subgraph from Average Case Hardness\n                      , unpublished manuscript, 2011."},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-2014-00816-X"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnv010"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.37236\/6233"},{"key":"atypb10","doi-asserted-by":"crossref","unstructured":"P. Borassi, M. Crescenzi, and L. Trevisan,\n                      An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs\n                      , preprint,https:\/\/arxiv.org\/abs\/1604.01445, 2016.","DOI":"10.1137\/1.9781611974782.58"},{"key":"atypb11","first-page":"1306","author":"Brach P.","year":"2016","journal-title":"Philadelphia"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(00)00083-9"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1145\/1132952.1132954"},{"key":"atypb14","first-page":"442","author":"Chakrabarti D.","year":"2004","journal-title":"Proceedings of the Fourth SIAM International Conference on Data Mining"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.252631999"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1007\/PL00012580"},{"key":"atypb17","unstructured":"A. Conte, R. De Virgilio, A. Maccioni, M. Patrignani, and R. Torlone,\n                      Finding all maximal cliques in very large social networks\n                      , in Proceedings of the 19th International Conference on Extending Database Technology (EDBT), 2016, pp. 173-184."},{"key":"atypb18","doi-asserted-by":"crossref","unstructured":"M. Cygan, F. V. Fomin, \u0141. Kowalik, D. Lokshtanov, D. Marx, M. Pilipczuk, M. Pilipczuk, and S. Saurabh,\n                      Parameterized Algorithms\n                      , Springer, Cham, 2015.","DOI":"10.1007\/978-3-319-21275-3"},{"key":"atypb19","doi-asserted-by":"crossref","unstructured":"N. Du, B. Wu, L. Xu, B. Wang, and X. Pei,\n                      A parallel algorithm for enumerating all maximal cliques in complex network\n                      , in Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06), 2006, pp. 320-324.","DOI":"10.1109\/ICDMW.2006.17"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2011.04.001"},{"key":"atypb21","doi-asserted-by":"crossref","unstructured":"D. Eppstein, M. L\u00f6ffler, and D. Strash,\n                      Listing all maximal cliques in sparse graphs in near-optimal time\n                      , in ISAAC 2010: Algorithms and Computation, Springer, Berlin, Heidelberg, 2010, pp. 403-414,https:\/\/doi.org\/10.1007\/978-3-642-17517-6_36.","DOI":"10.1007\/978-3-642-17517-6_36"},{"key":"atypb22","first-page":"364","author":"Eppstein D.","year":"2011","journal-title":"Heidelberg"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.04.015"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1145\/316194.316229"},{"key":"atypb25","first-page":"417","author":"Ferrante A.","year":"2007","journal-title":"Berlin"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.12.007"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"atypb28","unstructured":"J. Fox and F. Wei,\n                      On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion\n                      , preprint,https:\/\/arxiv.org\/abs\/1606.06810, 2016."},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2017.04.004"},{"key":"atypb30","first-page":"169","author":"F\u00fcredi Z.","year":"2013","journal-title":"Heidelberg"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.10.012"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1137\/140955331"},{"key":"atypb34","doi-asserted-by":"crossref","unstructured":"M. Jha, C. Seshadhri, and A. Pinar,\n                      Path sampling: A fast and provable method for estimating 4-vertex subgraph counts\n                      , in Proceedings of the 24th International Conference on World Wide Web, 2015, pp. 495-505.","DOI":"10.1145\/2736277.2741101"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1038\/35022643"},{"key":"atypb36","first-page":"163","author":"Kleinberg J. M.","year":"2000","journal-title":"New York"},{"key":"atypb37","first-page":"431","author":"Kleinberg J. M.","year":"2002","journal-title":"Natural and Synthetic"},{"key":"atypb38","doi-asserted-by":"crossref","unstructured":"R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal,\n                      Stochastic models for the Web graph\n                      , in Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2000, pp. 57-65,http:\/\/doi.ieeecomputersociety.org\/10.1109\/SFCS.2000.892065.","DOI":"10.1109\/SFCS.2000.892065"},{"key":"atypb39","first-page":"985","volume":"11","author":"Leskovec J.","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"atypb40","unstructured":"J. Leskovec and A. Krevl,\n                      SNAP Datasets: Stanford Large Network Dataset Collection\n                      ,http:\/\/snap.stanford.edu\/data, June 2014."},{"key":"atypb41","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"atypb42","first-page":"993","author":"Lin H.","year":"2008","journal-title":"Philadelphia"},{"key":"atypb43","doi-asserted-by":"crossref","unstructured":"M. Mitzenmacher, J. Pachocki, R. Peng, C. Tsourakakis, and S. Xu,\n                      Scalable large near-clique detection in large-scale networks via sampling\n                      , in Proceedings of the 21st AMC SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015, pp. 815-824,https:\/\/doi.org\/10.1145\/2783258.2783385.","DOI":"10.1145\/2783258.2783385"},{"key":"atypb44","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1004098107"},{"key":"atypb45","doi-asserted-by":"publisher","DOI":"10.1007\/BF02760024"},{"key":"atypb46","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.98.2.404"},{"key":"atypb47","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.026121"},{"key":"atypb48","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"atypb49","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-2010-05189-X"},{"key":"atypb50","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9148-9"},{"key":"atypb51","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548308009085"},{"key":"atypb52","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2016.184.3.1"},{"key":"atypb53","doi-asserted-by":"publisher","DOI":"10.1137\/14100018X"},{"key":"atypb54","first-page":"861","author":"Sala A.","year":"2010","journal-title":"ACM"},{"key":"atypb55","first-page":"927","author":"\u0308ce A. E.","year":"2015","journal-title":"Switzerland"},{"key":"atypb56","doi-asserted-by":"publisher","DOI":"10.1007\/s00222-014-0562-8"},{"key":"atypb57","first-page":"10","author":"Seshadhri C.","year":"2013","journal-title":"Philadelphia"},{"key":"atypb58","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-006-9039-7"},{"key":"atypb59","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"atypb60","first-page":"1122","author":"Tsourakakis C.","year":"2015","journal-title":"Switzerland"},{"key":"atypb61","doi-asserted-by":"crossref","unstructured":"C. Tsourakakis, F. Bonchi, A. Gionis, F. Gullo, and M. Tsiarli,\n                      Denser than the densest subgraph: Extracting optimal quasi-cliques with quality guarantees\n                      , in Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013, pp. 104-112.","DOI":"10.1145\/2487575.2487645"},{"key":"atypb62","doi-asserted-by":"publisher","DOI":"10.1137\/0206036"},{"key":"atypb63","doi-asserted-by":"crossref","unstructured":"J. Ugander, L. Backstrom, and J. Kleinberg,\n                      Subgraph frequencies: Mapping the empirical and extremal geography of large graph collections\n                      , in Proceedings of the 22nd International Conference on World Wide Web, 2013, pp. 1307-1318.","DOI":"10.1145\/2488388.2488502"},{"key":"atypb64","unstructured":"J. Ugander, B. Karrer, L. Backstrom, and C. Marlow,\n                      The Anatomy of the Facebook Social Graph\n                      , preprint,https:\/\/arxiv.org\/abs\/1111.4503, 2011."},{"key":"atypb65","doi-asserted-by":"publisher","DOI":"10.1038\/30918"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/18M1210459","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:19:01Z","timestamp":1787336341000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/18M1210459"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":64,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["10.1137\/18M1210459"],"URL":"https:\/\/doi.org\/10.1137\/18m1210459","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1]]}}}