{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T10:45:16Z","timestamp":1766486716477,"version":"3.40.5"},"reference-count":37,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,11,20]],"date-time":"2020-11-20T00:00:00Z","timestamp":1605830400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2017YFC0820603","31511040103"],"award-info":[{"award-number":["2017YFC0820603","31511040103"]}]},{"name":"Advance Research Project of Shared Information System","award":["2017YFC0820603","31511040103"],"award-info":[{"award-number":["2017YFC0820603","31511040103"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2020,11,20]]},"abstract":"<jats:p>In recent years, while extensive researches on various networks properties have been proposed and accomplished, little has been proposed and done on network robustness and node vulnerability assessment under cascades in directed large-scale online community networks. In essential, an online directed social network is a group-centered and information spread-dominated online platform which is very different from the traditional undirected social network. Some further research studies have indicated that the online social network has high robustness to random removals of nodes but fails to the intentional attacks, particularly to those attacks based on node betweenness or node directed coefficient. To explore on the robustness of directed social network, in this article, we have proposed two novel node centralities of ITG (information transfer gain-based probability clustering coefficient) and <jats:inline-formula>\n                     <a:math xmlns:a=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\">\n                        <a:mi>I<\/a:mi>\n                        <a:msub>\n                           <a:mrow>\n                              <a:mi>M<\/a:mi>\n                           <\/a:mrow>\n                           <a:mrow>\n                              <a:mi>p<\/a:mi>\n                           <\/a:mrow>\n                        <\/a:msub>\n                        <a:mfenced open=\"(\" close=\")\" separators=\"|\">\n                           <a:mrow>\n                              <a:mi>v<\/a:mi>\n                           <\/a:mrow>\n                        <\/a:mfenced>\n                     <\/a:math>\n                  <\/jats:inline-formula> (directed path-based node importance centrality). These two new centrality models are designed to capture this cascading effect in directed online social networks. Furthermore, we also propose a new and highly efficient computing method based on iterations for <jats:inline-formula>\n                     <f:math xmlns:f=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M2\">\n                        <f:mi>I<\/f:mi>\n                        <f:msub>\n                           <f:mrow>\n                              <f:mi>M<\/f:mi>\n                           <\/f:mrow>\n                           <f:mrow>\n                              <f:mi>p<\/f:mi>\n                           <\/f:mrow>\n                        <\/f:msub>\n                        <f:mfenced open=\"(\" close=\")\" separators=\"|\">\n                           <f:mrow>\n                              <f:mi>v<\/f:mi>\n                           <\/f:mrow>\n                        <\/f:mfenced>\n                     <\/f:math>\n                  <\/jats:inline-formula>. Then, with the abundant experiments on the synthetic signed network and real-life networks derived from directed online social media and directed human mobile phone calling network, it has been proved that our ITG and <jats:inline-formula>\n                     <k:math xmlns:k=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M3\">\n                        <k:mi>I<\/k:mi>\n                        <k:msub>\n                           <k:mrow>\n                              <k:mi>M<\/k:mi>\n                           <\/k:mrow>\n                           <k:mrow>\n                              <k:mi>p<\/k:mi>\n                           <\/k:mrow>\n                        <\/k:msub>\n                        <k:mfenced open=\"(\" close=\")\" separators=\"|\">\n                           <k:mrow>\n                              <k:mi>v<\/k:mi>\n                           <\/k:mrow>\n                        <\/k:mfenced>\n                     <\/k:math>\n                  <\/jats:inline-formula> based on directed social network robustness and node vulnerability assessment method is more accurate, efficient, and faster than several traditional centrality methods such as degree and betweenness. And we also have proposed the solid reasoning and proof process of iteration times <jats:inline-formula>\n                     <p:math xmlns:p=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M4\">\n                        <p:mi>k<\/p:mi>\n                     <\/p:math>\n                  <\/jats:inline-formula> in computation of <jats:inline-formula>\n                     <r:math xmlns:r=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M5\">\n                        <r:mi>I<\/r:mi>\n                        <r:msub>\n                           <r:mrow>\n                              <r:mi>M<\/r:mi>\n                           <\/r:mrow>\n                           <r:mrow>\n                              <r:mi>p<\/r:mi>\n                           <\/r:mrow>\n                        <\/r:msub>\n                        <r:mfenced open=\"(\" close=\")\" separators=\"|\">\n                           <r:mrow>\n                              <r:mi>v<\/r:mi>\n                           <\/r:mrow>\n                        <\/r:mfenced>\n                     <\/r:math>\n                  <\/jats:inline-formula>. To the best knowledge of us, our research has drawn some new light on the leading edge of robustness on the directed social network.<\/jats:p>","DOI":"10.1155\/2020\/8715619","type":"journal-article","created":{"date-parts":[[2020,11,22]],"date-time":"2020-11-22T00:50:10Z","timestamp":1606006210000},"page":"1-14","source":"Crossref","is-referenced-by-count":2,"title":["Novel Node Centrality-Based Efficient Empirical Robustness Assessment for Directed Network"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8847-7174","authenticated-orcid":true,"given":"Xiaolong","family":"Deng","sequence":"first","affiliation":[{"name":"Key Lab of Trustworthy Distributed Computing and Service of Education Ministry, Beijing University of Post and Telecommunication, Beijing 100876, China"}]},{"given":"Hao","family":"Ding","sequence":"additional","affiliation":[{"name":"Key Lab of Trustworthy Distributed Computing and Service of Education Ministry, Beijing University of Post and Telecommunication, Beijing 100876, China"}]},{"given":"Yong","family":"Chen","sequence":"additional","affiliation":[{"name":"North Automatic Control Technology Institute, Taiyuan, China"}]},{"given":"Cai","family":"Chen","sequence":"additional","affiliation":[{"name":"China Academy of Information and Communications Technology (CAICT), Beijing 100037, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4127-2419","authenticated-orcid":true,"given":"Tiejun","family":"Lv","sequence":"additional","affiliation":[{"name":"Key Lab of Trustworthy Distributed Computing and Service of Education Ministry, Beijing University of Post and Telecommunication, Beijing 100876, China"}]}],"member":"311","reference":[{"first-page":"4981","article-title":"Deep learning for community detection: progress, challenges and opportunities","author":"F. Liu","key":"1"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.100.138701"},{"issue":"1","key":"3","first-page":"31","article-title":"A brief review of complex networks","volume":"34","author":"T. Zhou","year":"2005","journal-title":"Physics"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/110\/68006"},{"volume-title":"Network Management: Principles and Practice","year":"2010","author":"M. Subramanian","key":"5"},{"first-page":"3395","article-title":"Cascading failures in scale-free coupled map lattices","author":"J. Xu","key":"6"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.74.036104"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.65.056109"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2007.190733"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1038\/nature16948"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2013.2297923"},{"issue":"3","key":"12","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1109\/TCYB.2014.2327111","article-title":"Boosting for multi-graph classification","volume":"45","author":"J. Wu","year":"2015","journal-title":"IEEE Transactions on Cybernetics"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1038\/35019019"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.85.4626"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1561\/106.00000003"},{"key":"16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511780356","volume-title":"Complex Networks: Structure, Robustness and Function","author":"R. Cohen","year":"2010"},{"first-page":"39","article-title":"Social resilience in online communities: the autopsy of friendster","author":"D. Garcia","key":"17"},{"first-page":"233","article-title":"Arrival and departure dynamics in social networks","author":"S. Wu","key":"18"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1038\/nphys1746"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1126\/science.1225244"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1038\/nphys2327"},{"key":"22","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511811395","volume-title":"Models and Methods in Social Network Analysis","author":"J. S. Carrington","year":"2005"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1080\/00018730601170527"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2008.06.007"},{"key":"25","unstructured":"PageL.BrinS.MotwaniR.WinogradT.The pagerank citation ranking: bringing order to the web1999Stanford, CA, USAStanford InfoLabTechnical Report"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"volume-title":"Computer Science Theory for the Information Age","year":"2013","author":"J. Hopcroft","key":"27"},{"first-page":"570","article-title":"Graph regularized transductive classification on heterogeneous information networks","author":"M. Ji","key":"28"},{"volume-title":"Probabilistic Reasoning in Intelligent Systems, Representation and Reasoning","year":"1988","author":"J. Pearl","key":"29"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/access.2017.2740962"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2015.10.142"},{"first-page":"1","article-title":"Community detection algorithms: a comparative analysis: invited presentation, extended abstract","author":"S. Fortunato","key":"32"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0018961"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0706851105"},{"volume-title":"Mining the Web: Analysis","year":"2002","author":"S. Chakrabarti","key":"35"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"37","first-page":"539","article-title":"Learning to discover social circles in ego networks","volume-title":"Advances in Neural Information Processing Systems","author":"J. Leskovec","year":"2012"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/8715619.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/8715619.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/8715619.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,22]],"date-time":"2020-11-22T00:50:30Z","timestamp":1606006230000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2020\/8715619\/"}},"subtitle":[],"editor":[{"given":"Jia","family":"Wu","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2020,11,20]]},"references-count":37,"alternative-id":["8715619","8715619"],"URL":"https:\/\/doi.org\/10.1155\/2020\/8715619","relation":{},"ISSN":["1099-0526","1076-2787"],"issn-type":[{"type":"electronic","value":"1099-0526"},{"type":"print","value":"1076-2787"}],"subject":[],"published":{"date-parts":[[2020,11,20]]}}}