Comparative evaluation of community-aware centrality measures

• URL: http://arxiv.org/abs/2205.06995v1
• Date: Sat, 14 May 2022 07:43:26 GMT
• Title: Comparative evaluation of community-aware centrality measures
• Authors: Stephany Rajeh and Marinette Savonnet and Eric Leclercq and Hocine Cherifi
• Abstract summary: We investigate seven influential community-aware centrality measures in an epidemic spreading process scenario using the Susceptible-Infected-Recovered (SIR) model. Results show that generally, the correlation between community-aware centrality measures is low. In a multiple-spreader problem, when resources are available, targeting distant hubs using Modularity Vitality is more effective.
• Score: 1.7243339961137643
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Influential nodes play a critical role in boosting or curbing spreading phenomena in complex networks. Numerous centrality measures have been proposed for identifying and ranking the nodes according to their importance. Classical centrality measures rely on various local or global properties of the nodes. They do not take into account the network community structure. Recently, a growing number of researches have shifted to community-aware centrality measures. Indeed, it is a ubiquitous feature in a vast majority of real-world networks. In the literature, the focus is on designing community-aware centrality measures. However, up to now, there is no systematic evaluation of their effectiveness. This study fills this gap. It allows answering which community-aware centrality measure should be used in practical situations. We investigate seven influential community-aware centrality measures in an epidemic spreading process scenario using the Susceptible-Infected-Recovered (SIR) model on a set of fifteen real-world networks. Results show that generally, the correlation between community-aware centrality measures is low. Furthermore, in a multiple-spreader problem, when resources are available, targeting distant hubs using Modularity Vitality is more effective. However, with limited resources, diffusion expands better through bridges, especially in networks with a medium or strong community structure.

Related papers

• Networked Communication for Mean-Field Games with Function Approximation and Empirical Mean-Field Estimation [59.01527054553122]
  Decentralised agents can learn equilibria in Mean-Field Games from a single, non-episodic run of the empirical system. We introduce function approximation to the existing setting, drawing on the Munchausen Online Mirror Descent method. We additionally provide new algorithms that allow agents to estimate the global empirical distribution based on a local neighbourhood.
  arXiv  Detail & Related papers  (2024-08-21T13:32:46Z)
• The Impact of Adversarial Node Placement in Decentralized Federated Learning Networks [6.661122374160369]
  As Federated Learning (FL) grows in popularity, new decentralized frameworks are becoming widespread. This paper analyzes the performance of decentralized FL for various adversarial placement strategies when adversaries can jointly coordinate their placement within a network. We propose a novel attack algorithm that prioritizes adversarial spread over adversarial centrality by maximizing the average network distance between adversaries.
  arXiv  Detail & Related papers  (2023-11-14T06:48:50Z)
• Locality Matters: A Scalable Value Decomposition Approach for Cooperative Multi-Agent Reinforcement Learning [52.7873574425376]
  Cooperative multi-agent reinforcement learning (MARL) faces significant scalability issues due to state and action spaces that are exponentially large in the number of agents. We propose a novel, value-based multi-agent algorithm called LOMAQ, which incorporates local rewards in the Training Decentralized Execution paradigm.
  arXiv  Detail & Related papers  (2021-09-22T10:08:15Z)
• Identifying Influential Nodes in Two-mode Data Networks using Formal Concept Analysis [0.0]
  Bi-face (BF) is a new bipartite centrality measurement for identifying important nodes in two-mode networks. Unlike off-the shelf centrality indices, it quantifies how a node has a cohesive-substructure influence on its neighbour nodes via bicliques. Our experiments on several real-world and synthetic networks show the efficiency of BF over existing prominent bipartite centrality measures.
  arXiv  Detail & Related papers  (2021-09-07T23:57:05Z)
• Contingency-Aware Influence Maximization: A Reinforcement Learning Approach [52.109536198330126]
  influence (IM) problem aims at finding a subset of seed nodes in a social network that maximize the spread of influence. In this study, we focus on a sub-class of IM problems, where whether the nodes are willing to be the seeds when being invited is uncertain, called contingency-aware IM. Despite the initial success, a major practical obstacle in promoting the solutions to more communities is the tremendous runtime of the greedy algorithms.
  arXiv  Detail & Related papers  (2021-06-13T16:42:22Z)
• A Comprehensive Survey on Community Detection with Deep Learning [93.40332347374712]
  A community reveals the features and connections of its members that are different from those in other communities in a network. This survey devises and proposes a new taxonomy covering different categories of the state-of-the-art methods. The main category, i.e., deep neural networks, is further divided into convolutional networks, graph attention networks, generative adversarial networks and autoencoders.
  arXiv  Detail & Related papers  (2021-05-26T14:37:07Z)
• Characterizing the Interactions Between Classical and Community-aware Centrality Measures in Complex Networks [1.5784415474429137]
  We investigate the relationship between classical and community-aware centrality measures reported in the literature. Results indicate that the stronger the community structure, the more appropriate the community-aware centrality measures. Network transitivity and community structure strength are the most significant drivers controlling the interactions between classical and community-aware centrality measures.
  arXiv  Detail & Related papers  (2021-05-15T14:36:06Z)
• A multilevel clustering technique for community detection [0.0]
  This study presents a novel detection method based on a scalable framework to identify related communities in a network. We propose a multilevel clustering technique (MCT) that leverages structural and textual information to identify local communities termed microcosms. The approach offers a better understanding and clarity toward describing how low-level communities evolve and behave on Twitter.
  arXiv  Detail & Related papers  (2021-01-16T23:26:44Z)
• On the use of local structural properties for improving the efficiency of hierarchical community detection methods [77.34726150561087]
  We study how local structural network properties can be used as proxies to improve the efficiency of hierarchical community detection. We also check the performance impact of network prunings as an ancillary tactic to make hierarchical community detection more efficient.
  arXiv  Detail & Related papers  (2020-09-15T00:16:12Z)
• Top influencers can be identified universally by combining classical centralities [0.6853165736531939]
  No single centrality has consistently good ranking power. Certain pairs of centralities cooperate particularly well in statistically drawing the boundary between the top spreaders and the rest. nodes selected as superspreaders will usually jointly maximise the values of both centralities.
  arXiv  Detail & Related papers  (2020-06-13T15:12:28Z)
• Detecting Communities in Heterogeneous Multi-Relational Networks:A Message Passing based Approach [89.19237792558687]
  Community is a common characteristic of networks including social networks, biological networks, computer and information networks. We propose an efficient message passing based algorithm to simultaneously detect communities for all homogeneous networks.
  arXiv  Detail & Related papers  (2020-04-06T17:36:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.