Characterizing the Interactions Between Classical and Community-aware Centrality Measures in Complex Networks

• URL: http://arxiv.org/abs/2105.07233v1
• Date: Sat, 15 May 2021 14:36:06 GMT
• Title: Characterizing the Interactions Between Classical and Community-aware Centrality Measures in Complex Networks
• Authors: Stephany Rajeh, Marinette Savonnet, Eric Leclercq, and Hocine Cherifi
• Abstract summary: 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.
• Score: 1.5784415474429137
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Identifying vital nodes in networks exhibiting a community structure is a fundamental issue. Indeed, community structure is one of the main properties of real-world networks. Recent works have shown that community-aware centrality measures compare favorably with classical measures agnostic about this ubiquitous property. Nonetheless, there is no clear consensus about how they relate and in which situation it is better to use a classical or a community-aware centrality measure. To this end, in this paper, we perform an extensive investigation to get a better understanding of the relationship between classical and community-aware centrality measures reported in the literature. Experiments use artificial networks with controlled community structure properties and a large sample of real-world networks originating from various domains. Results indicate that the stronger the community structure, the more appropriate the community-aware centrality measures. Furthermore, variations of the degree and community size distribution parameters do not affect the results. Finally, network transitivity and community structure strength are the most significant drivers controlling the interactions between classical and community-aware centrality measures.

Related papers

• Enhancing Community Detection in Networks: A Comparative Analysis of Local Metrics and Hierarchical Algorithms [49.1574468325115]
  This study employs the same method to evaluate the relevance of using local similarity metrics for community detection. The efficacy of these metrics was evaluated by applying the base algorithm to several real networks with varying community sizes.
  arXiv  Detail & Related papers  (2024-08-17T02:17:09Z)
• Comparative evaluation of community-aware centrality measures [1.7243339961137643]
  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.
  arXiv  Detail & Related papers  (2022-05-14T07:43:26Z)
• This Must Be the Place: Predicting Engagement of Online Communities in a Large-scale Distributed Campaign [70.69387048368849]
  We study the behavior of communities with millions of active members. We develop a hybrid model, combining textual cues, community meta-data, and structural properties. We demonstrate the applicability of our model through Reddit's r/place a large-scale online experiment.
  arXiv  Detail & Related papers  (2022-01-14T08:23:16Z)
• 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)
• 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)
• A game-theoretic analysis of networked system control for common-pool resource management using multi-agent reinforcement learning [54.55119659523629]
  Multi-agent reinforcement learning has recently shown great promise as an approach to networked system control. Common-pool resources include arable land, fresh water, wetlands, wildlife, fish stock, forests and the atmosphere.
  arXiv  Detail & Related papers  (2020-10-15T14:12:26Z)
• 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)
• Community detection and Social Network analysis based on the Italian wars of the 15th century [0.0]
  We study social network modelling by using human interaction as a basis. We propose a new set of functions, affinities, designed to capture the nature of the local interactions among each pair of actors in a network. We develop a new community detection algorithm, the Borgia Clustering, where communities naturally arise from the multi-agent interaction in the network.
  arXiv  Detail & Related papers  (2020-07-06T11:05:07Z)
• 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.