{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T01:20:18Z","timestamp":1775784018095,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T00:00:00Z","timestamp":1744156800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T00:00:00Z","timestamp":1744156800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"DOI":"10.1007\/s13278-025-01456-5","type":"journal-article","created":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T14:42:16Z","timestamp":1744209736000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Estimation of the\u00a0influence of the threshold model on directed hypergraphs"],"prefix":"10.1007","volume":"15","author":[{"given":"Xin-Jian","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ze-Yuan","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li-Jie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,9]]},"reference":[{"key":"1456_CR1","volume-title":"The Probabilistic Method","author":"N Alon","year":"2016","unstructured":"Alon N, Spencer JH (2016) The Probabilistic Method. John Wiley & Sons, New York"},{"key":"1456_CR2","doi-asserted-by":"crossref","unstructured":"Amato F, Moscato V, Picariello A, Sperl\u00ed G (2017) Influence maximization in social media networks using hypergraphs. Green. Pervasive, and Cloud Computing. Springer, Cham, pp 207\u2013221","DOI":"10.1007\/978-3-319-57186-7_17"},{"issue":"7","key":"1456_CR3","doi-asserted-by":"publisher","first-page":"796","DOI":"10.3390\/e23070796","volume":"23","author":"A Antelmi","year":"2021","unstructured":"Antelmi A, Cordasco G, Spagnuolo C, Szufel P (2021) Social influence maximization in hypergraphs. Entropy 23(7):796","journal-title":"Entropy"},{"key":"1456_CR4","unstructured":"Asavathiratham C (2001) The influence model: a tractable representation for the dynamics of networked markov chains. PhD thesis, Massachusetts Institute of Technology"},{"issue":"6","key":"1456_CR5","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/37.969135","volume":"21","author":"C Asavathiratham","year":"2001","unstructured":"Asavathiratham C, Roy S, Lesieutre B, Verghese G (2001) The influence model. IEEE Control Syst Mag 21(6):52\u201364","journal-title":"IEEE Control Syst Mag"},{"key":"1456_CR6","doi-asserted-by":"crossref","unstructured":"Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"1456_CR7","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 57\u201366","DOI":"10.1145\/502512.502525"},{"key":"1456_CR8","doi-asserted-by":"crossref","unstructured":"Fardad M, Kearney G (2017) On a linear programming approach to the optimal seeding of cascading failures. In: 2017 IEEE 56th Annual Conference on Decision and Control (CDC), pp. 102\u2013107","DOI":"10.1109\/CDC.2017.8263650"},{"issue":"2\u20133","key":"1456_CR9","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0166-218X(93)90045-P","volume":"42","author":"G Gallo","year":"1993","unstructured":"Gallo G, Longo G, Pallottino S, Nguyen S (1993) Directed hypergraphs and applications. Discrete Appl Math 42(2\u20133):177\u2013201","journal-title":"Discrete Appl Math"},{"key":"1456_CR10","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/B978-0-08-097086-8.32074-8","volume-title":"International Encyclopedia of the Social and Behavioral Sciences","author":"RH Gass","year":"2015","unstructured":"Gass RH, Wright JD (2015) Sociology of social influence. In: Wright JD (ed) International Encyclopedia of the Social and Behavioral Sciences, 2nd edn. Elsevier, Oxford, pp 348\u2013354","edition":"2"},{"issue":"2","key":"1456_CR11","first-page":"021004","volume":"3","author":"JP Gleeson","year":"2013","unstructured":"Gleeson JP (2013) Binary-state dynamics on complex networks: pair approximation and beyond. Phys Rev X 3(2):021004","journal-title":"Phys Rev X"},{"issue":"5","key":"1456_CR12","doi-asserted-by":"publisher","first-page":"056103","DOI":"10.1103\/PhysRevE.75.056103","volume":"75","author":"JP Gleeson","year":"2007","unstructured":"Gleeson JP, Cahalane DJ (2007) Seed size strongly affects cascades on random networks. Phys Rev E 75(5):056103","journal-title":"Phys Rev E"},{"issue":"6","key":"1456_CR13","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1086\/226707","volume":"83","author":"M Granovetter","year":"1978","unstructured":"Granovetter M (1978) Threshold models of collective behavior. Am J Sociol 83(6):1420\u20131443","journal-title":"Am J Sociol"},{"key":"1456_CR14","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/j.ins.2019.07.043","volume":"503","author":"E G\u00fcney","year":"2019","unstructured":"G\u00fcney E (2019) An efficient linear programming based method for the influence maximization problem in social networks. Inf Sci 503:589\u2013605","journal-title":"Inf Sci"},{"key":"1456_CR15","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146","DOI":"10.1145\/956750.956769"},{"issue":"6","key":"1456_CR16","doi-asserted-by":"publisher","first-page":"2330","DOI":"10.1007\/s10618-023-00955-3","volume":"37","author":"S Kim","year":"2023","unstructured":"Kim S, Choe M, Yoo J, Shin K (2023) Reciprocity in directed hypergraphs: measures, findings, and generators. Data Min Knowl Disc 37(6):2330\u20132388","journal-title":"Data Min Knowl Disc"},{"key":"1456_CR17","doi-asserted-by":"crossref","unstructured":"Levin DA, Peres Y (2017) Markov Chains and Mixing Times. American Mathematical Soc, Rhode Island","DOI":"10.1090\/mbk\/107"},{"key":"1456_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1140\/epjb\/e2015-60263-6","volume":"88","author":"S Lim","year":"2015","unstructured":"Lim S, Jung I, Lee S, Jung K (2015) Analysis of information diffusion for threshold models on arbitrary networks. Eur Phys J B 88:1\u201314","journal-title":"Eur Phys J B"},{"key":"1456_CR19","doi-asserted-by":"crossref","unstructured":"Li Y, Zhang D, Tan K-L (2015) Real-time targeted influence maximization for online advertisements. Proc VLDB Endow 8(10):1070\u20131081","DOI":"10.14778\/2794367.2794376"},{"issue":"1","key":"1456_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1049\/itr2.12130","volume":"16","author":"X Luo","year":"2022","unstructured":"Luo X, Peng J, Liang J (2022) Directed hypergraph attention network for traffic forecasting. IET Intell Transp Syst 16(1):85\u201398","journal-title":"IET Intell Transp Syst"},{"issue":"2","key":"1456_CR21","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1109\/TNSE.2017.2777941","volume":"6","author":"WS Rossi","year":"2017","unstructured":"Rossi WS, Como G, Fagnani F (2017) Threshold models of cascades in large-scale networks. IEEE Trans Netw Sci Eng 6(2):158\u2013172","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"1456_CR22","doi-asserted-by":"crossref","unstructured":"Sinha A, Shen Z, Song Y, Ma H, Eide D, Hsu B-J, Wang K (2015) An overview of microsoft academic service (mas) and applications. In: Proceedings of the 24th International Conference on World Wide Web, pp. 243\u2013246","DOI":"10.1145\/2740908.2742839"},{"key":"1456_CR23","doi-asserted-by":"crossref","unstructured":"Song X, Tseng BL, Lin C-Y, Sun M-T (2006) Personalized recommendation driven by information flow. In: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 509\u2013516","DOI":"10.1145\/1148170.1148258"},{"key":"1456_CR24","doi-asserted-by":"crossref","unstructured":"Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time: A martingale approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1539\u20131554","DOI":"10.1145\/2723372.2723734"},{"key":"1456_CR25","doi-asserted-by":"crossref","unstructured":"Tang Y, Xiao X, Shi Y (2014) Influence maximization: Near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 75\u201386","DOI":"10.1145\/2588555.2593670"},{"issue":"6","key":"1456_CR26","doi-asserted-by":"publisher","first-page":"066106","DOI":"10.1103\/PhysRevE.77.066106","volume":"77","author":"A Vazquez","year":"2008","unstructured":"Vazquez A (2008) Population stratification using a statistical model on hypergraphs. Phys Rev E 77(6):066106","journal-title":"Phys Rev E"},{"key":"1456_CR27","doi-asserted-by":"crossref","unstructured":"Yadati N, Nitin V, Nimishakavi M, Yadav P, Louis A, Talukdar P (2020) Nhp: Neural hypergraph link prediction. In: Proceedings of the 29th ACM International Conference on Information & Knowledge Management, pp. 1705\u20131714","DOI":"10.1145\/3340531.3411870"},{"key":"1456_CR28","doi-asserted-by":"crossref","unstructured":"Ye M, Liu X, Lee W-C (2012) Exploring social influence for recommendation: a generative model approach. In: Proceedings of the 35th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 671\u2013680","DOI":"10.1145\/2348283.2348373"},{"key":"1456_CR29","doi-asserted-by":"crossref","unstructured":"Zhang R, Qu X, Zhang Q, Xu X, Pei S (2024) Influence maximization based on threshold models in hypergraphs. Chaos 34(2):023111","DOI":"10.1063\/5.0178329"},{"issue":"3","key":"1456_CR30","doi-asserted-by":"publisher","first-page":"1080","DOI":"10.1109\/TCNS.2021.3088782","volume":"9","author":"YD Zhong","year":"2022","unstructured":"Zhong YD, Srivastava V, Leonard NE (2022) Influence spread in the heterogeneous multiplex linear threshold model. IEEE Trans Control Netw Syst 9(3):1080\u20131091","journal-title":"IEEE Trans Control Netw Syst"},{"issue":"4","key":"1456_CR31","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1109\/TNSE.2018.2873759","volume":"6","author":"J Zhu","year":"2018","unstructured":"Zhu J, Zhu J, Ghosh S, Wu W, Yuan J (2018) Social influence maximization in hypergraph in social networks. IEEE Trans Netw Sci Eng 6(4):801\u2013811","journal-title":"IEEE Trans Netw Sci Eng"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-025-01456-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-025-01456-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-025-01456-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:28:54Z","timestamp":1765960134000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-025-01456-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,9]]},"references-count":31,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["1456"],"URL":"https:\/\/doi.org\/10.1007\/s13278-025-01456-5","relation":{},"ISSN":["1869-5469"],"issn-type":[{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,9]]},"assertion":[{"value":"4 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}}],"article-number":"35"}}