{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T10:47:05Z","timestamp":1781174825531,"version":"3.54.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"16","license":[{"start":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T00:00:00Z","timestamp":1648425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T00:00:00Z","timestamp":1648425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502053"],"award-info":[{"award-number":["61502053"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s00521-022-07168-7","type":"journal-article","created":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T00:03:54Z","timestamp":1648512234000},"page":"13455-13468","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["An information propagation model for social networks based on continuous-time quantum walk"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8532-1978","authenticated-orcid":false,"given":"Fei","family":"Yan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wen","family":"Liang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kaoru","family":"Hirota","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,3,28]]},"reference":[{"key":"7168_CR1","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.chaos.2018.12.017","volume":"119","author":"KMA Kabir","year":"2019","unstructured":"Kabir KMA, Kuga K, Tanimoto J (2019) Analysis of SIR epidemic model with information spreading of awareness. Chaos Solitons Fractals 119:118\u2013125","journal-title":"Chaos Solitons Fractals"},{"key":"7168_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-12528-8","volume-title":"Broad learning through fusions\u2014an application on social networks","author":"J Zhang","year":"2019","unstructured":"Zhang J, Yu PS (2019) Broad learning through fusions\u2014an application on social networks. Springer, New York"},{"key":"7168_CR3","volume-title":"Information and influence propagation in social networks","author":"W Chen","year":"2013","unstructured":"Chen W, Lakshmanan LVS, Castillo C (2013) Information and influence propagation in social networks. Morgan and Claypool Publishers, New York"},{"issue":"2","key":"7168_CR4","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.ins.2020.12.091","volume":"558","author":"Q He","year":"2021","unstructured":"He Q, Sun L, Wang X, Wang Z, Ma L (2021) Positive opinion maximization in signed social networks. Inf Sci 558(2):34\u201349","journal-title":"Inf Sci"},{"key":"7168_CR5","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.ins.2021.02.063","volume":"564","author":"L Chen","year":"2021","unstructured":"Chen L, Zhang Y, Chen Y, Li B, Liu W (2021) Negative influence blocking maximization with uncertain sources under the independent cascade model. Inf Sci 564:343\u2013367","journal-title":"Inf Sci"},{"key":"7168_CR6","doi-asserted-by":"crossref","unstructured":"Zarezade A, Khodadadi A, Farajtabar M, Rabiee HR, Zha H (2017) Correlated cascades: compete or cooperate. In: Proceedings of the 31th AAAI conference on artificial intelligence, vol 31. AAAI Press, San Francisco, pp 238\u2013244","DOI":"10.1609\/aaai.v31i1.10483"},{"issue":"1","key":"7168_CR7","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s11135-016-0465-4","volume":"52","author":"E Khadangi","year":"2018","unstructured":"Khadangi E, Bagheri A, Zarean A (2018) Empirical analysis of structural properties, macroscopic and microscopic evolution of various facebook activity networks. Qual Quant 52(1):249\u2013275","journal-title":"Qual Quant"},{"issue":"17","key":"7168_CR8","doi-asserted-by":"publisher","first-page":"13491","DOI":"10.1007\/s00521-020-04756-3","volume":"32","author":"C Zhan","year":"2020","unstructured":"Zhan C, Wu F, Huang Z, Jiang W, Zhang Q (2020) Analysis of collective action propagation with multiple recurrences. Neural Comput Appl 32(17):13491\u201313504","journal-title":"Neural Comput Appl"},{"issue":"9","key":"7168_CR9","doi-asserted-by":"publisher","first-page":"4507","DOI":"10.1007\/s00521-018-3686-8","volume":"32","author":"C Zhan","year":"2020","unstructured":"Zhan C, Li B, Zhong X, Min H, Wu Z (2020) A model for collective behaviour propagation: a case study of video game industry. Neural Comput Appl 32(9):4507\u20134517","journal-title":"Neural Comput Appl"},{"key":"7168_CR10","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.physa.2016.07.034","volume":"464","author":"C Zhan","year":"2016","unstructured":"Zhan C, Chi KT, Small M (2016) A general stochastic model for studying time evolution of transition networks. Physica A 464:198\u2013210","journal-title":"Physica A"},{"issue":"772","key":"7168_CR11","first-page":"700","volume":"115","author":"WO Kermack","year":"1927","unstructured":"Kermack WO, McKendrick AG (1927) A contribution to the mathematical theory of epidemics. Proc Roy Soc Lond Ser A Contain Pap Math Phys Charact 115(772):700\u2013721","journal-title":"Proc Roy Soc Lond Ser A Contain Pap Math Phys Charact"},{"key":"7168_CR12","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg JM, 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. ACM, Washington, DC, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"issue":"4","key":"7168_CR13","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1137\/S0036144500371907","volume":"42","author":"HW Herbert","year":"2000","unstructured":"Herbert HW (2000) The mathematics of infectious diseases. SIAM Rev 42(4):599\u2013653","journal-title":"SIAM Rev"},{"key":"7168_CR14","doi-asserted-by":"publisher","first-page":"050901","DOI":"10.1103\/PhysRevE.69.050901","volume":"69","author":"E Ben-Naim","year":"2004","unstructured":"Ben-Naim E, Krapivsky PL (2004) Size of outbreaks near the epidemic threshold. Phys Rev E 69:050901","journal-title":"Phys Rev E"},{"key":"7168_CR15","doi-asserted-by":"crossref","unstructured":"Ma H, Yang H, Lyu MR, King I (2008) Mining social networks using heat diffusion processes for marketing candidates selection. In: Proceedings of the 17th ACM conference on information and knowledge management. ACM, Napa Valley, pp 233\u2013242","DOI":"10.1145\/1458082.1458115"},{"key":"7168_CR16","doi-asserted-by":"crossref","unstructured":"AlSuwaidan L, Ykhlef M (2017) A novel information diffusion model for online social networks. In: Proceedings of the 19th international conference on information integration and web-based applications & services. ACM, Salzburg, pp 116\u2013120","DOI":"10.1145\/3151759.3151812"},{"key":"7168_CR17","unstructured":"Pierre P, Jennifer H, Zheng W, Michal V (2020) Budgeted online influence maximization. In: Proceedings of the 37th international conference on machine learning, volume 119 of proceedings of machine learning research. PMLR, Vienna, pp 7620\u20137631"},{"key":"7168_CR18","doi-asserted-by":"crossref","unstructured":"Bourigault S, Lamprier S, Gallinari P (2016) Representation learning for information diffusion through social networks: an embedded cascade model. In: Proceedings of the ninth ACM international conference on web search and data mining. ACM, San Francisco, pp 573\u2013582","DOI":"10.1145\/2835776.2835817"},{"key":"7168_CR19","doi-asserted-by":"crossref","unstructured":"Panagopoulos G, Malliaros F, Vazirgiannis M (2020) Multi-task learning for influence estimation and maximization. IEEE Trans Knowl Data Eng 1\u201313","DOI":"10.1109\/TKDE.2020.3040028"},{"issue":"2","key":"7168_CR20","doi-asserted-by":"publisher","first-page":"022227","DOI":"10.1103\/PhysRevA.102.022227","volume":"102","author":"S Chakraborty","year":"2020","unstructured":"Chakraborty S, Novo L, Roland J (2020) Finding a marked node on any graph via continuous-time quantum walks. Phys Rev A 102(2):022227","journal-title":"Phys Rev A"},{"issue":"5","key":"7168_CR21","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1007\/s11128-012-0432-5","volume":"11","author":"SE Venegas-Andraca","year":"2012","unstructured":"Venegas-Andraca SE (2012) Quantum walks: a comprehensive review. Quantum Inf Process 11(5):1015\u20131106","journal-title":"Quantum Inf Process"},{"issue":"6545","key":"7168_CR22","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1126\/science.abg7812","volume":"372","author":"M Gong","year":"2021","unstructured":"Gong M, Wang S, Zha C, Chen M, Huang H, Wu Y, Zhu Q, Zhao Y, Li S, Guo S, Qian H, Ye Y, Chen F, Ying C, Yu J, Fan D, Wu D, Su H, Deng H, Rong H, Zhang K, Cao S, Lin J, Xu Y, Sun L, Guo C, Li N, Liang F, Bastidas VM, Nemoto K, Munro WJ, Huo Y, Lu C, Peng C, Zhu X, Pan J (2021) Quantum walks on a programmable two-dimensional 62-qubit superconducting processor. Science 372(6545):948\u2013952","journal-title":"Science"},{"issue":"15","key":"7168_CR23","doi-asserted-by":"publisher","first-page":"150502","DOI":"10.1103\/PhysRevLett.103.150502","volume":"103","author":"AW Harrow","year":"2009","unstructured":"Harrow AW, Hassidim A, Lloyd S (2009) Quantum algorithm for linear systems of equations. Phys Rev Lett 103(15):150502","journal-title":"Phys Rev Lett"},{"issue":"4","key":"7168_CR24","doi-asserted-by":"publisher","first-page":"042317","DOI":"10.1103\/PhysRevA.83.042317","volume":"83","author":"SD Berry","year":"2011","unstructured":"Berry SD, Wang JB (2011) Two-particle quantum walks: entanglement and graph isomorphism testing. Phys Rev A 83(4):042317","journal-title":"Phys Rev A"},{"issue":"1","key":"7168_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-016-1456-z","volume":"16","author":"T Loke","year":"2017","unstructured":"Loke T, Tang J, Rodriguez J, Small M, Wang J (2017) Comparing classical and quantum PageRanks. Quantum Inf Process 16(1):1\u201322","journal-title":"Quantum Inf Process"},{"issue":"17","key":"7168_CR26","doi-asserted-by":"publisher","first-page":"023378","DOI":"10.1103\/PhysRevResearch.2.023378","volume":"2","author":"K Mukai","year":"2020","unstructured":"Mukai K, Hatano N (2020) Discrete-time quantum walk on complex networks for community detection. Phys Rev Res 2(17):023378","journal-title":"Phys Rev Res"},{"issue":"2","key":"7168_CR27","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/s00220-009-0930-1","volume":"294","author":"AM Childs","year":"2010","unstructured":"Childs AM (2010) On the relationship between continuous-and discrete-time quantum walk. Commun Math Phys 294(2):581\u2013603","journal-title":"Commun Math Phys"},{"issue":"3","key":"7168_CR28","doi-asserted-by":"publisher","first-page":"032318","DOI":"10.1103\/PhysRevA.95.032318","volume":"95","author":"JA Izaac","year":"2017","unstructured":"Izaac JA, Zhan X, Bian Z, Wang K, Wang J (2017) Centrality measure based on continuous-time quantum walks and experimental realization. Phys Rev A 95(3):032318","journal-title":"Phys Rev A"},{"key":"7168_CR29","doi-asserted-by":"crossref","unstructured":"Rossi RA, Ahmed NK (2015) The network data repository with interactive graph analytics and visualization. In: Proceedings of the 29th AAAI conference on artificial intelligence, volume\u00a029. AAAI Press, Austin, pp 4292\u20134293","DOI":"10.1609\/aaai.v29i1.9277"},{"issue":"16","key":"7168_CR30","first-page":"289","volume":"65","author":"Z Han","year":"2016","unstructured":"Han Z, Chen Y, Li M (2016) An efficient node influence metric based on triangle in complex networks. J Chin Phys 65(16):289\u2013300","journal-title":"J Chin Phys"},{"issue":"1\u20137","key":"7168_CR31","first-page":"107","volume":"30","author":"B Sergey","year":"1998","unstructured":"Sergey B, Lawrence P (1998) The anatomy of a large-scale hypertextual web search engine. Comput Netw 30(1\u20137):107\u2013117","journal-title":"Comput Netw"},{"issue":"11","key":"7168_CR32","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak M, Gallos LK, Havlin S, Liljeros F, Muchnik L, Stanley HE, Makse HA (2010) Identification of influential spreaders in complex networks. Nat Phys 6(11):888\u2013893","journal-title":"Nat Phys"},{"issue":"1","key":"7168_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep02773","volume":"3","author":"GD Paparo","year":"2013","unstructured":"Paparo GD, Mller M, Comellas F, Martin-Delgado MA (2013) Quantum google in a complex network. Sci Rep 3(1):1\u201316","journal-title":"Sci Rep"},{"issue":"1","key":"7168_CR34","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","volume":"27","author":"ME Newman","year":"2005","unstructured":"Newman ME (2005) A measure of betweenness centrality based on random walks. Soc Netw 27(1):39\u201354","journal-title":"Soc Netw"},{"key":"7168_CR35","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining, KDD. ACM, New York, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"7168_CR36","doi-asserted-by":"publisher","first-page":"12084","DOI":"10.1109\/ACCESS.2020.2966056","volume":"8","author":"L Qiu","year":"2020","unstructured":"Qiu L, Gu C, Zhang S, Tian X, Zhang M (2020) TSIM: a two-stage selection algorithm for influence maximization in social networks. IEEE Access 8:12084\u201312095","journal-title":"IEEE Access"},{"key":"7168_CR37","doi-asserted-by":"publisher","first-page":"102716","DOI":"10.1016\/j.jnca.2020.102716","volume":"166","author":"NN Daud","year":"2020","unstructured":"Daud NN, Ab Hamid SH, Saadoon M, Sahran F, Anuar NB (2020) Applications of link prediction in social networks: a review. J Netw Comput Appl 166:102716","journal-title":"J Netw Comput Appl"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07168-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-022-07168-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07168-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,24]],"date-time":"2022-07-24T10:06:09Z","timestamp":1658657169000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-022-07168-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,28]]},"references-count":37,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["7168"],"URL":"https:\/\/doi.org\/10.1007\/s00521-022-07168-7","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,28]]},"assertion":[{"value":"31 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}