The Local Triangle Structure Centrality Method to Rank Nodes in Networks
Detecting influential spreaders had become a challenging and crucial topic so far due to its practical application in many areas, such as information propagation inhibition and disease dissemination control. Some traditional local based evaluation methods had given many discussions on ranking import...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2019-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2019/9057194 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832553397366030336 |
|---|---|
| author | Xiaojian Ma Yinghong Ma |
| author_facet | Xiaojian Ma Yinghong Ma |
| author_sort | Xiaojian Ma |
| collection | DOAJ |
| description | Detecting influential spreaders had become a challenging and crucial topic so far due to its practical application in many areas, such as information propagation inhibition and disease dissemination control. Some traditional local based evaluation methods had given many discussions on ranking important nodes. In this paper, ranking nodes of networks continues to be discussed. A semilocal structures method for ranking nodes based on the degree and the neighbors’ connections of the node is presented. The semilocal structures are regarded as the number of neighbors of the nodes and the connections between the node and its neighbors. We combined the triangle structure and the degree information of the neighbors to define the inner-outer spreading ability of the nodes and then summed the node neighbors’ inner-outer spreading ability to be used as the local triangle structure centrality (LTSC). The LTSC avoids the defect “pseudo denser connections” in measuring the structure of neighbors. The performance of the proposed LTSC method is evaluated by comparing the spreading ability on both real-world and synthetic networks with the SIR model. The simulation results of the discriminability and the correctness compared with pairs of ranks (one is generated by SIR model and the others are generated by central nodes measures) show that LTSC outperforms some other local or semilocal methods in evaluating the node’s influence in most cases, such as degree, betweenness, H-index, local centrality, local structure centrality, K-shell, and S-shell. The experiments prove that the LTSC is an efficient and accurate ranking method which provides a more reasonable evaluating index to rank nodes than some previous approaches. |
| format | Article |
| id | doaj-art-5bcb6cf256e6458a98f7f1c7e3eeca0e |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2019-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-5bcb6cf256e6458a98f7f1c7e3eeca0e2025-02-03T05:54:05ZengWileyComplexity1076-27871099-05262019-01-01201910.1155/2019/90571949057194The Local Triangle Structure Centrality Method to Rank Nodes in NetworksXiaojian Ma0Yinghong Ma1School of Business, Shandong Normal University, Jinan, Shandong, ChinaSchool of Business, Shandong Normal University, Jinan, Shandong, ChinaDetecting influential spreaders had become a challenging and crucial topic so far due to its practical application in many areas, such as information propagation inhibition and disease dissemination control. Some traditional local based evaluation methods had given many discussions on ranking important nodes. In this paper, ranking nodes of networks continues to be discussed. A semilocal structures method for ranking nodes based on the degree and the neighbors’ connections of the node is presented. The semilocal structures are regarded as the number of neighbors of the nodes and the connections between the node and its neighbors. We combined the triangle structure and the degree information of the neighbors to define the inner-outer spreading ability of the nodes and then summed the node neighbors’ inner-outer spreading ability to be used as the local triangle structure centrality (LTSC). The LTSC avoids the defect “pseudo denser connections” in measuring the structure of neighbors. The performance of the proposed LTSC method is evaluated by comparing the spreading ability on both real-world and synthetic networks with the SIR model. The simulation results of the discriminability and the correctness compared with pairs of ranks (one is generated by SIR model and the others are generated by central nodes measures) show that LTSC outperforms some other local or semilocal methods in evaluating the node’s influence in most cases, such as degree, betweenness, H-index, local centrality, local structure centrality, K-shell, and S-shell. The experiments prove that the LTSC is an efficient and accurate ranking method which provides a more reasonable evaluating index to rank nodes than some previous approaches.http://dx.doi.org/10.1155/2019/9057194 |
| spellingShingle | Xiaojian Ma Yinghong Ma The Local Triangle Structure Centrality Method to Rank Nodes in Networks Complexity |
| title | The Local Triangle Structure Centrality Method to Rank Nodes in Networks |
| title_full | The Local Triangle Structure Centrality Method to Rank Nodes in Networks |
| title_fullStr | The Local Triangle Structure Centrality Method to Rank Nodes in Networks |
| title_full_unstemmed | The Local Triangle Structure Centrality Method to Rank Nodes in Networks |
| title_short | The Local Triangle Structure Centrality Method to Rank Nodes in Networks |
| title_sort | local triangle structure centrality method to rank nodes in networks |
| url | http://dx.doi.org/10.1155/2019/9057194 |
| work_keys_str_mv | AT xiaojianma thelocaltrianglestructurecentralitymethodtoranknodesinnetworks AT yinghongma thelocaltrianglestructurecentralitymethodtoranknodesinnetworks AT xiaojianma localtrianglestructurecentralitymethodtoranknodesinnetworks AT yinghongma localtrianglestructurecentralitymethodtoranknodesinnetworks |