On proximity and structural role-based embeddings in networks: Misconceptions, techniques, and applications
Structural roles define sets of structurally similar nodes that are more similar to nodes inside
the set than outside, whereas communities define sets of nodes with more connections …
the set than outside, whereas communities define sets of nodes with more connections …
Joint community and structural hole spanner detection via harmonic modularity
Detecting communities (or modular structures) and structural hole spanners, the nodes
bridging different communities in a network, are two essential tasks in the realm of network …
bridging different communities in a network, are two essential tasks in the realm of network …
Opinion-aware information diffusion model based on multivariate marked Hawkes process
H Zhang, Y Yao, W Tang, J Zhu, Y Zhang - Knowledge-Based Systems, 2023 - Elsevier
Currently, information diffusion on online platforms plays an important role in social
governance. Opinions contained in information have a significant influence on information …
governance. Opinions contained in information have a significant influence on information …
An efficient discrete differential evolution algorithm based on community structure for influence maximization
H Li, R Zhang, X Liu - Applied Intelligence, 2022 - Springer
As one of the main contents of influence analysis, influence maximization is selecting a
group of influential nodes with specified size in a given network to form a seed node set, and …
group of influential nodes with specified size in a given network to form a seed node set, and …
Community detection in social networks: literature review
S Rani, M Mehrotra - Journal of Information & Knowledge …, 2019 - World Scientific
Due to easy and cost-effective ways, communication has amplified many folds among
humans across the globe irrespective of time and geographic location. This has led to the …
humans across the globe irrespective of time and geographic location. This has led to the …
Influence Maximization in social networks using discretized Harris' Hawks Optimization algorithm
Influence Maximization (IM) is the task of determining k optimal influential nodes in a social
network to maximize the influence spread using a propagation model. IM is a prominent …
network to maximize the influence spread using a propagation model. IM is a prominent …
A FastMap-based algorithm for block modeling
Block modeling algorithms are used to discover important latent structures in graphs. They
are the graph equivalent of clustering algorithms. However, existing block modeling …
are the graph equivalent of clustering algorithms. However, existing block modeling …
[HTML][HTML] Influence propagation in social networks: Interest-based community ranking model
The driving force behind content dissemination in Social network (SN) is the users' interest
in the content, which is strongly reflected in their interactions. Obviously, user interest varies …
in the content, which is strongly reflected in their interactions. Obviously, user interest varies …
Closeness centrality for networks with overlapping community structure
Certain real-life networks have a community structure in which communities overlap. For
example, a typical bus network includes bus stops (nodes), which belong to one or more bus …
example, a typical bus network includes bus stops (nodes), which belong to one or more bus …
An adaptive discrete particle swarm optimization for influence maximization based on network community structure
As an important research field of social network analysis, influence maximization problem is
targeted at selecting a small group of influential nodes such that the spread of influence …
targeted at selecting a small group of influential nodes such that the spread of influence …