{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T12:54:06Z","timestamp":1776171246201,"version":"3.50.1"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/access.2026.3653512","type":"journal-article","created":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T22:02:28Z","timestamp":1768255348000},"page":"8542-8560","source":"Crossref","is-referenced-by-count":2,"title":["Capturing Microdynamics of Temporal Network Growth: An HMM-Based Model of Triadic Closure"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-0958-8674","authenticated-orcid":false,"given":"Vidyalekshmi","family":"Chandrika","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Amrita School of Computing, Amrita Vishwa Vidyapeetham, Amritapuri, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4471-2160","authenticated-orcid":false,"given":"Lekshmi S.","family":"Nair","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Amrita School of Computing, Amrita Vishwa Vidyapeetham, Amritapuri, India"}]},{"given":"Tummalapalli","family":"Sanjit Teja","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Amrita School of Computing, Amrita Vishwa Vidyapeetham, Amritapuri, India"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3160206"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICISS63372.2025.11076505"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0288142"},{"key":"ref4","first-page":"2062","article-title":"Uncovering the formation of triadic closure in social networks","volume-title":"Proc. IJCAI","author":"Fang"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11634-022-00492-9"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2025.3542904"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s11634-020-00403-w"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2808797.2809348"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-024-85078-5"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCNT61001.2024.10725716"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018731"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3077495"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37210-0_22"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12200"},{"key":"ref15","volume-title":"The Autoregressive Stochastic Block Model With Changes in Structure","author":"Ludkin","year":"2017"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599540"},{"key":"ref17","article-title":"Triadic temporal exponential random graph models (TTERGM)","author":"Huang","year":"2022","journal-title":"arXiv:2211.16229"},{"key":"ref18","first-page":"1","article-title":"Finding network motifs: A comparative study between ILP and symmetric rank-one NMF","volume-title":"Proc. 3rd Int. Conf. Intell. Technol. (CONIT)","author":"Aadhithya"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450102"},{"key":"ref20","article-title":"TTERGM: Social theory-driven network simulation","volume-title":"Proc. NeurIPS Temporal Graph Learn. Workshop","author":"Huang"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-28180-8_11"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3732295"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF02476440"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1086\/224954"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1090\/surv\/131"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-021-00404-y"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2011.6160826"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/5.18626"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1090\/mbk\/058"},{"key":"ref30","volume-title":"Markov Chains","author":"Norris","year":"1998"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1201\/9781003210160"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479892228900"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1772-0"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9455-6_7"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1038\/srep02980"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-017-00148-9"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/11323511\/11347016.pdf?arnumber=11347016","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T21:03:17Z","timestamp":1769115797000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11347016\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/access.2026.3653512","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}