A new semi-local centrality for identifying influential nodes based on local average shortest path with extended neighborhood
Sign Up to like & getrecommendations! Published in 2024 at "Artificial Intelligence Review"
DOI: 10.1007/s10462-024-10725-2
Abstract: Quantifying the importance of nodes in complex networks is known as the problem of identifying influential nodes and is considered a critical aspect in interacting with these networks. This problem has many applications such as… read more here.
Keywords: influential nodes; extended neighborhood; centrality; average shortest ... See more keywords
Scaling of average receiving time and average shortest path on claw network
Sign Up to like & getrecommendations! Published in 2020 at "Physica Scripta"
DOI: 10.1088/1402-4896/aba3ad
Abstract: A new method is used to construct the claw network. The weight of edge in next generation on claw network is related to the strength of the node in former generation. Then we calculate the… read more here.
Keywords: network; average receiving; receiving time; average shortest ... See more keywords
Semilocal Average Shortest Path With Augmented Graph for Identifying Influential Nodes
Sign Up to like & getrecommendations! Published in 2025 at "IEEE Transactions on Computational Social Systems"
DOI: 10.1109/tcss.2024.3443746
Abstract: Efficient identification of influential nodes is crucial in complex networks due to its significant theoretical and practical implications for information propagation and various applications. Despite numerous approaches being developed, many existing methods rely on centrality… read more here.
Keywords: influential nodes; augmented graph; average shortest; semilocal average ... See more keywords
The trapping problem and the average shortest weighted path of the weighted pseudofractal scale-free networks
Sign Up to like & getrecommendations! Published in 2019 at "International Journal of Modern Physics C"
DOI: 10.1142/s0129183119500104
Abstract: In this paper, we study the trapping time in the weighted pseudofractal scale-free networks (WPSFNs) and the average shortest weighted path in the modified weighted pseudofractal scale-free networks (MWPSFNs) with the weight factor [Formula: see… read more here.
Keywords: shortest weighted; weighted path; weighted pseudofractal; average shortest ... See more keywords