Node importance identification for uncertain networks
preprint
OA: closed
Abstract
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.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00