{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T14:18:35Z","timestamp":1781533115185,"version":"3.54.5"},"reference-count":50,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T00:00:00Z","timestamp":1776643200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62462037"],"award-info":[{"award-number":["62462037"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"award":["62462037"],"award-info":[{"award-number":["62462037"]}],"id":[{"id":"https:\/\/ror.org\/01h0zpd94","id-type":"ROR","asserted-by":"publisher"}]},{"name":"Humanities and Social Sciences Research Project in Jiangxi Province\u2019s Universities","award":["JC24201"],"award-info":[{"award-number":["JC24201"]}]},{"name":"Science and Technology Plan Project of Jiangxi Provincial Department of Education","award":["GJJ2400303"],"award-info":[{"award-number":["GJJ2400303"]}]},{"name":"Jiangxi Province Basic Education Research Project","award":["SZUNDXX2024-1070"],"award-info":[{"award-number":["SZUNDXX2024-1070"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Trust decay in social media is a serious threat to user experience and platform ecology. To solve this problem, this paper focuses on triadic closure in the infrastructure of social networks and explores its mechanism in trust decay prevention. Based on the systematic comparison of the ER random graph, the BA scale-free network, a forest fire model, and complete graph approaches, two core metrics, the trust decay risk index and trust resilience index, are proposed in this paper. Combined with structural indices such as the clustering coefficient, the average path length, and the triangular closure number and its growth rate, the quantitative relationship between network structure evolution and trust decay risk is established. It is found that the forest fire model exhibits optimal trust resilience in structure due to its power-law growth characteristics of high clustering, short path length and triangular closure; the dynamic mechanism of trust decay under different network growth modes is significantly different. The validity of the theoretical framework is further supported by the verification of Sina Weibo attention relationship network data. The analysis framework of network growth evolution based on fusion triangle closure and the risk and resilience indicators defined in this paper provides a computable theoretical tool for understanding and predicting trust evolution in social media from the perspective of network structure.<\/jats:p>","DOI":"10.3390\/e28040468","type":"journal-article","created":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T12:01:22Z","timestamp":1776686482000},"page":"468","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Modeling and Dynamic Analysis of Trust Decay in Social Media Based on Triadic Closure Structure"],"prefix":"10.3390","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-6431-8608","authenticated-orcid":false,"given":"Yao","family":"Qu","sequence":"first","affiliation":[{"name":"Research Center for Management Science and Engineering, Jiangxi Normal University, Nanchang 330022, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Changjing","family":"Wang","sequence":"additional","affiliation":[{"name":"Research Center for Management Science and Engineering, Jiangxi Normal University, Nanchang 330022, China"},{"name":"School of Artificial Intelligence, Jiangxi Normal University, Nanchang 330022, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6924-8782","authenticated-orcid":false,"given":"Qi","family":"Tian","sequence":"additional","affiliation":[{"name":"Vocational Normal College, Jiangxi Agricultural University, Nanchang 330045, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2026,4,20]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Gombar, M., and Boban, M. (2025). Research on the impact of algorithmic echo chambers on perceptions and attitudes of social network users in a digital society. 2025 MIPRO 48th ICT and Electronics Convention, IEEE.","DOI":"10.1109\/MIPRO65660.2025.11131918"},{"key":"ref_2","unstructured":"P\u00f3sfai, M., and Barab\u00e1si, A. (2016). Network Science, Cambridge University Press."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"042806","DOI":"10.1103\/PhysRevE.90.042806","article-title":"Triadic closure as a basic generating mechanism of communities in complex networks","volume":"90","author":"Bianconi","year":"2014","journal-title":"Phys. Rev. E Stat. Nonlinear Soft Matter Phys."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Kates-Harbeck, J., and Nowak, M. (2023). Trust based attachment. PLoS ONE, 18.","DOI":"10.1371\/journal.pone.0288142"},{"key":"ref_5","unstructured":"Huang, H., Tang, J., Liu, L., Luo, J.-D., and Fu, X. (2017). Social Network Analysis, CRC Press."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1725","DOI":"10.1137\/140996768","article-title":"Predicting triadic closure in networks using communicability distance functions","volume":"75","author":"Estrada","year":"2015","journal-title":"SIAM J. Appl. Math."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3732295","article-title":"Exploring Time-Ordered Triadic Closure in Online Social Networks","volume":"19","author":"Galdeman","year":"2025","journal-title":"ACM Trans. Web"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1002\/job.2895","article-title":"Coevolution of Trust and Helping Behavior: A Social Network Examination of Dyadic and Third-Party Influences","volume":"46","author":"He","year":"2025","journal-title":"J. Organ. Behav."},{"key":"ref_9","first-page":"1","article-title":"Role of Echo Chambers in the Polarization of Society","volume":"1","author":"Angelova","year":"2025","journal-title":"Athens J. Politics Int. Aff."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"eaax7310","DOI":"10.1126\/sciadv.aax7310","article-title":"Cumulative effects of triadic closure and homophily in social networks","volume":"6","author":"Asikainen","year":"2020","journal-title":"Sci. Adv."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"107610","DOI":"10.1016\/j.knosys.2021.107610","article-title":"Trust propagation and trust network evaluation in social networks based on uncertainty theory","volume":"234","author":"Xu","year":"2021","journal-title":"Knowl.-Based Syst."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Hatamleh, I.H.M., Safori, A.O., Habes, M., Tahat, O., Ahmad, A.K., Abdallah, R.A.-Q., and Aissani, R. (2023). Trust in social media: Enhancing social relationships. Soc. Sci., 12.","DOI":"10.3390\/socsci12070416"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/j.knosys.2016.08.019","article-title":"Domain-aware trust network extraction for trust propagation in large-scale heterogeneous trust networks","volume":"111","author":"Jiang","year":"2016","journal-title":"Knowl.-Based Syst."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Wen, J., Jiang, N., Li, J., Liu, X., Chen, H., Ren, Y., Yuan, Z., and Tu, Z. (2023). DTrust: Toward dynamic trust levels assessment in time-varying online social networks. IEEE INFOCOM-IEEE Conference on Computer Communications, IEEE.","DOI":"10.1109\/INFOCOM53939.2023.10228962"},{"key":"ref_15","first-page":"60","article-title":"Dynamic adaptive trust evaluation model based on interaction-aware","volume":"33","author":"Li","year":"2012","journal-title":"J. China Inst. Commun."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3236008","article-title":"Survey on computational trust and reputation models","volume":"51","author":"Braga","year":"2018","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"2127","DOI":"10.1109\/COMST.2022.3192978","article-title":"A survey on trust models in heterogeneous networks","volume":"24","author":"Wang","year":"2022","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_18","first-page":"1","article-title":"A survey on trust evaluation based on machine learning","volume":"53","author":"Wang","year":"2020","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1111\/bjop.12740","article-title":"Explainability increases trust resilience in intelligent agents","volume":"117","author":"Xu","year":"2024","journal-title":"Br. J. Psychol."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/s00607-023-01236-z","article-title":"Can we quantify trust? Towards a trust-based resilient SIoT network","volume":"106","author":"Sagar","year":"2023","journal-title":"Computing"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"8864533","DOI":"10.1155\/2020\/8864533","article-title":"Wireless communications and mobile computing blockchain-based trust management in distributed Internet of things","volume":"2020","author":"Li","year":"2020","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"184797901989744","DOI":"10.1177\/1847979019897444","article-title":"Research on cloud computing service based on trust access control","volume":"12","author":"Sun","year":"2020","journal-title":"Int. J. Eng. Bus. Manag."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"e30071","DOI":"10.1016\/j.heliyon.2024.e30071","article-title":"The component and structure of interpersonal trust","volume":"10","author":"Fu","year":"2024","journal-title":"Heliyon"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"103790","DOI":"10.1016\/j.cose.2024.103790","article-title":"Exploring security and trust mechanisms in online social networks: An extensive review","volume":"140","author":"Jethava","year":"2024","journal-title":"Comput. Secur."},{"key":"ref_25","first-page":"1467","article-title":"Cohesion Degree\u2014A New Characteristic for Describing and Measuring Anti-disturbance Ability of Social Ecosystem","volume":"44","author":"Hu","year":"2014","journal-title":"Sci. China Inf. Sci. (Chin. Ed.)"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"105785","DOI":"10.1016\/j.ssci.2022.105785","article-title":"Building collaborative trust in public safety networks","volume":"152","year":"2022","journal-title":"Saf. Sci."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"105294","DOI":"10.1016\/j.scs.2024.105294","article-title":"Integrated Bayesian Network and Strongest Path Method (BN-SPM) for effective multi-hazard risk assessment of interconnected infrastructure systems","volume":"104","author":"Bakhtiari","year":"2024","journal-title":"Sustain. Cities Soc."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/JSAC-OCN.2007.022305","article-title":"Resilience of all-optical network architectures under in-band crosstalk attacks: A probabilistic graphical model approach","volume":"25","author":"Liu","year":"2007","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"141258","DOI":"10.1016\/j.jclepro.2024.141258","article-title":"Analysis of land system resilience: Static and dynamic perspectives","volume":"447","author":"Wang","year":"2024","journal-title":"J. Clean. Prod."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"3173","DOI":"10.1007\/s11277-020-07523-8","article-title":"TBCS: A trust based clustering scheme for secure communication in flying ad-hoc networks","volume":"114","author":"Singh","year":"2020","journal-title":"Wirel. Pers. Commun."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"3542","DOI":"10.1109\/TNSM.2025.3570290","article-title":"A novel lightweight dynamic trust evaluation model for edge computing","volume":"22","author":"Yang","year":"2025","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1109\/TNSE.2022.3222528","article-title":"A generalized configuration model with triadic closure","volume":"10","author":"Zhang","year":"2022","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"ref_33","unstructured":"Zhang, W. (2023). Research on Distance-Based Parameters of Graphs. [Ph.D. Thesis, Xinjiang University]."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/j.ins.2018.11.037","article-title":"A review on trust propagation and opinion dynamics in social networks and group decision making frameworks","volume":"478","author":"Kou","year":"2019","journal-title":"Inf. Sci."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"106620","DOI":"10.1016\/j.knosys.2020.106620","article-title":"A dynamic sampling algorithm based on learning automata for stochastic trust networks","volume":"212","author":"Ghavipour","year":"2021","journal-title":"Knowl.-Based Syst."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1007\/s00607-021-00918-w","article-title":"A propagation trust model in social networks based on the A* algorithm and multi-criteria decision making","volume":"103","author":"Hamzelou","year":"2021","journal-title":"Computing"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/j.knosys.2017.06.034","article-title":"Trust propagation algorithm based on learning automata for inferring local trust in online social networks","volume":"143","author":"Ghavipour","year":"2018","journal-title":"Knowl.-Based Syst."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"157382","DOI":"10.1109\/ACCESS.2020.3019797","article-title":"Dynamic weighted heuristic trust path search algorithm","volume":"8","author":"Kong","year":"2020","journal-title":"IEEE Access"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1007\/s11036-015-0619-y","article-title":"Efficiently predicting trustworthiness of mobile services based on trust propagation in social networks","volume":"20","author":"Lyu","year":"2015","journal-title":"Mob. Netw. Appl."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"230046","DOI":"10.1098\/rsos.230046","article-title":"Clustering drives cooperation on reputation networks, all else fixed","volume":"10","year":"2023","journal-title":"R. Soc. Open Sci."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Kridera, S., and Kanavos, A. (2024). Exploring Trust Dynamics in Online Social Networks: A Social Network Analysis Perspective. Math. Comput. Appl., 29.","DOI":"10.3390\/mca29030037"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Brandenberger, L., Casiraghi, G., Nanumyan, V., and Schweitzer, F. (2019). Quantifying triadic closure in multi-edge social networks. ASONAM \u201819: Proceedings of the 2019 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, Association for Computing Machinery.","DOI":"10.1145\/3341161.3342926"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1007\/s10115-022-01792-4","article-title":"DNETC: Dynamic network embedding preserving both triadic closure evolution and community structures","volume":"65","author":"Yang","year":"2023","journal-title":"Knowl. Inf. Syst."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1287\/isre.2019.0838","article-title":"Triadic closure, homophily, and reciprocation: An empirical investigation of social ties between content providers","volume":"30","author":"Song","year":"2019","journal-title":"Inf. Syst. Res."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1609\/icwsm.v8i1.14507","article-title":"Link and triadic closure delay: Temporal metrics for social network dynamics","volume":"8","author":"Zignani","year":"2014","journal-title":"Proc. Int. AAAI Conf. Web Soc. Media"},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"e2404590122","DOI":"10.1073\/pnas.2404590122","article-title":"Tendencies toward triadic closure: Field experimental evidence","volume":"122","author":"Mosleh","year":"2025","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"103596","DOI":"10.1016\/j.jretconser.2023.103596","article-title":"Factors influencing behavioral intentions in livestream shopping: A cross-cultural study","volume":"76","author":"Ni","year":"2024","journal-title":"J. Retail. Consum. Serv."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s13278-020-0632-4","article-title":"Test for triadic closure and triadic protection in temporal relational event data","volume":"10","author":"Wit","year":"2020","journal-title":"Soc. Netw. Anal. Min."},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Sidorov, S., Emelianov, T., Mironov, S., Sidorova, E., Kostyukhin, Y., Volkov, A., Ostrovskaya, A., and Polezharova, L. (2024). Network Evolution Model with Preferential Attachment at Triadic Formation Step. Mathematics, 12.","DOI":"10.3390\/math12050643"},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"123023","DOI":"10.1016\/j.techfore.2023.123023","article-title":"Modeling pathway linking mobile social media intensity to attitude towards electronic word-of-mouth and engagement: The significant role of social trust and perceived homophily","volume":"198","author":"Pang","year":"2024","journal-title":"Technol. Forecast. Soc. Change"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/4\/468\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T12:05:18Z","timestamp":1776686718000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/4\/468"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,20]]},"references-count":50,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2026,4]]}},"alternative-id":["e28040468"],"URL":"https:\/\/doi.org\/10.3390\/e28040468","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,20]]}}}