Corrigendum: Cyber‐physical component ranking for risk sensitivity analysis using betweenness centrality
نویسندگان
چکیده
IET Cyber-Physical Systems: Theory & ApplicationsVolume 7, Issue 2 p. 112-112 CORRIGENDUMOpen Access Corrigendum: Cyber-physical component ranking for risk sensitivity analysis using betweenness centrality This article corrects the following: Amarachi Umunnakwe, Abhijeet Sahu, Mohammad Rasoul Narimani, Katherine Davis, Saman Zonouz, Volume 6Issue 3IET Applications pages: 139-150 First Published online: April 21, 2021 Corresponding Author Umunnakwe [email protected] Correspondence Email: [email protected] more papers by this author published: 15 June 2022 https://doi.org/10.1049/cps2.12025AboutSectionsPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text full-text accessPlease review our Terms and Conditions of Use check box below share version article.I have read accept Wiley Online Library UseShareable LinkUse link a with your friends colleagues. Learn more.Copy URL Share linkShare onFacebookTwitterLinked InRedditWechat In article,1 authors would like inform readers that there were errors in published Equation 3. The correct is shown below: C ( e ) = min V ∀ P B v ∑ s ≠ t ∈ σ + ε × 1 , REFERENCE 1Umunnakwe, A., et al.: Cyberphysical centrality. Cyber-Phys. Syst., Appl. 6(3), 139– 150 (2021). https://doi.org/10.1049/cps2.12010 LibraryWeb Science®Google Scholar Volume7, Issue2June 2022Pages ReferencesRelatedInformation
منابع مشابه
Fully Dynamic Betweenness Centrality
We present fully dynamic algorithms for maintaining betweenness centrality (BC) of vertices in a directed graph G = (V,E) with positive edge weights. BC is a widely used parameter in the analysis of large complex networks. We achieve an amortized O(ν∗ · log n) time per update with our basic algorithm, and O(ν∗ · log n) time with a more complex algorithm, where n = |V |, and ν∗ bounds the number...
متن کاملFurther Results on Betweenness Centrality of Graphs
Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.
متن کاملApproximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently the fastest-known algorithm by Brandes requires O(nm) time for unweighted graphs and O(nm + n log n) time for weighted graphs, where n is the number of vertices and m is the number of edges in the network. These are als...
متن کاملCorrelation and Regression Analysis for Node Betweenness Centrality
In this paper, we seek to find a computationally light centrality metric that could serve as an alternate for the computationally heavy betweenness centrality (BWC) metric. In this pursuit, in the first half of the paper, we evaluate the correlation coefficient between BWC and the other commonly used centrality metrics such as Degree Centrality (DEG), Closeness Centrality (CLC), Farness Central...
متن کاملBetter Approximation of Betweenness Centrality
Estimating the importance or centrality of the nodes in large networks has recently attracted increased interest. Betweenness is one of the most important centrality indices, which basically counts the number of shortest paths going through a node. Betweenness has been used in diverse applications, e.g., social network analysis or route planning. Since exact computation is prohibitive for large...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET cyber-physical systems
سال: 2022
ISSN: ['2398-3396']
DOI: https://doi.org/10.1049/cps2.12025