Node importance identification for uncertain networks
Abstract This paper proposes the concepts of uncertain strength, uncertain degree, and uncertain clustering coefficient under uncertain networks, along with the proposes uncertain k -shell decomposition algorithm and uncertain h -index. Susceptible-Infected-Recovered (SIR) epidemic model is used to simulate the propagation process under uncertain networks. When compared to with the propagation process under uncertain k -shell decomposition algorithm and uncertain h -index, it is discovered that there are few differences among these methods. In order to find a better node importance identification algorithm, this paper combines these methods using the information entropy to form a new node importance identification method, which is called uncertain entropy method. SIR epidemic model is used to illustrate the difference among these methods.
Authors
- Wanping Li (ORCID: https://orcid.org/0000-0002-1895-5804)
- Yulin Yang (ORCID: https://orcid.org/0000-0002-3600-6346)
- Yuhong Sheng (ORCID: https://orcid.org/0000-0001-7268-8519)
Institutions
- Xinjiang University (CN)
Publication Details
- Journal
- Soft Computing
- Published
- 2026-11-04
- DOI
- https://doi.org/10.1007/s00500-026-11568-5
- Primary Topic
- Complex Network Analysis Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China