{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T23:14:25Z","timestamp":1771888465296,"version":"3.50.1"},"reference-count":38,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T00:00:00Z","timestamp":1607558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T00:00:00Z","timestamp":1607558400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T00:00:00Z","timestamp":1607558400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,12,10]]},"DOI":"10.1109\/bigdata50022.2020.9378434","type":"proceedings-article","created":{"date-parts":[[2021,3,19]],"date-time":"2021-03-19T21:10:21Z","timestamp":1616188221000},"page":"5-14","source":"Crossref","is-referenced-by-count":3,"title":["A theoretical analysis of graph evolution caused by triadic closure and algorithmic implications"],"prefix":"10.1109","author":[{"given":"Sara","family":"Ahmadian","sequence":"first","affiliation":[]},{"given":"Shahrzad","family":"Haddadan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"crossref","first-page":"13382","DOI":"10.1073\/pnas.172501399","article-title":"Modeling the internet’s large-scale topology","volume":"99","author":"yook","year":"2002","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487645"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"ref31","author":"roughgarden","year":"2020","journal-title":"Distribution-free models of social networks"},{"key":"ref30","article-title":"The directed closure process in hybrid social-information networks, with an analysis of link formation on twitter","volume":"abs 1003 2469","author":"romero","year":"2010","journal-title":"ArXiv"},{"key":"ref37","first-page":"440","volume":"393","author":"watts","year":"1998","journal-title":"dynamics of small-world networks"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s11192-017-2468-x"},{"key":"ref35","author":"ugander","year":"2011","journal-title":"The Anatomy of the Facebook Social Graph"},{"key":"ref34","article-title":"Novel dense subgraph discovery primitives: Risk aversion and exclusion queries","volume":"abs 1904 8178","author":"tsourakakis","year":"2019","journal-title":"CoRR"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1132952.1132954"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44436-X_10"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/PL00012580"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741638"},{"key":"ref14","first-page":"55:1","article-title":"Finding Cliques in Social Networks: A New Distribution-Free Model","volume":"107","author":"fox","year":"2018","journal-title":"45th Int Colloq Automata Languages and Programming (ICALP 2018)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2789987"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3154399"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2453956"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2576940"},{"key":"ref19","author":"husic","year":"2020","journal-title":"Fpt algorithms for finding dense subgraphs in c-closed graphs"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"5207","DOI":"10.1073\/pnas.032085699","article-title":"Winners don’t take all: Characterizing the competition for links on the web","volume":"99","author":"pennock","year":"2002","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"ref27","author":"opsahl","year":"0","journal-title":"Triadic closure in two-mode networks Redefining the global and local clustering coefficients"},{"key":"ref3","year":"0","journal-title":"Stanford Large Network Dataset Collection"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140442"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2008.10.006"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.200327197"},{"key":"ref8","article-title":"Triadic closure as a basic generating mechanism of the structure of complex networks","author":"bianconi","year":"2014","journal-title":"Technical Report arXiv 1407 1664"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746592"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/140996768"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1017\/nws.2015.38"},{"key":"ref1","year":"0","journal-title":"Konect (the koblenz network collection)"},{"key":"ref20","author":"koana","year":"2020","journal-title":"Computing dense and sparse subgraphs of weakly closed graphs"},{"key":"ref22","author":"koana","year":"2020","journal-title":"Detecting and enumerating small induced subgraphs in c-closed graphs"},{"key":"ref21","author":"koana","year":"2020","journal-title":"Exploiting c-closure in kernelization algorithms for graph problems"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2499907.2499908"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892065"},{"key":"ref26","first-page":"8577","author":"newman","year":"2006","journal-title":"Modularity and community structure in networks"},{"key":"ref25","article-title":"Network motifs: simple building blocks of complex networks","author":"r","year":"2002","journal-title":"Science"}],"event":{"name":"2020 IEEE International Conference on Big Data (Big Data)","location":"Atlanta, GA, USA","start":{"date-parts":[[2020,12,10]]},"end":{"date-parts":[[2020,12,13]]}},"container-title":["2020 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9377717\/9377728\/09378434.pdf?arnumber=9378434","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T15:59:10Z","timestamp":1656345550000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9378434\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,10]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/bigdata50022.2020.9378434","relation":{},"subject":[],"published":{"date-parts":[[2020,12,10]]}}}