Tang Pingchuan, Song Chuancheng, Ding Weiwei, Ma Junkai, Dong Jun, Huang Liya
College of Electronic and Optical Engineering & College of Microelectronics, Nanjing University of Posts and Telecommunications, Nanjing 210023, China.
Bell Honors School, Nanjing University of Posts and Telecommunications, Nanjing 210023, China.
Entropy (Basel). 2020 Mar 22;22(3):364. doi: 10.3390/e22030364.
To describe both the global and local characteristics of a network more comprehensively, we propose the weighted -order propagation number (WKPN) algorithm to extract the disease propagation based on the network topology to evaluate the node importance. Each node is set as the source of infection, and the total number of infected nodes is defined as the -order propagation number after experiencing the propagation time . The simulation of the symmetric network with bridge nodes indicated that the WKPN algorithm was more effective for evaluation of the algorithm features. A deliberate attack strategy, which indicated an attack on the network according to the node importance from high to low, was employed to evaluate the WKPN algorithm in real networks. Compared with the other methods tested, the results demonstrate the applicability and advancement that a lower number of nodes, with a higher importance calculated by the -order propagation number algorithm, has to achieve full damage to the network structure.
为了更全面地描述网络的全局和局部特征，我们提出了加权序传播数（WKPN）算法，以基于网络拓扑结构提取疾病传播情况，从而评估节点重要性。将每个节点设置为感染源，并将经过传播时间 后被感染节点的总数定义为序传播数。对具有桥接节点的对称网络进行的模拟表明，WKPN算法在评估算法特征方面更有效。采用一种蓄意攻击策略，即根据节点重要性从高到低对网络进行攻击，以在实际网络中评估WKPN算法。与测试的其他方法相比，结果表明，通过序传播数算法计算出的重要性较高的较少节点数就能对网络结构造成完全破坏，这证明了该算法的适用性和先进性。
