{"id":"https://openalex.org/W3139078772","doi":"https://doi.org/10.1109/bigdata50022.2020.9378434","title":"A theoretical analysis of graph evolution caused by triadic closure and algorithmic implications","display_name":"A theoretical analysis of graph evolution caused by triadic closure and algorithmic implications","publication_year":2020,"publication_date":"2020-12-10","ids":{"openalex":"https://openalex.org/W3139078772","doi":"https://doi.org/10.1109/bigdata50022.2020.9378434","mag":"3139078772"},"language":"en","primary_location":{"id":"doi:10.1109/bigdata50022.2020.9378434","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata50022.2020.9378434","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Conference on Big Data (Big Data)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070799139","display_name":"Sara Ahmadian","orcid":"https://orcid.org/0000-0002-7060-6775"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sara Ahmadian","raw_affiliation_strings":["Google Research, New York, USA"],"affiliations":[{"raw_affiliation_string":"Google Research, New York, USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035294006","display_name":"Shahrzad Haddadan","orcid":"https://orcid.org/0000-0002-7702-8250"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shahrzad Haddadan","raw_affiliation_strings":["Brown university, Providence, RI, USA"],"affiliations":[{"raw_affiliation_string":"Brown university, Providence, RI, USA","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5070799139"],"corresponding_institution_ids":["https://openalex.org/I1291425158"],"apc_list":null,"apc_paid":null,"fwci":0.2685,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.55404666,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"5","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9902999997138977,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.7903756499290466},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.755510687828064},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6902918219566345},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5973576307296753},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5868255496025085},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5016748905181885},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.43661877512931824},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3437858819961548},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33199477195739746},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.241108238697052},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23313316702842712},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1703357994556427},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09905266761779785}],"concepts":[{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.7903756499290466},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.755510687828064},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6902918219566345},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5973576307296753},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5868255496025085},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5016748905181885},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.43661877512931824},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3437858819961548},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33199477195739746},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.241108238697052},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23313316702842712},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1703357994556427},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09905266761779785},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bigdata50022.2020.9378434","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata50022.2020.9378434","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Conference on Big Data (Big Data)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W82211948","https://openalex.org/W1535144194","https://openalex.org/W1893161742","https://openalex.org/W1954241630","https://openalex.org/W1970463918","https://openalex.org/W1977458171","https://openalex.org/W1994618970","https://openalex.org/W2008620264","https://openalex.org/W2020742901","https://openalex.org/W2051109346","https://openalex.org/W2085761620","https://openalex.org/W2088428327","https://openalex.org/W2104085672","https://openalex.org/W2112976607","https://openalex.org/W2115579680","https://openalex.org/W2118009636","https://openalex.org/W2119757574","https://openalex.org/W2136149141","https://openalex.org/W2139708889","https://openalex.org/W2151936673","https://openalex.org/W2153624566","https://openalex.org/W2166531833","https://openalex.org/W2259724869","https://openalex.org/W2266714125","https://openalex.org/W2404997500","https://openalex.org/W2737004052","https://openalex.org/W2785221547","https://openalex.org/W2950265899","https://openalex.org/W2963489080","https://openalex.org/W2964137610","https://openalex.org/W3032890203","https://openalex.org/W3042137000","https://openalex.org/W3042736922","https://openalex.org/W3082339973","https://openalex.org/W3100629417","https://openalex.org/W3185936233","https://openalex.org/W4210717797","https://openalex.org/W4287707417","https://openalex.org/W4298206993","https://openalex.org/W4308245776","https://openalex.org/W6684308506","https://openalex.org/W6713866729","https://openalex.org/W6749939884","https://openalex.org/W6761876267"],"related_works":["https://openalex.org/W2391861012","https://openalex.org/W2488336788","https://openalex.org/W4285469493","https://openalex.org/W1593224248","https://openalex.org/W2375766869","https://openalex.org/W2080384954","https://openalex.org/W4382519933","https://openalex.org/W3151465598","https://openalex.org/W1979183926","https://openalex.org/W2798800775"],"abstract_inverted_index":{"Social":[0],"networks":[1,27,63],"have":[2,74],"become":[3],"an":[4,14],"inseparable":[5],"part":[6],"of":[7,24,40,52,91,94,100,144],"human":[8],"life":[9],"and":[10,31,64,83],"processing":[11],"them":[12],"in":[13,21,61,119,136],"efficient":[15],"manner":[16],"is":[17,59,124],"a":[18,45,108],"top":[19],"priority":[20],"the":[22,38,50,88,95,130,142,151],"study":[23],"networks.":[25],"These":[26],"are":[28,33],"highly":[29],"dynamic":[30,54],"they":[32],"growing":[34],"incessantly.":[35],"Inspired":[36],"by":[37,147],"concept":[39],"triadic":[41,57],"closure,":[42],"we":[43,106],"propose":[44],"probabilistic":[46,70],"mechanism":[47],"to":[48,86,111,127,150],"model":[49,82],"evolution":[51],"these":[53],"graphs.":[55],"Although":[56],"closure":[58],"ubiquitous":[60],"social":[62],"its":[65],"presence":[66],"helps":[67],"forming":[68],"communities,":[69],"models":[71],"encapsulating":[72],"it":[73,149],"not":[75],"been":[76],"studied":[77],"adequately.We":[78],"theoretically":[79],"analyze":[80],"our":[81,103,145],"show":[84],"how":[85],"bound":[87],"growth":[89],"rate":[90],"some":[92],"characteristics":[93],"graph,":[96],"such":[97],"as":[98],"degree":[99],"vertices.":[101],"Leveraging":[102],"theoretical":[104],"results,":[105],"develop":[107],"scheduling":[109,122],"subroutine":[110,123],"process":[112],"modifications":[113],"o":[114],"f":[115],"t":[116],"he":[117],"graph":[118],"batches.":[120],"Our":[121],"then":[125],"used":[126],"speed":[128],"up":[129],"state-of-the-art":[131],"algorithms":[132],"with":[133],"negligible":[134],"loss":[135],"their":[137],"approximation":[138],"guarantees.":[139],"We":[140],"demonstrate":[141],"applicability":[143],"method":[146],"applying":[148],"densest":[152],"subgraph":[153],"discovery":[154],"problem.":[155]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}