Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Centrality in Complex Networks with Overlapping Community Structure

View through CrossRef
AbstractIdentifying influential spreaders in networks is an essential issue in order to prevent epidemic spreading, or to accelerate information diffusion. Several centrality measures take advantage of various network topological properties to quantify the notion of influence. However, the vast majority of works ignore its community structure while it is one of the main features of many real-world networks. In a recent study, we show that the centrality of a node in a network with non-overlapping communities depends on two features: Its local influence on the nodes belonging to its community, and its global influence on the nodes belonging to the other communities. Using global and local connectivity of the nodes, we introduced a framework allowing to redefine all the classical centrality measures (designed for networks without community structure) to non-overlapping modular networks. In this paper, we extend the so-called “Modular Centrality” to networks with overlapping communities. Indeed, it is a frequent scenario in real-world networks, especially for social networks where nodes usually belong to several communities. The “Overlapping Modular Centrality” is a two-dimensional measure that quantifies the local and global influence of overlapping and non-overlapping nodes. Extensive experiments have been performed on synthetic and real-world data using the Susceptible-Infected-Recovered (SIR) epidemic model. Results show that the Overlapping Modular Centrality outperforms its alternatives designed for non-modular networks. These investigations provide better knowledge on the influence of the various parameters governing the overlapping community structure on the nodes’ centrality. Additionally, two combinations of the components of the Overlapping Modular Centrality are evaluated. Comparative analysis with competing methods shows that they produce more efficient centrality scores.
Title: Centrality in Complex Networks with Overlapping Community Structure
Description:
AbstractIdentifying influential spreaders in networks is an essential issue in order to prevent epidemic spreading, or to accelerate information diffusion.
Several centrality measures take advantage of various network topological properties to quantify the notion of influence.
However, the vast majority of works ignore its community structure while it is one of the main features of many real-world networks.
In a recent study, we show that the centrality of a node in a network with non-overlapping communities depends on two features: Its local influence on the nodes belonging to its community, and its global influence on the nodes belonging to the other communities.
Using global and local connectivity of the nodes, we introduced a framework allowing to redefine all the classical centrality measures (designed for networks without community structure) to non-overlapping modular networks.
In this paper, we extend the so-called “Modular Centrality” to networks with overlapping communities.
Indeed, it is a frequent scenario in real-world networks, especially for social networks where nodes usually belong to several communities.
The “Overlapping Modular Centrality” is a two-dimensional measure that quantifies the local and global influence of overlapping and non-overlapping nodes.
Extensive experiments have been performed on synthetic and real-world data using the Susceptible-Infected-Recovered (SIR) epidemic model.
Results show that the Overlapping Modular Centrality outperforms its alternatives designed for non-modular networks.
These investigations provide better knowledge on the influence of the various parameters governing the overlapping community structure on the nodes’ centrality.
Additionally, two combinations of the components of the Overlapping Modular Centrality are evaluated.
Comparative analysis with competing methods shows that they produce more efficient centrality scores.

Related Results

Connectivity-based time centrality in time-varying graphs
Connectivity-based time centrality in time-varying graphs
Abstract Time-varying graphs (TVGs) enable the study and understanding of the dynamics of many real-world networked systems. The notion of centrality in TVG scenario...
The independence of the centrality for community detection
The independence of the centrality for community detection
Community detection is significative in the complex network. This paper focuses on community detection based on clustering algorithms. We tend to find out the central nodes of the ...
ACM SIGCOMM computer communication review
ACM SIGCOMM computer communication review
At some point in the future, how far out we do not exactly know, wireless access to the Internet will outstrip all other forms of access bringing the freedom of mobility to the way...
Trip Centrality: walking on a temporal multiplex with non-instantaneous link travel time
Trip Centrality: walking on a temporal multiplex with non-instantaneous link travel time
AbstractIn complex networks, centrality metrics quantify the connectivity of nodes and identify the most important ones in the transmission of signals. In many real world networks,...
Evolution of Antimicrobial Resistance in Community vs. Hospital-Acquired Infections
Evolution of Antimicrobial Resistance in Community vs. Hospital-Acquired Infections
Abstract Introduction Hospitals are high-risk environments for infections. Despite the global recognition of these pathogens, few studies compare microorganisms from community-acqu...
Is ‘distinctiveness centrality’ actually distinctive? A comment on Fronzetti Colladon and Naldi (2020)
Is ‘distinctiveness centrality’ actually distinctive? A comment on Fronzetti Colladon and Naldi (2020)
Distinctiveness centrality, which was proposed in 2020 to identify nodes that are connected to poorly-connected neighbors, is simply a minor variation on two existing centrality me...
Triangle Centrality
Triangle Centrality
Triangle centrality is introduced for finding important vertices in a graph based on the concentration of triangles surrounding each vertex. It has the distinct feature of allowing...
Local Fuzzy Community Detection in Networks
Local Fuzzy Community Detection in Networks
Background: Community detection is significant for the understanding of the structure and function of networks, and becomes an attractive topic for researchers. However, many exist...

Back to Top