Research on the Node Importance of a Weighted Network Based on the
| Autor: | Weiwei Ding, Junkai Ma, Liya Huang, Chuancheng Song, Jun Dong, Pingchuan Tang |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Propagation time
Computer science General Physics and Astronomy lcsh:Astrophysics Network topology K-order propagation number 01 natural sciences Bridge (interpersonal) Article 010305 fluids & plasmas Set (abstract data type) complex network lcsh:QB460-466 0103 physical sciences node importance lcsh:Science 010306 general physics Node (networking) Order (ring theory) Complex network lcsh:QC1-999 disease propagation lcsh:Q Weighted network Algorithm lcsh:Physics |
| Zdroj: | Entropy Volume 22 Issue 3 Entropy, Vol 22, Iss 3, p 364 (2020) |
| ISSN: | 1099-4300 |
| Popis: | To describe both the global and local characteristics of a network more comprehensively, we propose the weighted K-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 K-order propagation number after experiencing the propagation time K. 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 K-order propagation number algorithm, has to achieve full damage to the network structure. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|