{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:22:22Z","timestamp":1760149342733,"version":"build-2065373602"},"reference-count":32,"publisher":"MDPI AG","issue":"15","license":[{"start":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T00:00:00Z","timestamp":1690329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001871","name":"FCT\u2014Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UIDB\/00006\/2020"],"award-info":[{"award-number":["UIDB\/00006\/2020"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ISEL","award":["UIDB\/00006\/2020"],"award-info":[{"award-number":["UIDB\/00006\/2020"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematics"],"abstract":"<jats:p>This paper concerns the study of the linear threshold model in random networks, specifically in Erd\u00f6s-R\u00e9nyi networks. In our approach, we consider an activation threshold defined by the expected value for the node degree and the associated influence activation mapping. According to these assumptions, we present a theoretical procedure for the linear threshold model, under fairly general conditions, regarding the topological structure of the networks and the activation threshold. Aiming at the dynamics of the influence maximization process, we analyze and discuss different choices for the seed set based on several centrality measures along with the state conditions for the procedure to trigger. The topological entropy established for Erd\u00f6s-R\u00e9nyi networks defines a topological order for this type of random networks. Sufficient conditions are presented for this topological entropy to be characterized by the spectral radius of the associated adjacency matrices. Consequently, a number of properties are proved. The threshold dynamics are analyzed through the relationship between the activation threshold and the topological entropy. Numerical studies are included to illustrate the theoretical results.<\/jats:p>","DOI":"10.3390\/math11153299","type":"journal-article","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T02:07:17Z","timestamp":1690423637000},"page":"3299","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Influence Maximization Dynamics and Topological Order on Erd\u00f6s-R\u00e9nyi Networks"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8053-6822","authenticated-orcid":false,"given":"J. Leonel","family":"Rocha","sequence":"first","affiliation":[{"name":"CEAUL and Department of Mathematics of ISEL-Engineering Superior Institute of Lisbon, Polytechnic Institute of Lisbon, Rua Conselheiro Em\u00eddio Navarro 1, 1959-007 Lisboa, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2627-1768","authenticated-orcid":false,"given":"S\u00f3nia","family":"Carvalho","sequence":"additional","affiliation":[{"name":"CEAUL and Department of Mathematics of ISEL-Engineering Superior Institute of Lisbon, Polytechnic Institute of Lisbon, Rua Conselheiro Em\u00eddio Navarro 1, 1959-007 Lisboa, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-5354-3052","authenticated-orcid":false,"given":"Beatriz","family":"Coimbra","sequence":"additional","affiliation":[{"name":"CEAUL and Department of Mathematics of ISEL-Engineering Superior Institute of Lisbon, Polytechnic Institute of Lisbon, Rua Conselheiro Em\u00eddio Navarro 1, 1959-007 Lisboa, Portugal"}]},{"given":"In\u00eas","family":"Henriques","sequence":"additional","affiliation":[{"name":"Department of Mathematics of ISEL-Engineering Superior Institute of Lisbon, Polytechnic Institute of Lisbon, Rua Conselheiro Em\u00eddio Navarro 1, 1959-007 Lisboa, Portugal"}]},{"given":"Juliana","family":"Pereira","sequence":"additional","affiliation":[{"name":"Department of Mathematics of ISEL-Engineering Superior Institute of Lisbon, Polytechnic Institute of Lisbon, Rua Conselheiro Em\u00eddio Navarro 1, 1959-007 Lisboa, Portugal"}]}],"member":"1968","published-online":{"date-parts":[[2023,7,26]]},"reference":[{"key":"ref_1","unstructured":"Barab\u00e1si, A.-L. (2016). Network Science, Cambridge University Press."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B. (2001). Random Graphs, Cambridge University Press. Cambridge Studies in Advanced Mathematics.","DOI":"10.1017\/CBO9780511814068"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Hofstad, R. (2016). Random Graphs and Complex Networks, Cambridge University Press.","DOI":"10.1017\/9781316779422"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Newman, M. (2018). Networks, An Introduction, Oxford University Press.","DOI":"10.1093\/oso\/9780198805090.003.0001"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.eng.2018.02.004","article-title":"Social influence analysis: Models, methods, and evaluation","volume":"4","author":"Li","year":"2018","journal-title":"Engineering"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Barrat, A., Barthel\u00e9my, M., and Vespignani, A. (2008). Dynamical Processes on Complex Networks, Cambridge University Press.","DOI":"10.1017\/CBO9780511791383"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Zhang, L., and Li, K. (2022). Influence maximization based on snapshot prediction in dynamic online social networks. Mathematics, 10.","DOI":"10.3390\/math10081341"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Domingos, P., and Richardson, M. (2001, January 26\u201329). Mining the network value of customers. Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA.","DOI":"10.1145\/502512.502525"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., and Tardos, E. (2003, January 24\u201327). Maximizing the spread of influence through a social network. Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM Digital Library, Washington, DC, USA.","DOI":"10.1145\/956750.956769"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Hao, F., Zhu, C., Chen, M., Yang, L., and Pei, Z. (2011, January 19\u201322). Influence strength aware diffusion models for dynamic influence maximization in social networks. Proceedings of the 2011 International Conference on Internet of Things and 4th International Conference on Cyber, Physical and Social Computing, Washington, DC, USA.","DOI":"10.1109\/iThings\/CPSCom.2011.164"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Teng, Y., Shi, Y., Tai, C., Yang, D., Lee, W., and Chen, M. (2021, January 19\u201322). Influence maximization based on dynamic personal perception in knowledge graph. Proceedings of the 2021 IEEE 37th International Conference on Data Engineering (ICDE), Chania, Greece.","DOI":"10.1109\/ICDE51399.2021.00132"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"114207","DOI":"10.1016\/j.eswa.2020.114207","article-title":"A dynamic algorithm based on cohesive entropy for influence maximization in social networks","volume":"169","author":"Li","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"ref_13","first-page":"290","article-title":"On random graphs","volume":"6","year":"1959","journal-title":"Publ. Math. Debrecen"},{"key":"ref_14","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","year":"1960","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"ref_15","first-page":"1420","article-title":"Threshold models of collective behavior","volume":"83","author":"Granovetter","year":"1978","journal-title":"IEEE Access"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/ACCESS.2019.2931925","article-title":"Threshold estimation models for linear threshold-based influential user mining in social networks","volume":"7","author":"Talukder","year":"2019","journal-title":"IEEE Access"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Shakarian, P., Bhatnagar, A., Aleali, A., Shaabani, E., and Guo, R. (2015). Diffusion in Social Networks, Springer. SpringerBriefs in Computer Science.","DOI":"10.1007\/978-3-319-23105-1"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Shakarian, P., Bhatnagar, A., Aleali, A., Shaabani, E., and Guo, R. (2015). Diffusion in Social Networks, Springer. SpringerBriefs in Computer Science.","DOI":"10.1007\/978-3-319-23105-1"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1284680.1284681","article-title":"Epidemic thresholds in real networks","volume":"10","author":"Chakrabarti","year":"2008","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.ejc.2013.06.004","article-title":"Anatomy of the giant component: The strictly supercritical regime","volume":"35","author":"Ding","year":"2014","journal-title":"Eur. J. Comb."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1016\/j.physa.2004.07.011","article-title":"Robustness and network evolution - an entropic principle","volume":"346","author":"Demetrius","year":"2005","journal-title":"Phys. A"},{"key":"ref_22","first-page":"859","article-title":"Evolutionary formalism for products of positive random matrices","volume":"4","author":"Arnold","year":"1994","journal-title":"Ann. Probab."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"2019","DOI":"10.1155\/S016117120430428X","article-title":"Weighted kneading theory of one-dimensional maps with a hole","volume":"38","author":"Rocha","year":"2004","journal-title":"Int. J. Math. Math. Sci."},{"key":"ref_24","first-page":"97","article-title":"Computing conditionally invariant measures and escape rates","volume":"14","author":"Rocha","year":"2006","journal-title":"Neural Parallel Sci. Comput."},{"key":"ref_25","first-page":"340","article-title":"Information transmission and synchronizability in complete networks of systems with linear dynamics","volume":"182","author":"Rocha","year":"2021","journal-title":"Math. Comput. Simul."},{"key":"ref_26","first-page":"553","article-title":"Mutual information rate and topological order in networks","volume":"4","author":"Rocha","year":"2013","journal-title":"Int. J. Nonlinear Sci."},{"key":"ref_27","first-page":"2367","article-title":"Spectral and dynamical invariants in a complete clustered network","volume":"9","author":"Rocha","year":"2015","journal-title":"Appl. Math. Inf. Sci."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"99","DOI":"10.5890\/DNC.2023.03.008","article-title":"Complete dynamical networks: Synchronization, information transmission and topological order","volume":"12","author":"Rocha","year":"2023","journal-title":"J. Discontinuity Nonlinearity Complex."},{"key":"ref_29","first-page":"61","article-title":"The largest eingenvalue of sparse random graphs","volume":"12","author":"Krievelevich","year":"2003","journal-title":"Comb. Probab. Comput."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1002\/rsa.20089","article-title":"Spectral techniques applied to sparse random graphs","volume":"27","author":"Feige","year":"2003","journal-title":"Random Struct. Algorit."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"13642","DOI":"10.1016\/j.eswa.2020.113642","article-title":"Influential nodes detection in dynamic social networks: A survey","volume":"159","author":"Hafiene","year":"2020","journal-title":"Expert Syst. Appl."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Zhao, K. (2023). Existence and stability of a nonlinear distributed delayed periodic AG-ecosystem with competition on time scales. Axioms, 12.","DOI":"10.3390\/axioms12030315"}],"container-title":["Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2227-7390\/11\/15\/3299\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:19:44Z","timestamp":1760127584000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2227-7390\/11\/15\/3299"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,26]]},"references-count":32,"journal-issue":{"issue":"15","published-online":{"date-parts":[[2023,8]]}},"alternative-id":["math11153299"],"URL":"https:\/\/doi.org\/10.3390\/math11153299","relation":{},"ISSN":["2227-7390"],"issn-type":[{"type":"electronic","value":"2227-7390"}],"subject":[],"published":{"date-parts":[[2023,7,26]]}}}