Big networks: A survey

HD Bedru, S Yu, X Xiao, D Zhang, L Wan, H Guo… - Computer Science …, 2020 - Elsevier
A network is a typical expressive form of representing complex systems in terms of vertices
and links, in which the pattern of interactions amongst components of the network is intricate …

Influential spreaders identification in complex networks with improved k-shell hybrid method

G Maji, A Namtirtha, A Dutta, MC Malta - Expert Systems with Applications, 2020 - Elsevier
Identifying influential spreaders in a complex network has practical and theoretical
significance. In applications such as disease spreading, virus infection in computer …

Weighted kshell degree neighborhood: A new method for identifying the influential spreaders from a variety of complex network connectivity structures

A Namtirtha, A Dutta, B Dutta - Expert Systems with Applications, 2020 - Elsevier
Due to the fast and worldwide growth of the social network, it has become a potent platform
for broadcasting any information. Through the network, people can easily reach to a mass …

[HTML][HTML] Computing influential nodes using the nearest neighborhood trust value and pagerank in complex networks

K Hajarathaiah, MK Enduri, S Anamalamudi… - Entropy, 2022 - mdpi.com
Computing influential nodes gets a lot of attention from many researchers for information
spreading in complex networks. It has vast applications, such as viral marketing, social …

Distance-aware optimization model for influential nodes identification in social networks with independent cascade diffusion

N Binesh, M Ghatee - Information Sciences, 2021 - Elsevier
Influence maximization (IM) is a challenge in social networks, which depends on the
spreader selection. We propose a quadratic programming model to identify a fixed number …

IMPC: Influence maximization based on multi-neighbor potential in community networks

J Shang, H Wu, S Zhou, J Zhong, Y Feng… - Physica A: Statistical …, 2018 - Elsevier
The study of influence maximization (IM) has attracted many scholars in recent years due to
its import practical values. Given a social network, it aims at finding a subset of k individuals …

An adaptive heuristic clustering algorithm for influence maximization in complex networks

PL Yang, GQ Xu, Q Yu, JW Guo - Chaos: An Interdisciplinary Journal of …, 2020 - pubs.aip.org
Influence maximization research in the real world allows us to better understand, accelerate
spreading processes for innovations and products, and effectively analyze, predict, and …

[HTML][HTML] Spatial super-spreaders and super-susceptibles in human movement networks

WCB Chin, R Bouffanais - Scientific reports, 2020 - nature.com
As lockdowns and stay-at-home orders start to be lifted across the globe, governments are
struggling to establish effective and practical guidelines to reopen their economies. In dense …

SIRQU: Dynamic quarantine defense model for online rumor propagation control

Z Liu, T Qin, Q Sun, S Li, HH Song… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
Rumors can spread very rapidly through online social networks (OSNs), leading to huge
negative impact on human society. Hence, there is an urgent need to develop models that …

Efficient algorithm for finding the influential nodes using local relative change of average shortest path

K Hajarathaiah, MK Enduri, S Anamalamudi - Physica A: Statistical …, 2022 - Elsevier
In complex networks, finding the influential nodes playing a crucial role in theoretical and
practical point of view because they are capable of propagating information to large portion …