scispace - formally typeset
Open AccessJournal ArticleDOI

On community structure in complex networks: challenges and opportunities

Reads0
Chats0
TLDR
This work focuses on generative models of communities in complex networks and their role in developing strong foundation for community detection algorithms, and introduces deterministic strategies that have proven to be very efficient in controlling the epidemic outbreaks, but require complete knowledge of the network.
Abstract
Community structure is one of the most relevant features encountered in numerous real-world applications of networked systems. Despite the tremendous effort of a large interdisciplinary community of scientists working on this subject over the past few decades to characterize, model, and analyze communities, more investigations are needed in order to better understand the impact of community structure and its dynamics on networked systems. Here, we first focus on generative models of communities in complex networks and their role in developing strong foundation for community detection algorithms. We discuss modularity and the use of modularity maximization as the basis for community detection. Then, we follow with an overview of the Stochastic Block Model and its different variants as well as inference of community structures from such models. Next, we focus on time evolving networks, where existing nodes and links can disappear, and in parallel new nodes and links may be introduced. The extraction of communities under such circumstances poses an interesting and non-trivial problem that has gained considerable interest over the last decade. We briefly discuss considerable advances made in this field recently. Finally, we focus on immunization strategies essential for targeting the influential spreaders of epidemics in modular networks. Their main goal is to select and immunize a small proportion of individuals from the whole network to control the diffusion process. Various strategies have emerged over the years suggesting different ways to immunize nodes in networks with overlapping and non-overlapping community structure. We first discuss stochastic strategies that require little or no information about the network topology at the expense of their performance. Then, we introduce deterministic strategies that have proven to be very efficient in controlling the epidemic outbreaks, but require complete knowledge of the network.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

A review of stochastic block models and extensions for graph clustering

TL;DR: Different approaches and extensions proposed for different aspects in model-based clustering of graphs, such as the type of the graph, the clustering approach, the inference approach, and whether the number of groups is selected or estimated are reviewed.
Journal ArticleDOI

Measuring Node Contribution to Community Structure With Modularity Vitality

TL;DR: In this paper, a community-aware centrality measure called modularity vitality is proposed, which quantifies positive and negative contributions to community structure, which indicate a node's role as a community bridge or hub.
Journal ArticleDOI

The vulnerability of communities in complex networks: An entropy approach

TL;DR: Considering community vulnerability from the perspective of entropy provides a new solution to such problem and, due to sufficient consideration of community information, more reasonable vulnerability result can be obtained.
Journal ArticleDOI

Toward epidemic thresholds on temporal networks: a review and open questions

TL;DR: The authors provide an overview of methods to predict the epidemic threshold for temporal contact network models, and discuss areas that remain unexplored, as well as some areas that need to be explored.
Journal ArticleDOI

Interplay Between Hierarchy and Centrality in Complex Networks

TL;DR: Results show that network density and transitivity play a key role in shaping the redundancy between centrality and hierarchy measures.
References
More filters
Journal ArticleDOI

Equation of state calculations by fast computing machines

TL;DR: In this article, a modified Monte Carlo integration over configuration space is used to investigate the properties of a two-dimensional rigid-sphere system with a set of interacting individual molecules, and the results are compared to free volume equations of state and a four-term virial coefficient expansion.
Journal ArticleDOI

Community structure in social and biological networks

TL;DR: This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.
Journal ArticleDOI

Fast unfolding of communities in large networks

TL;DR: In this paper, the authors proposed a simple method to extract the community structure of large networks based on modularity optimization, which is shown to outperform all other known community detection methods in terms of computation time.
Journal ArticleDOI

Modularity and community structure in networks

TL;DR: In this article, the modularity of a network is expressed in terms of the eigenvectors of a characteristic matrix for the network, which is then used for community detection.
Book

Random Graphs

Related Papers (5)
Trending Questions (1)
What are the challenges and opportunities of designing a linear mixed-use community complex?

The provided paper is about community structure in complex networks and does not discuss the challenges and opportunities of designing a linear mixed-use community complex.