首页|Influencer identification of dynamical networks based on an information entropy dimension reduction method
Influencer identification of dynamical networks based on an information entropy dimension reduction method
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
万方数据
维普
Identifying critical nodes or sets in large-scale networks is a fundamental scientific problem and one of the key research directions in the fields of data mining and network science when implementing network attacks,defense,repair and control.Traditional methods usually begin from the centrality,node location or the impact on the largest connected component after node destruction,mainly based on the network structure.However,these algorithms do not consider network state changes.We applied a model that combines a random connectivity matrix and minimal low-dimensional structures to represent network connectivity.By using mean field theory and information entropy to calculate node activity,we calculated the overlap between the random parts and fixed low-dimensional parts to quantify the influence of node impact on network state changes and ranked them by importance.We applied this algorithm and the proposed importance algorithm to the overall analysis and stratified analysis of the C.elegans neural network.We observed a change in the critical entropy of the network state and by utilizing the proposed method we can calculate the nodes that indirectly affect muscle cells through neural layers.
万方数据
维普
